Information completeness in Nelson algebras of rough sets induced by quasiorders

From MaRDI portal
Publication:383570

DOI10.1007/S11225-012-9421-ZzbMATH Open1322.68193arXiv1203.2136OpenAlexW3100608543MaRDI QIDQ383570FDOQ383570


Authors: Jouni Järvinen, Piero Pagliani, Sándor Radeleczki Edit this on Wikidata


Publication date: 5 December 2013

Published in: Studia Logica (Search for Journal in Brave)

Abstract: 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 the well-known construction by Sendlewski. 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 a quasiorder 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.


Full work available at URL: https://arxiv.org/abs/1203.2136




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Information completeness in Nelson algebras of rough sets induced by quasiorders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383570)