Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders
In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder R, its rough set-based Nelson algebra can be obtained by applying Sendlewski’s well-known construction. We prove that if the set of all R-closed elements, which may be viewed as the set of completely defined objects, is cofinal, then the rough set-based Nelson algebra determined by the quasiorder R forms an effective lattice, that is, an algebraic model of the logic E0, which is characterised by a modal operator grasping the notion of “to be classically valid”. We present a necessary and sufficient condition under which a Nelson algebra is isomorphic to a rough set-based effective lattice determined by a quasiorder.
KeywordsRough sets Nelson algebras Quasiorders (preorders) Knowledge representation Boolean congruence Glivenko congruence Logics with strong negation
Unable to display preview. Download preview PDF.
- 1.Akama, S., Presupposition and frame problem in knowledge bases, in F. M. Brown (ed.), The Frame Problem in Artificial Intelligence, Kaufmann, Los Altos, CA, 1987, pp. 193–203.Google Scholar
- 2.Barwise J., Perry J.: Situations and Attitudes. MIT Press, Cambridge, MA (1983)Google Scholar
- 3.Blyth T.S.: Lattices and Ordered Algebraic Structures. Springer, London (2005)Google Scholar
- 5.Gabbay D.M.: Labelled Systems. Oxford University Press, Oxford (1997)Google Scholar
- 7.Greco, S., B. Matarazzo, and R. Słowinski, Data mining tasks and methods: Classification: multicriteria classification, in W. Klösgen and J. Zytkow (eds.), Handbook of Data Mining and Knowledge Discovery, Oxford University Press, Oxford, 2002, pp. 318–328.Google Scholar
- 8.Iturrioz, L., Rough sets and three-valued structures, in E. Orłowska (ed.), Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, Physica-Verlag, Heidelberg, 1999, pp. 596–603.Google Scholar
- 9.Järvinen, J., Lattice theory for rough sets, Transactions on Rough Sets VI:400–498, 2007.Google Scholar
- 10.Järvinen, J., P. Pagliani, and S. Radeleczki, Atomic information completeness in generalised rough set systems, Extended Abstracs of the 3rd International Workshop on Rough Set Theory (RST11) 14–16 September 2011, Milano, Italy.Google Scholar
- 14.Medvedev, Y. T., Finite problems, Soviet Mathematics, Doklady 3:227–230, 1962 (Doklady Academii Nauk SSSR 142:1015–1018, 1962, in Russian).Google Scholar
- 17.Nagarajan, E., and D. Umadevi, A method of representing rough sets system determined by quasi orders, Order in print. doi:10.1007/s11083-011-9245-x.
- 20.Pagliani, P., A pure logic-algebraic analysis of rough top and rough bottom equalities, in Proceedings of the International Conference on Rough Sets and Knowledge Discovery, Banff, 1993, pp. 227–236.Google Scholar
- 21.Pagliani P.: Rough sets and Nelson algebras. Fundamenta Informaticae 27, 205–219 (1996)Google Scholar
- 22.Pagliani, P., Rough set systems and logic-algebraic structures, in E. Orłowska (ed.), Incomplete Information: Rough Set Analysis, Physica-Verlag, Heidelberg, 1998, pp. 109–190.Google Scholar
- 23.Pagliani P., Chakraborty M.: A Geometry of Approximation, Rough Set Theory, Logic, Algebra and Topology of Conceptual Patterns. Springer, Heidelberg (2008)Google Scholar
- 25.Rasiowa H.: An Algebraic Approach to Non-classical Logics. North-Holland, Amsterdam (1974)Google Scholar
- 29.Vickers S.: Topology Via Logic. Cambridge University Press, Cambridge (1989)Google Scholar