Switch to: Citations

Add references

You must login to add references.
  1. Normalization as a homomorphic image of cut-elimination.Garrel Pottinger - 1977 - Annals of Mathematical Logic 12 (3):323.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • A Connection Between Cut Elimination and Normalization.Mirjana Borisavljević - 2006 - Archive for Mathematical Logic 45 (2):113-148.
    A new set of conversions for derivations in the system of sequents for intuitionistic predicate logic will be defined. These conversions will be some modifications of Zucker's conversions from the system of sequents from [11], which will have the following characteristics: (1) these conversions will be sufficient for transforming a derivation into a cut-free one, and (2) in the natural deduction the image of each of these conversions will be either in the set of conversions for normalization procedure, or an (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The collected papers of Gerhard Gentzen.Gerhard Gentzen - 1969 - Amsterdam,: North-Holland Pub. Co.. Edited by M. E. Szabo.
    Download  
     
    Export citation  
     
    Bookmark   114 citations  
  • Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
    This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.
    Download  
     
    Export citation  
     
    Bookmark   348 citations  
  • Basic proof theory.A. S. Troelstra - 1996 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
    This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...)
    Download  
     
    Export citation  
     
    Bookmark   160 citations  
  • Ideas and Results in Proof Theory.Dag Prawitz & J. E. Fenstad - 1971 - Journal of Symbolic Logic 40 (2):232-234.
    Download  
     
    Export citation  
     
    Bookmark   145 citations  
  • Cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • [Omnibus Review].Dag Prawitz - 1991 - Journal of Symbolic Logic 56 (3):1094-1096.
    Reviewed Works:Gaisi Takeuti, Proof Theory.Georg Kreisel, Proof Theory: Some Personal Recollections.Wolfram Pohlers, Contributions of the Schutte School in Munich to Proof Theory.Stephen G. Simpson, Subsystems of $\mathbf{Z}_2$ and Reverse Mathematics.Solomon Feferman, Proof Theory: A Personal Report.
    Download  
     
    Export citation  
     
    Bookmark   92 citations  
  • The correspondence between cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1-112.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • A proof of Gentzen's Hauptsatz without multicut.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (1):9-18.
    Gentzen's original proof of the Hauptsatz used a rule of multicut in the case that the right premiss of cut was derived by contraction. Cut elimination is here proved without multicut, by transforming suitably the derivation of the premiss of the contraction.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Natural deduction with general elimination rules.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (7):541-567.
    The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates.Through the condition that in a cut-free derivation of the sequent Γ⇒C, no inactive weakening (...)
    Download  
     
    Export citation  
     
    Bookmark   55 citations