Switch to: Citations

Add references

You must login to add references.
  1. The Epsilon Calculus and Herbrand Complexity.Georg Moser & Richard Zach - 2006 - Studia Logica 82 (1):133-155.
    Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - manuscript
    From proofs in any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions in polynomial time. From proofs in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions in polynomial time.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • About the proof-theoretic ordinals of weak fixed point theories.Gerhard Jäger & Barbara Primo - 1992 - Journal of Symbolic Logic 57 (3):1108-1119.
    This paper presents several proof-theoretic results concerning weak fixed point theories over second order number theory with arithmetic comprehension and full or restricted induction on the natural numbers. It is also shown that there are natural second order theories which are proof-theoretically equivalent but have different proof-theoretic ordinals.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Elimination Theorems of Uniqueness Conditions.Nobuyoshi Motohashi - 1982 - Mathematical Logic Quarterly 28 (33‐38):511-524.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Elimination Theorems of Uniqueness Conditions.Nobuyoshi Motohashi - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (33-38):511-524.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Maehara Shôji. Gentzen's theorem on an extended predicate calculus. Proceedings of the Japan Academy, vol. 30 no. 10 , pp. 923–926. [REVIEW]Kurt Schütte - 1962 - Journal of Symbolic Logic 27 (1):109-109.
    Download  
     
    Export citation  
     
    Bookmark   1 citation