Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
DOI10.1016/J.IJAR.2013.07.005zbMATH Open1316.06011arXiv1312.6263OpenAlexW1664205513MaRDI QIDQ2353687FDOQ2353687
Wojciech Dzik, Jouni Järvinen, Michiro Kondo
Publication date: 16 July 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6263
Recommendations
rough setsintuitionistic logicHeyting algebrasrepresentation theoremscanonical framesbounded distributive lattices with Galois connectionsGC-framesHeyting-Brouwer algebras
Theory of fuzzy sets, etc. (03E72) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Frames, locales (06D22) Logical aspects of lattices and related structures (03G10) Structure and representation theory of distributive lattices (06D05) Heyting algebras (lattice-theoretic aspects) (06D20)
Cites Work
- Rough sets
- Rings of sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boolean Algebras with Operators. Part I
- Lattice Theory for Rough Sets
- Title not available (Why is that?)
- Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
- Axiomatic characterizations of dual concept lattices
- Title not available (Why is that?)
- The concept lattice functors
- Representation of nondeterministic information
- Title not available (Why is that?)
- Intuitionistic propositional logic with Galois connections
- Logics from Galois connections
- Optimal triangular decompositions of matrices with entries from residuated lattices
- Axiomatic systems for rough set-valued homomorphisms of associative rings
- Intuitionistic modal logic with a galois connection has the finite model property1
Cited In (8)
- Generating Isotone Galois Connections on an Unstructured Codomain
- Axiomatic approaches to rough approximation operators on complete completely distributive lattices
- Algebraic Representation, Dualities and Beyond
- Rough sets determined by tolerances
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain
- Hilbert algebras with Hilbert-Galois connections
- Intuitionistic propositional logic with Galois negations
- Representative set of objects in rough sets based on Galois connections
This page was built for publication: Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353687)