Studia Logica

, Volume 101, Issue 5, pp 1073–1092

Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders

  • Jouni Järvinen
  • Piero Pagliani
  • Sándor Radeleczki

DOI: 10.1007/s11225-012-9421-z

Cite this article as:
Järvinen, J., Pagliani, P. & Radeleczki, S. Stud Logica (2013) 101: 1073. doi:10.1007/s11225-012-9421-z


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.


Rough setsNelson algebrasQuasiorders (preorders)Knowledge representationBoolean congruenceGlivenko congruenceLogics with strong negation

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  • Jouni Järvinen
    • 1
  • Piero Pagliani
    • 2
  • Sándor Radeleczki
    • 3
  1. 1.TurkuFinland
  2. 2.Research Group on Knowledge and Communication ModelsRomaItaly
  3. 3.Institute of MathematicsUniversity of MiskolcMiskolc-EgyetemvárosHungary