Access the full text.
Sign up today, get DeepDyve free for 14 days.
Chapter 5 Logic and Rough Sets: An Overview “Any specific object has a specific logic” K. Marx. Since the present Part has a certain complexity, it is worth introduc- ing, with some details, the intuitive motivations of the entire picture and their connections with the mathematical machinery which will be used. 5.1 Foreword Thus, let us sum up what we have discussed and discovered as far as now. In Rough Set Theory, the starting point is a collection of observa- tions which are stored in an Information System I and which induces an indiscernibility space U, E. We denote the family of all basic cate- gories by IN D(I). We have seen that from any Information System I one can compute the extension D on the universe U of a basic property D which we call a I-basic property, because it can be formulated using the linguistic material from I. I-basic properties make it possible to classify the objects from U into different disjoint equivalence classes which are to be intended as For instance, if I is an Attribute Systems, a deterministic property is a conjunc- tion of sentences of the form “ai = vj ”, where ai ranges
Published: Jan 1, 2008
Keywords: Boolean Algebra; Approximation Space; Strong Negation; Stone Algebra; Constructive System
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.