Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
bounded distributive lattices with Galois connectionscanonical framesGC-framesHeyting algebrasHeyting-Brouwer algebrasintuitionistic logicrepresentation theoremsrough sets
Theory of fuzzy sets, etc. (03E72) Logical aspects of lattices and related structures (03G10) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Structure and representation theory of distributive lattices (06D05) Heyting algebras (lattice-theoretic aspects) (06D20) Frames, locales (06D22)
- Axiomatic characterizations of dual concept lattices
- Axiomatic systems for rough set-valued homomorphisms of associative rings
- Boolean Algebras with Operators. Part I
- scientific article; zbMATH DE number 3950488 (Why is no real title available?)
- scientific article; zbMATH DE number 3501559 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 5241983 (Why is no real title available?)
- Intuitionistic modal logic with a Galois connection has the finite model property
- Intuitionistic propositional logic with Galois connections
- Lattice Theory for Rough Sets
- Logics from Galois connections
- Optimal triangular decompositions of matrices with entries from residuated lattices
- Representation of nondeterministic information
- Rings of sets
- Rough sets
- Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
- The concept lattice functors
- Axiomatic approaches to rough approximation operators on complete completely distributive lattices
- Representative set of objects in rough sets based on Galois connections
- Rough sets determined by tolerances
- Intuitionistic propositional logic with Galois negations
- Hilbert algebras with Hilbert-Galois connections
- Algebraic representation, dualities and beyond
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain
- Generating isotone Galois connections on an unstructured codomain
- On Heyting algebras with negative tense operators. II.
- Characterization of subdirectly irreducible Heyting algebras with negative tense operators
- Heyting algebras with Kalman-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)