Logics from Galois connections

DOI10.1016/J.IJAR.2008.06.003MaRDI QIDQ2379337zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fuzzy setsapproximate reasoningrough setsmodal logicknowledge representation

Mathematics Subject Classification ID

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)

Recommendations

• Intuitionistic propositional logic with Galois connections
• Connections
• Characterizing intermediate tense logics in terms of Galois connections
• Intuitionistic modal logic with a Galois connection has the finite model property
• Lagois connections -- a counterpart to Galois connections

Cites work

• scientific article; zbMATH DE number 3988694 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 23768 (Why is no real title available?)
• scientific article; zbMATH DE number 3461905 (Why is no real title available?)
• scientific article; zbMATH DE number 701387 (Why is no real title available?)
• scientific article; zbMATH DE number 2150610 (Why is no real title available?)
• scientific article; zbMATH DE number 1876857 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• A unifying study between modal-like operators, topologies and fuzzy sets
• Applying modifiers to knowledge acquisition.
• Computational complexity of multimodal logics based on rough sets
• DAL -- a logic for data analysis
• Display calculi for logics with relative accessibility relations
• Fuzzy sets
• Hedges: A study in meaning criteria and the logic of fuzzy concepts
• Incomplete information: Structure, inference, complexity
• Information systems theoretical foundations
• Kripke semantics for knowledge representation logics
• L-fuzzy sets
• Lattice Theory for Rough Sets
• Metamathematics of fuzzy logic
• Modal logic
• Modal logics for knowledge representation systems
• Modal-like operators in Boolean lattices, Galois connections and fixed points
• On relationship between modified sets, topological spaces and rough sets
• On the structure of generalized rough sets
• Propositional Logics from Rough Set Theory
• ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
• Reasoning About Space: The Modal Way
• Representation of nondeterministic information
• Rough logic
• Rough sets
• Temporal algebra
• Universal grammar

Cited in

(20)

• Optimal triangular decompositions of matrices with entries from residuated lattices
• Gaggles, Gentzen and Galois: how to display your favourite substructural logic
• Characterizing intermediate tense logics in terms of Galois connections
• Algebraic aspects of generalized approximation spaces
• Generating isotone Galois connections on an unstructured codomain
• FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES
• MODAL, NECESSITY, SUFFICIENCY AND CO-SUFFICIENCY OPERATORS
• VARIOUS FRAMES AND CONNECTIONS
• Consequence relations and data science: from Galois mappings to data interpretation
• Intuitionistic propositional logic with Galois connections
• scientific article; zbMATH DE number 2149944 (Why is no real title available?)
• Imperative logic as based on a Galois connection
• Logics and Their Galaxies
• Hilbert algebras with Hilbert-Galois connections
• Intuitionistic propositional logic with Galois negations
• Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
• On the definition of suitable orderings to generate adjunctions over an unstructured codomain
• Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
• THE PROPERTIES OF ROUGH APPROXIMATIONS
• A Review on Rough Sets and Possible World Semantics for Modal Logics

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)