Switch to: References

Add citations

You must login to add citations.
  1. Functional completeness for subsystems of intuitionistic propositional logic.Heinrich Wansing - 1993 - Journal of Philosophical Logic 22 (3):303 - 321.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Eight Rules for Implication Elimination.Michael Arndt - 2024 - In Thomas Piecha & Kai F. Wehmeier (eds.), Peter Schroeder-Heister on Proof-Theoretic Semantics. Springer. pp. 239-273.
    Eight distinct rules for implication in the antecedent for the sequent calculus, one of which being Gentzen’s standard rule, can be derived by successively applying a number of cuts to the logical ground sequent A → B, A ⇒ B. A naive translation into natural deduction collapses four of those rules onto the standard implication elimination rule, and the remaining four rules onto the general elimination rule. This collapse is due to the fact that the difference between a formula occurring (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Peter Schroeder-Heister on Proof-Theoretic Semantics.Thomas Piecha & Kai F. Wehmeier (eds.) - 2024 - Springer.
    This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus. [REVIEW]Peter Schroeder-Heister - 2011 - Journal of Philosophical Logic 40 (1):95 - 101.
    The interpretation of implications as rules motivates a different left-introduction schema for implication in the sequent calculus, which is conceptually more basic than the implication-left schema proposed by Gentzen. Corresponding to results obtained for systems with higher-level rules, it enjoys the subformula property and cut elimination in a weak form.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Replacing Modus Ponens With One-Premiss Rules.Lloyd Humberstone - 2008 - Logic Journal of the IGPL 16 (5):431-451.
    After some motivating remarks in Section 1, in Section 2 we show how to replace an axiomatic basis for any one of a broad range of sentential logics having finitely many axiom schemes and Modus Ponens as the sole proper rule, by a basis with the same axiom schemes and finitely many one-premiss rules. Section 3 mentions some questions arising from this replacement procedure , explores another such procedure, and discusses some aspects of the consequence relations associated with the different (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A note on the proof theory the λII-calculus.David J. Pym - 1995 - Studia Logica 54 (2):199 - 230.
    The lambdaPi-calculus, a theory of first-order dependent function types in Curry-Howard-de Bruijn correspondence with a fragment of minimal first-order logic, is defined as a system of (linearized) natural deduction. In this paper, we present a Gentzen-style sequent calculus for the lambdaPi-calculus and prove the cut-elimination theorem. The cut-elimination result builds upon the existence of normal forms for the natural deduction system and can be considered to be analogous to a proof provided by Prawitz for first-order logic. The type-theoretic setting considered (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Advances in Natural Deduction: A Celebration of Dag Prawitz's Work.Luiz Carlos Pereira & Edward Hermann Haeusler (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...)
    Download  
     
    Export citation  
     
    Bookmark