Rough sets and Nelson algebras

Fundamenta Informaticae

Volumn 27, Issue 2-3, 1996, Pages 205-219

  Pagliani, Piero ^a  

^a Research Group on Knowledge and Communication Models   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; EQUIVALENCE CLASSES; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS;

APPROXIMATION SPACE; HEYTING ALGEBRA; NELSON ALGEBRAS; ROUGH SETS; STONE ALGEBRAS;

SET THEORY;

EID: 0030217595     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-272308     Document Type: Article

References (27)

1. R. Balbes, P. Dwinger, Distributive Lattices, University of Missouri Press, 1974.
2. J. L. Bell, Orthologic, Forcing, and the Manifestation of Attributes. In C. Tr. Chong M. J. Wiks (eds.) Proc. Southeast Asian Conf. on Logic, North-Holland, 1983.
3. V. Boicescu, A. Filipoiu, G. Georgescu and S. Rudeanu, Łukasiewicz-Moisil Algebras, North-Holland, Amsterdam-New York-Oxford-Tokio. 1991.
4. R. Giuntini, A Semantical Investigation on Brouwer-Zadeh Logic, Jour. of Philosophical Logic, 20, 1991, pp. 411-433.
5. R. Cignoli, The class of Kleene algebras satisfying an interpolation property and Nelson algebras, Algebra Universalis, 23, 1986, pp. 262-292.
6. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove and D. Scott, A compendium of continuous lattices, Springer Verlag, 1980.
7. G. Cattaneo and G. Nisticó, Brouwer-Zadeh posets and three-valued Łukasiewicz posets, Jour. of Fuzzy Sets and Systems, 25, 1988.
8. T. B. Iwinski, Rough Orders and Rough Concepts, Bull. Polish Acad. of Sciences, Math., 37 (3-4), 1988, pp. 187-192.
9. G. Epstein and A. Horn, Chain based lattices, Jour. of Mathematics, 55 (1), 1974.
10. D. Nelson, Constructible Falsity, JSL, 14, 1949.
11. M. Novotný and Z. Pawlak, On representation of rough sets by means of information systems. Fundamenta Informaticae, 6, 1983, pp. 189-296.
12. M. Novotný and Z. Pawlak, Characterization of Rough Top Equalities and Rough Bottom Equalities, Bull. Polish Acad. of Sciences, Math., 33 (1-2), 1985, pp. 91-97.
13. M. Novotný and Z. Pawlak, On Rough Equalities, Bull. Polish Acad. of Sciences, Math., 33 (1-2), 1985, pp. 99-104.
14. M. Novotný and Z. Pawlak, Black box analysis and Rough Top Equalities, Bull. Polish Acad. of Science, Math., 33 (1-2), 1985, pp. 105-113.
15. M. Novotný and Z. Pawlak, Algebraic Theory of Independence in Information Systems, Fundamenta Informaticae, 14, 1991, pp. 454-476.
16. P. Pagliani, Some remarks on Special Lattices and related constructive logics with Strong Negation, Notre Dame Jour. of Formal Logic, 31 (4),1990, pp. 515-528.
17. P. Pagliani, Rough Sets and Nelson algebras, Seminar held at the Polytechnic of Warsaw, February 15, 1993.
18. P. Pagliani, A pure logic-algebraic analysis on rough top and rough bottom equalities, in Proc. of Rough Sets and Knowledge Discovery '93, Banff, October 1993.
19. P. Pagliani, 1995, Rough Sets Systems and Logic algebraic structures. (to appear in E. Orlowska (ed.) Modelling incomplete information: fundamentals and applications. Springer).
20. Z. Pawlak, Rough Sets, ICS PAS Reports, 431, 1981.
21. Z. Pawlak, Rough Sets. Algebraic and Topological approach, Intern. Jour. of Inform. and Comp. Sciences, 11, 1982, pp. 341-366.
22. Z. Pawlak, Rough Sets: A Theoretical Approach to Reasoning about Data. Kluwer, Dordrecht-Boston, 1991.
23. J. Pomykała and J. A. Pomykała, The Stone Algebra of Rough Sets, Bull. Polish Acad. of Sciences, Math., 36 (7-8),1988, pp 495-508.
24. H. Rasiowa, An Algebraic Approach to Non Classical Logics, North-Holland, Amsterdam-New York-Oxford-Tokio, 1974.
25. A. Sendlewski, Nelson Algebras Through Heyting Ones: I. Studia Logica, 49 (1), 1990, pp. 105-126.
26. D. Vakarelov, Notes on N-lattices and Constructive Logics with Strong Negation. Studia Logica, 36, 1977, pp. 109-125.
27. R. Wille, Restructuring Lattice Theory, in I. Rival (ed.) Ordered Sets, NATO ASI Series 83, Reidel, 1982, pp. 445-470.