Contact Logic is Finitary for Unification with Constants

DOI10.1007/978-981-15-1342-8_4zbMath1484.03045OpenAlexW3004185591MaRDI QIDQ3298276

Philippe Balbiani, Çiğdem Gencer

Publication date: 14 July 2020

Published in: Logic in Asia: Studia Logica Library (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-1342-8_4

zbMATH Keywords

unification typeunification with constantscontact logic

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of Boolean unification
• Admissibility of logical inference rules
• Qualitative spatial reasoning with topological information
• Best solving modal equations
• A representation theorem for Boolean contact algebras
• Spatial logics with connectedness predicates
• Unification in modal and description logics
• Topological Logics with Connectedness over Euclidean Spaces
• Blending margins: the modal logic K has nullary unification type
• Admissibility and Unifiability in Contact Logics
• Unifiability in extensions of K4
• Unification in the Description Logic $\mathcal{EL}$
• KD is nullary
• Description of Modal Logics Inheriting Admissible Rules for K4
• Filtering unification and most general unifiers in modal logic

This page was built for publication: Contact Logic is Finitary for Unification with Constants