Simone Martini
Skip Abstract Section
Abstract
We extend to natural deduction the approach of Linear Nested Sequents and of 2-Sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction: only one introduction and one elimination rule per connective, no additional (structural) rule, no explicit reference to the accessibility relation of the intended Kripke models. We give systems for the normal modal logics from K to S4. For the intuitionistic versions of the systems, we define proof reduction, and prove proof normalization, thus obtaining a syntactical proof of consistency. For logics K and K4 we use existence predicates (à la Scott) for formulating sound deduction rules.
- Mathias Baaz and Rosalie Iemhoff. 2005. On the proof theory of the existence predicate. In We Will Show Them! Essays in Honour of Dov Gabbay, Sergei N. Artëmov, Howard Barringer, Artur S. d’Avila Garcez, Luís C. Lamb, and John Woods (Eds.). College Publications, London, U.K., 125–166.Google Scholar
- Stefano Baratella and Andrea Masini. 2003. A proof-theoretic investigation of a logic of positions. Annals of Pure and Applied Logic 123, 1–3 (2003), 135–162. DOI:https://doi.org/10.1016/S0168-0072(03)00021-6Google ScholarCross Ref
- Stefano Baratella and Andrea Masini. 2004. An infinitary variant of metric temporal logic over dense time domains. Mathematical Logic Quarterly 50, 3 (2004), 249–257. DOI:https://doi.org/10.1002/malq.200310096Google ScholarCross Ref
- Stefano Baratella and Andrea Masini. 2004. An approach to infinitary temporal proof theory. Archive for Mathematical Logic 43, 8 (2004), 965–990. DOI:https://doi.org/10.1007/s00153-004-0237-zGoogle ScholarCross Ref
- Stefano Baratella and Andrea Masini. 2013. A natural deduction system for bundled branching time logic. Journal of Applied Non-Classical Logics 23, 3 (2013), 268–283. DOI:https://doi.org/10.1080/11663081.2013.830401Google ScholarCross Ref
- Stefano Baratella and Andrea Masini. 2019. A two-dimensional metric temporal logic. Mathematical Logic Quarterly 13 (2019), 1–13. DOI:https://doi.org/10.1002/malq.201700036Google Scholar
- Jean-Yves Girard. 1987. Proof Theory and Logical Complexity. Studies in Proof Theory. Monographs, Vol. 1. Bibliopolis, Naples. 505 pages.Google Scholar
- Stefano Guerrini, Simone Martini, and Andrea Masini. 1998. An analysis of (linear) exponentials based on extended sequents. Logic Journal of the IGPL 6, 5 (1998), 735–753. DOI:https://doi.org/10.1093/jigpal/6.5.735Google ScholarCross Ref
- Stefano Guerrini, Simone Martini, and Andrea Masini. 2001. Proof nets, garbage, and computations. Theoretical Computer Science 253, 2 (2001), 185–237. DOI:https://doi.org/10.1016/S0304-3975(00)00094-3 Google ScholarDigital Library
- Stefano Guerrini, Simone Martini, and Andrea Masini. 2003. Coherence for sharing proof-nets. Theoretical Computer Science 294, 3 (2003), 379–409. DOI:https://doi.org/10.1016/S0304-3975(01)00162-1 Google ScholarDigital Library
- Kensuke Kojima. 2012. Semantical Study of Intuitionistic Modal Logics. Ph.D. dissertation. Graduate School of Informatics, Kyoto University.Google Scholar
- Björn Lellmann. 2015. Linear nested sequents, 2-sequents and hypersequents. In Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’15), Lecture Notes in Computer Science, Vol. 9323,Hans De Nivelle (Ed.). Springer International Publishing, Cham, 135–150. DOI:https://doi.org/10.1007/978-3-319-24312-2_10 Google ScholarDigital Library
- Björn Lellmann and Elaine Pimentel. 2019. Modularisation of sequent calculi for normal and non-normal modalities. ACM Transactions on Computational Logic 20, 2 (April 2019), 1–46. DOI:https://doi.org/10.1145/3288757 Google ScholarDigital Library
- Björn Lellmann and Elaine Pimentel. 2019. Modularisation of sequent calculi for normal and non-normal modalities. ACM Transactions on Computtational Logic 20, 2 (2019), 7:1–7:46. DOI:https://doi.org/10.1145/3288757 Google ScholarDigital Library
- Simone Martini and Andrea Masini. 1993. On the fine structure of the exponential rule. In Advances in Linear Logic, J.-Y. Girard, Y. Lafont, and L. Regnier (Eds.). Cambridge University Press, Cambridge, U.K., 197–210. Google ScholarDigital Library
- Simone Martini and Andrea Masini. 1996. A computational interpretation of modal proofs. In Proof Theory of Modal Logics, H. Wansing (Ed.). Kluwer, Dordrecht, 213–241.Google Scholar
- Andrea Masini. 1992. 2-Sequent calculus: A proof theory of modalities. Annals of Pure and Applied Logic 58, 3 (1992), 229–246. DOI:https://doi.org/10.1016/0168-0072(92)90029-YGoogle ScholarCross Ref
- Andrea Masini. 1993. 2-Sequent calculus: Intuitionism and natural deduction. Journal of Logic and Computation 3, 5 (1993), 533–562. DOI:https://doi.org/10.1093/logcom/3.5.533Google ScholarCross Ref
- Andrea Masini, Luca Viganò, and Marco Volpe. 2010. Back from the future. Journal of Applied Non-Classical Logics 20, 3 (2010), 241–277. DOI:https://doi.org/10.3166/jancl.20.241-277Google ScholarCross Ref
- Andrea Masini, Luca Viganò, and Marco Volpe. 2010. A history of until. Electronic Notes in Theoretical Computer Science 262 (2010), 189–204. DOI:https://doi.org/10.1016/j.entcs.2010.04.014 Google ScholarDigital Library
- Andrea Masini, Luca Viganò, and Marco Volpe. 2011. Labelled natural deduction for a bundled branching temporal logic. Journal of Logic and Computation 21, 6 (2011), 1093–1163. DOI:https://doi.org/10.1093/logcom/exq028 Google ScholarDigital Library
- Andrea Masini, Luca Viganò, and Margherita Zorzi. 2008. A qualitative modal representation of quantum register transformations. In Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL’08), G. Dueck (Ed.). IEEE Computer Society Press, Piscataway, NJ, 131–137. Google ScholarDigital Library
- Andrea Masini, Luca Viganò, and Margherita Zorzi. 2011. Modal deduction systems for quantum state transformations. Journal of Multiple-Valued Logic and Soft Computing 17, 5–6 (2011), 475–519.Google Scholar
- Sara Negri. 2011. Proof theory for modal logic. Philosophy Compass 6, 8 (2011), 523–538. DOI:https://doi.org/10.1111/j.1747-9991.2011.00418.xGoogle ScholarCross Ref
- Elaine Pimentel, Revantha Ramanayake, and Björn Lellmann. 2019. Sequentialising nested systems. In Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2019, Lecture Notes in Computer Physics, Vol. 11714, Serenella Cerrito and Andrei Popescu (Eds.). Springer International Publishing, Cham, 147–165. DOI:https://doi.org/10.1007/978-3-030-29026-9_9Google ScholarCross Ref
- Dag Prawitz. 1965. Natural Deduction. A Proof-Theoretical Study. Almqvist & Wiksell, Stockholm.Google Scholar
- Dana Scott. 1979. Identity and existence in intuitionistic logic. In Applications of Sheaves: Proceedings of the Research Symposium on Applications of Sheaf Theory to Logic, Algebra, and Analysis,Lecture Notes in Mathematics, Vol. 753, M. P. Fourman, C. J. Mulvey, and D. S. Scott (Eds.). Springer, Berlin, 660–696.Google ScholarCross Ref
- Alex Simpson. 1993. The Proof Theory and Semantics of Intuitionistic Modal Logic. Ph.D. dissertation. University of Edinburgh, UK.Google Scholar
- Anne Sjerp Troelstra and Dirk van Dalen. 1988. Constructivism in Mathematics (2 volumes). North-Holland, Amsterdam.Google Scholar
- Luca Viganò. 2000. Labelled Non-Classical Logics. Kluwer Academic Publishers, Dordrecht.Google ScholarCross Ref
Index Terms
- From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics
Recommendations
Natural Deduction for Full S5 Modal Logic with Weak Normalization
Natural deduction systems for classical, intuitionistic and modal logics were deeply investigated by Prawitz [Prawitz, D., ''Natural Deduction: A Proof-theoretical Study'', Stockholm Studies in Philosophy 3, Almqvist and Wiksell, Stockholm, 1965] from a ...
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents
Logical Foundations of Computer ScienceAbstractThis paper employs the linear nested sequent framework to design a new cut-free calculus () for intuitionistic fuzzy logic—the first-order Gödel logic characterized by linear relational frames with constant domains. Linear nested sequents—which ...
Nested Sequents for Quantified Modal Logics
Automated Reasoning with Analytic Tableaux and Related MethodsAbstractThis paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains. Each ...
Comments