Switch to: Citations

Add references

You must login to add references.
  1. Epsilon substitution method for theories of jump hierarchies.Toshiyasu Arai - 2002 - Archive for Mathematical Logic 41 (2):123-153.
    We formulate epsilon substitution method for theories (H)α0 of absolute jump hierarchies, and give two termination proofs of the H-process: The first proof is an adaption of Mints M, Mints-Tupailo-Buchholz MTB, i.e., based on a cut-elimination of a specially devised infinitary calculus. The second one is an adaption of Ackermann Ack. Each termination proof is based on transfinite induction up to an ordinal θ(α0+ ω)0, which is best possible.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Zur Widerspruchsfreiheit der Zahlentheorie.Wilhelm Ackermann - 1940 - Journal of Symbolic Logic 5 (3):125-127.
    Direct download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Strong termination for the epsilon substitution method.Grigori Mints - 1996 - Journal of Symbolic Logic 61 (4):1193-1205.
    Ackermann proved termination for a special order of reductions in Hilbert's epsilon substitution method for the first order arithmetic. We establish termination for arbitrary order of reductions.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Epsilon substitution method for elementary analysis.Grigori Mints, Sergei Tupailo & Wilfried Buchholz - 1996 - Archive for Mathematical Logic 35 (2):103-130.
    We formulate epsilon substitution method for elementary analysisEA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramified system of level one and cutelimination for this system. The second proof uses non-effective continuity argument.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations