Information completeness in Nelson algebras of rough sets induced by quasiorders
From MaRDI portal
(Redirected from Publication:383570)
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 , 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 -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 , 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.
Recommendations
- Representation of Nelson algebras by rough sets determined by quasiorders
- Monteiro spaces and rough sets determined by quasiorder relations: models for Nelson algebras
- Publication:4892376
- Two axiomatizations of Nelson algebras.
- On the completion of rough sets system determined by arbitrary binary relations
Cites work
- scientific article; zbMATH DE number 41225 (Why is no real title available?)
- scientific article; zbMATH DE number 754436 (Why is no real title available?)
- scientific article; zbMATH DE number 1568685 (Why is no real title available?)
- scientific article; zbMATH DE number 927107 (Why is no real title available?)
- scientific article; zbMATH DE number 1442964 (Why is no real title available?)
- A constructivism based on classical truth
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A method of representing rough sets system determined by quasi orders
- An algebraic approach to non-classical logics
- Constructible falsity
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
- Lattice Theory for Rough Sets
- Lattices and ordered algebraic structures
- Nelson algebras through Heyting ones. I
- Notes on \(\eta\)-lattices and constructive logic with strong negation
- On partitioning ordered sets into cofinal subsets
- On the unity of logic
- Remarks on special lattices and related constructive logics with strong negation
- Representation of Nelson algebras by rough sets determined by quasiorders
- Rough sets
- Rough sets and three-valued structures
- Rough sets determined by quasiorders
- Some results on intermediate constructive logics
- The class of Kleene algebras satisfying an interpolation property and Nelson algebras
Cited in
(17)- Monteiro spaces and rough sets determined by quasiorder relations: models for Nelson algebras
- Lattices defined by multigranular rough sets
- Defining rough sets as core-support pairs of three-valued functions
- Rough sets determined by tolerances
- Rough Sets - Past, Present and Future: Some Notes
- Algebraic methods for granular rough sets
- On the completion of rough sets system determined by arbitrary binary relations
- Pseudo-Kleene algebras determined by rough sets
- Rough \(L\)-fuzzy sets: their representation and related structures
- Crypto-preorders, topological relations, information and logic
- Granular knowledge and rational approximation in general rough sets – I
- Nelson algebras, residuated lattices and rough sets: A survey
- Involutive right-residuated l-groupoids
- Algebraic representation, dualities and beyond
- Representation of Nelson algebras by rough sets determined by quasiorders
- Three lessons on the topological and algebraic hidden core of rough set theory
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
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)
