Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Epsilon Substitution Method for $\Pi _{2}^{0}$ -FIX.Toshiyasu Arai - 2006 - Journal of Symbolic Logic 71 (4):1155 - 1188.
    In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Ideas in the epsilon substitution method for -FIX.Toshiyasu Arai - 2005 - Annals of Pure and Applied Logic 136 (1-2):3-21.
    Hilbert proposed the epsilon substitution method as a basis for consistency proofs. Hilbert’s Ansatz for finding a solving substitution for any given finite set of transfinite axioms is, starting with the null substitution S0, to correct false values step by step and thereby generate the process S0,S1,…. The problem is to show that the approximating process terminates. After Gentzen’s innovation, Ackermann [W. Ackermann, Zur Widerspruchsfreiheit der Zahlentheorie, Math. Ann. 117 162–194] succeeded in proving the termination of the process for the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Functionals defined by transfinite recursion.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):155-174.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Nested Recursion.W. W. Tait - 1963 - Journal of Symbolic Logic 28 (1):103-104.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Epsilon substitution method for ID1.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 121 (2-3):163-208.
    Hilbert proposed the epsilon substitution method as a basis for consistency proofs. Hilbert's Ansatz for finding a solving substitution for any given finite set of transfinite axioms is, starting with the null substitution S0, to correct false values step by step and thereby generate the process S0,S1,… . The problem is to show that the approximating process terminates. After Gentzen's innovation, Ackermann 162) succeeded to prove termination of the process for first order arithmetic. Inspired by G. Mints as an Ariadne's (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Epsilon Substitution Method for [image] -FIX.Toshiyasu Arai - 2006 - Journal of Symbolic Logic 71 (4):1155 - 1188.
    In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Epsilon substitution method for [Π0 1, Π0 1]-FIX.T. Arai - 2005 - Archive for Mathematical Logic 44 (8):1009-1043.
    We formulate epsilon substitution method for a theory [Π0 1, Π0 1]-FIX for two steps non-monotonic Π0 1 inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].
    Download  
     
    Export citation  
     
    Bookmark   2 citations