Abstract
The longstanding research line investigating free algebra constructions in modal logic from an algebraic and coalgebraic point of view recently lead to the notion of a one-step frame [14], [8]. A one-step frame is a two-sorted structure which admits interpretations of modal formulae without nested modal operators. In this paper, we exploit the potential of one-step frames for investigating proof-theoretic aspects. This includes developing a method which detects when a specific rule-based calculus Ax axiomatizing a given logic L has the so-called bounded proof property. This property is a kind of an analytic subformula property limiting the proof search space. We define conservative one-step frames and prove that every finite conservative one-step frame for Ax is a p-morphic image of a finite Kripke frame for L iff Ax has the bounded proof property and L has the finite model property. This result, combined with a ‘one-step version’ of the classical correspondence theory, turns out to be quite powerful in applications. For simple logics such as K, T, K4, S4, etc, establishing basic metatheoretical properties becomes a completely automatic task (the related proof obligations can be instantaneously discharged by current first-order provers). For more complicated logics, some ingenuity is needed, however we successfully applied our uniform method to Avron’s cut-free system for GL and to Goré’s cut-free system for S4.3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: A Cook’s tour of the finitary non-well-founded sets. In: Essays in Honour of Dov Gabbay, pp. 1–18. College Publications (2005)
Avron, A.: On modal systems having arithmetical interpretations. J. Symbolic Logic 49(3), 935–942 (1984)
van Benthem, J.: Modal logic and classical logic. Indices: Monographs in Philosophical Logic and Formal Linguistics, III. Bibliopolis, Naples (1985)
van Benthem, J.: Modal frame correspondences and fixed-points. Studia Logica 83(1-3), 133–155 (2006)
van Benthem, J., Bezhanishvili, N., Hodkinson, I.: Sahlqvist correspondence for modal mu-calculus. Studia Logica 100, 31–60 (2012)
Bezhanishvili, N., Gehrke, M.: Finitely generated free Heyting algebras via Birkhoff duality and coalgebra. Log. Methods Comput. Sci. 7(2:9), 1–24 (2011)
Bezhanishvili, N., Ghilardi, S.: Bounded proofs and step frames. Technical Report 306, Department of Philosophy, Utrecht University (2013)
Bezhanishvili, N., Ghilardi, S., Jibladze, M.: Free modal algebras revisited: the step-by-step method. In: Leo Esakia on Duality in Modal and Intuitionistic Logics. Trends in Logic. Springer (to appear, 2013)
Bezhanishvili, N., Kurz, A.: Free modal algebras: A coalgebraic perspective. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 143–157. Springer, Heidelberg (2007)
Chagrov, A., Zakharyaschev, M.: Modal Logic. The Clarendon Press (1997)
Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Ann. Pure Appl. Logic 163(3), 266–290 (2012)
Conradie, W., Ghilardi, S., Palmigiano, A.: Unified correspondence. In: Essays in Honour of J. van Benthem (to appear)
Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods Comput. Sci. 2(1:5), 1–26 (2006)
Coumans, D., van Gool, S.: On generalizing free algebras for a functor. Journal of Logic and Computation 23(3), 645–672 (2013)
Fine, K.: Normal forms in modal logic. Notre Dame J. Formal Logic 16, 229–237 (1975)
Ghilardi, S.: An algebraic theory of normal forms. Annals of Pure and Applied Logic 71, 189–245 (1995)
Ghilardi, S.: Continuity, freeness, and filtrations. J. Appl. Non-Classical Logics 20(3), 193–217 (2010)
Goranko, V., Vakarelov, D.: Elementary canonical formulae: extending Sahlqvist’s theorem. Ann. Pure Appl. Logic 141(1-2), 180–217 (2006)
Goré, R.: Cut-free sequent and tableaux systems for propositional diodorean modal logics. Technical report, Dept. of Comp. Sci., Univ. of Manchester (1993)
Kracht, M.: Tools and techniques in modal logic. Studies in Logic and the Foundations of Mathematics, vol. 142. North-Holland Publishing Co. (1999)
Negri, S., von Plato, J.: Structural proof theory. Cambridge University Press, Cambridge (2001)
Sambin, G., Vaccaro, V.: A new proof of Sahlqvist’s theorem on modal definability and completeness. Journal of Symbolic Logic 54, 992–999 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bezhanishvili, N., Ghilardi, S. (2013). Bounded Proofs and Step Frames. In: Galmiche, D., Larchey-Wendling, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2013. Lecture Notes in Computer Science(), vol 8123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40537-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-40537-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40536-5
Online ISBN: 978-3-642-40537-2
eBook Packages: Computer ScienceComputer Science (R0)