Affiliation:
1. Università di Bologna and INRIA Sophia-Antipolis, France
2. Università di Verona, Verona, Italy
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Natural Deduction Calculus for S4.2;Notre Dame Journal of Formal Logic;2024-05-01
2. Cut Elimination for Extended Sequent Calculi;Bulletin of the Section of Logic;2023-09-25
3. Natural deduction calculi for classical and intuitionistic S5;Journal of Applied Non-Classical Logics;2023-04-03