Admissibility and unifiability in contact logics

Creative Commons License

Balbiani P., Gencer Ç.

10th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2013, Gudauri, Gürcistan, 23 - 27 Eylül 2013, cilt.8984, ss.44-60 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 8984
  • Doi Numarası: 10.1007/978-3-662-46906-4_4
  • Basıldığı Şehir: Gudauri
  • Basıldığı Ülke: Gürcistan
  • Sayfa Sayıları: ss.44-60
  • Anahtar Kelimeler: Admissibility, Contact logics, Decidability, Unifiability
  • İstanbul Kültür Üniversitesi Adresli: Evet

Özet

Contact logics are logics for reasoning about the contact relations between regular subsets in a topological space. Admissible inference rules can be used to improve the performance of any algorithm that handles provability within the context of contact logics. The decision problem of unifiability can be seen as a special case of the decision problem of admissibility. In this paper, we examine the decidability of admissibility problems and unifiability problems in contact logics.