Admissibility and Unifiability in Contact Logics
From MaRDI portal
Publication:3455182
DOI10.1007/978-3-662-46906-4_4zbMath1326.03034OpenAlexW951355003MaRDI QIDQ3455182
Philippe Balbiani, Çiğdem Gencer
Publication date: 3 December 2015
Published in: Logic, Language, and Computation (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/19007/1/balbiani_19007.pdf
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Topological spaces and generalizations (closure spaces, etc.) (54A05) Decidability of theories and sets of sentences (03B25)
Related Items (2)
Contact Logic is Finitary for Unification with Constants ⋮ Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean logics with relations
- Unification in linear temporal logic LTL
- Proof theory for admissible rules
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Admissibility of logical inference rules
- Best solving modal equations
- A representation theorem for Boolean contact algebras
- Unification in modal and description logics
- Admissible Rules of Lukasiewicz Logic
- Unifiability in extensions of K4
- Unification in the Description Logic $\mathcal{EL}$
- Unification in intuitionistic logic
- Description of Modal Logics Inheriting Admissible Rules for K4
- Undecidability of the unification and admissibility problems for modal and description logics
This page was built for publication: Admissibility and Unifiability in Contact Logics
