Abstract
AbstractAny set of truth-functional connectives has sequent calculus rules that can be generated systematically from the truth tables of the connectives. Such a sequent calculus gives rise to a multi-conclusion natural deduction system and to a version of Parigot’s free deduction. The elimination rules are “general,” but can be systematically simplified. Cut-elimination and normalization hold. Restriction to a single formula in the succedent yields intuitionistic versions of these systems. The rules also yield generalized lambda calculi providing proof terms for natural deduction proofs as in the Curry–Howard isomorphism. Addition of an indirect proof rule yields classical single-conclusion versions of these systems. Gentzen’s standard systems arise as special cases.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)
Reference24 articles.
1. Structural Proof Theory
2. λμ-Calculus: An algorithmic interpretation of classical natural deduction
3. Baaz, M . (1984). Die Anwendung der Methode der Sequenzialkalküle auf nichtklassische Logiken. Dissertation, Universität Wien.
4. A natural extension of natural deduction
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A General Schema for Bilateral Proof Rules;Journal of Philosophical Logic;2024-03-02
2. A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems;Journal of Logical and Algebraic Methods in Programming;2023-01
3. Outline of the cut-elimination theorem;An Introduction to Proof Theory;2021-08-17
4. Sequent calculus;An Introduction to Proof Theory;2021-08-17
5. Natural deduction;An Introduction to Proof Theory;2021-08-17