Abstract
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional one-sided sequents built from multisets of formulae. Our first calculus SKt is a variant of Kashima’s calculus for Kt, which can also be seen as a display calculus, and uses “shallow” inference whereby inference rules are only applied to the top-level nodes in the nested structures. The rules of SKt include certain structural rules, called “display postulates”, which are used to bring a node to the top level and thus in effect allow inference rules to be applied to an arbitrary node in a nested sequent. The cut elimination proof for SKt uses a proof substitution technique similar to that used in cut elimination for display logics. We then consider another, more natural, calculus DKt which contains no structural rules (and no display postulates), but which uses deep-inference to apply inference rules directly at any node in a nested sequent. This calculus corresponds to Kashima’s S2Kt, but with all structural rules absorbed into logical rules. We show that SKt and DKt are equivalent, that is, any cut-free proof of SKt can be transformed into a cut-free proof of DKt, and vice versa. We consider two extensions of tense logic, Kt.S4 and S5, and show that this equivalence between shallow- and deep-sequent systems also holds. Since deep-sequent systems contain no structural rules, proof search in the calculi is easier than in the shallow calculi. We outline such a procedure for the deep-sequent system DKt and its S4 extension.
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
Areces, C., Bernardi, R.: Analyzing the core of categorial grammar. Journal of Logic, Language, and Information 13(2), 121–137 (2004)
Belnap, N.: Display logic. Journal of Philosophical Logic 11, 375–417 (1982)
Brünnler, K.: Deep sequent systems for modal logic. In: Governatori, G., et al. (eds.) Advances in Modal Logic 6, pp. 107–119. College Publications (2006)
Brünnler, K.: Deep sequents for modal logic (unpublished, 2007)
Castilho, M.A., Cerro, L.F.D., Gasquet, O., Herzig, A.: Modal tableaux with propagation rules and structural rules. Fundamenta Informaticae 32(3/4), 281–297 (1997)
Goré, R., Gaggles, Gentzen, Galois: How to display your favourite substructural logic. Logic Journal of the IGPL 6(5), 669–694 (1998)
Goré, R.: Substructural logics on display. LJIGPL 6(3), 451–504 (1998)
Goré, R., Postniece, L., Tiu, A.: Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents. In: AiML. College Publications (2008)
Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS(LNAI), vol. 1071, pp. 210–225. Springer, Heidelberg (1996)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8(3), 239–264 (2000)
Indrzejczak, A.: Multiple sequent calculus for tense logics. In: International Conference on Temporal Logic, Leipzig, pp. 93–104 (2000)
Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Logica 53, 119–135 (1994)
Kracht, M.: Power and weakness of the modal display calculus. In: Wansing, H. (ed.) Proof Theory of Modal Logics, pp. 92–121. Kluwer, Dordrecht (1996)
Negri, S.: Proof analysis in modal logic. JPL 34(5–6), 507–544 (2005)
Poggiolesi, F.: The tree-hypersequent method for modal propositional logic. In: Trends in Logic: Towards Mathematical Philsophy, pp. 9–30 (2009)
Trzesicki, K.: Gentzen-style axiomatization of tense logic. Bulleting of the Section of Logic 13(2), 75–84 (1984)
Wansing, H.: Sequent calculi for normal modal proposisional logics. Journal of Logic and Computation 4(2), 125–142 (1994)
Wansing, H.: Displaying Modal Logic. Kluwer Academic Publishers, Dordrecht (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goré, R., Postniece, L., Tiu, A. (2009). Taming Displayed Tense Logics Using Nested Sequents with Deep Inference. In: Giese, M., Waaler, A. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2009. Lecture Notes in Computer Science(), vol 5607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02716-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02716-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02715-4
Online ISBN: 978-3-642-02716-1
eBook Packages: Computer ScienceComputer Science (R0)