Logics from Galois connections
DOI10.1016/J.IJAR.2008.06.003zbMATH Open1184.68484OpenAlexW2088048727MaRDI QIDQ2379337FDOQ2379337
Authors: Jouni Järvinen, Michiro Kondo, Jari Kortelainen 
Publication date: 19 March 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2008.06.003
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Modal logic (including the logic of norms) (03B45) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Logic in artificial intelligence (68T27)
Cites Work
- Rough sets
- Fuzzy sets
- Modal logic
- Metamathematics of fuzzy logic
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hedges: A study in meaning criteria and the logic of fuzzy concepts
- L-fuzzy sets
- Lattice Theory for Rough Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Temporal algebra
- Rough logic
- Modal logics for knowledge representation systems
- Propositional Logics from Rough Set Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reasoning About Space: The Modal Way
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of generalized rough sets
- Kripke semantics for knowledge representation logics
- On relationship between modified sets, topological spaces and rough sets
- Universal grammar
- A unifying study between modal-like operators, topologies and fuzzy sets
- Applying modifiers to knowledge acquisition.
- Incomplete information: Structure, inference, complexity
- Representation of nondeterministic information
- Information systems theoretical foundations
- Modal-like operators in Boolean lattices, Galois connections and fixed points
- DAL -- a logic for data analysis
- Title not available (Why is that?)
- Computational complexity of multimodal logics based on rough sets
- Display calculi for logics with relative accessibility relations
Cited In (20)
- FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES
- Imperative logic as based on a Galois connection
- Consequence relations and data science: from Galois mappings to data interpretation
- MODAL, NECESSITY, SUFFICIENCY AND CO-SUFFICIENCY OPERATORS
- VARIOUS FRAMES AND CONNECTIONS
- Intuitionistic propositional logic with Galois connections
- Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
- Algebraic aspects of generalized approximation spaces
- Title not available (Why is that?)
- Generating isotone Galois connections on an unstructured codomain
- Characterizing intermediate tense logics in terms of Galois connections
- THE PROPERTIES OF ROUGH APPROXIMATIONS
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
- Logics and Their Galaxies
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain
- Gaggles, Gentzen and Galois: how to display your favourite substructural logic
- Hilbert algebras with Hilbert-Galois connections
- Intuitionistic propositional logic with Galois negations
- A Review on Rough Sets and Possible World Semantics for Modal Logics
- Optimal triangular decompositions of matrices with entries from residuated lattices
This page was built for publication: Logics from Galois connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379337)
