Rough sets determined by quasiorders

DOI10.1007/s11083-009-9130-zzbMath1191.06002arXiv0810.0633OpenAlexW3100832506MaRDI QIDQ1047187

Laura Veres, Jouni Järvinen, Sándor Radeleczki

Publication date: 4 January 2010

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

complementationquasiordercompletely distributive latticeStone latticeordered set of rough sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Complete distributivity (06D10) Theory of fuzzy sets, etc. (03E72) Pseudocomplemented lattices (06D15)

Related Items

Note on topologies induced by coverings of approximation spaces ⋮ REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS ⋮ Information completeness in Nelson algebras of rough sets induced by quasiorders ⋮ A method of representing rough sets system determined by quasi orders ⋮ Pseudo-Kleene algebras determined by rough sets ⋮ Approximation of sets based on partial covering ⋮ Representation of Nelson algebras by rough sets determined by quasiorders ⋮ Rough sets determined by tolerances ⋮ Defining rough sets as core-support pairs of three-valued functions ⋮ On the union and intersection operations of rough sets based on various approximation spaces ⋮ Rough sets based on Galois connections ⋮ Axiomatic approaches to rough approximation operators via ideal on a complete completely distributive lattice ⋮ Extended-order algebras as a generalization of posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
• Representation of nondeterministic information
• Normal double Stone algebras
• Towards automating duality
• Intervals in lattices of quasiorders
• Rings of sets
• Lattice Theory for Rough Sets
• Rough sets
• The Direct Decomposition of l-algebras into Products of Subdirectly Irreducible Factors
• Rough Sets and Current Trends in Computing
• On partitioning ordered sets into cofinal subsets
• Completely Distributive Complete Lattices