Complexity of the interpretability logic IL
نویسندگان
چکیده
We show that the decision problem for the basic system of interpretability logic IL is PSPACE– complete. For this purpose we present an algorithm which uses polynomial space with respect to the length of a given formula. The existence of such algorithm, together with the previously known PSPACE–hardness of the closed fragment of IL, implies PSPACE–completeness.
منابع مشابه
A sequent system for the interpretability logic with the persistence axiom
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose ✄-free fragment is the modal logic K4. Here, using the method in [Sas01], we give sequent systems for the interpretability logic ILP obtained by adding the persistence axiom P : (p✄ q) ⊃ ✷(p✄ q) to IL and for the logic IK4+P obtained by ...
متن کاملInterpretability in PRA
In this paper we study IL(PRA), the interpretability logic of PRA. As PRA is neither an essentially reflexive theory nor finitely axiomatizable, the two known arithmetical completeness results do not apply to PRA: IL(PRA) is not ILM or ILP. IL(PRA) does of course contain all the principles known to be part of IL(All), the interpretability logic of the principles common to all reasonable arithme...
متن کاملThe Interpolation Theorem for IL and ILP
In this article we establish interpolation for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the-modality easily follow from this. Furthermore, these properties are extended to the system ILP. The related issue of Beth Deenability is also addressed. As usual, the arrow interpolation property...
متن کاملInterpretability Logic
This is an overview a study of interpretability logic in Zagreb for the last twenty years: a brief history and some planes for further research. The idea of treating a provability predicate as a modal operator goes back to Gödel. The same idea was taken up later by Kripke and Montague, but only in the mid–seventies was the correct choice of axioms, based on Löb’s theorem, seriously considered b...
متن کاملBisimulation quotients of Veltman models
Interpretability logic is a modal description of the interpretability predicate. The modal system IL is an extension of the provability logic GL (Gödel–Löb). Bisimulation quotients and largest bisimulations have been well studied for Kripke models. We examine interpretability logic and consider how these results extend to Veltman models. REPORTS ON MATHEMATICAL LOGIC 40 (2006), 59–73 Domagoj VR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017