Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics

Author: Kosheleva A.  

Publisher: Springer Publishing Company

ISSN: 0002-5232

Source: Algebra and Logic, Vol.44, Iss.4, 2005-07, pp. : 243-255

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

We examine some many-modal logics extending S5t, t ∈ N, for decidability w.r.t. admissibility of inference rules, and for the logics in question, we prove an algorithmic criterion determining whether the inference rules in them are admissible.