The proof-theoretic analysis of transfinitely iterated quasi least fixed points
Probst, Dieter
J. Symbolic Logic, Tome 71 (2006) no. 1, p. 721-746 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The starting point of this article is an old question asked by Feferman in his paper on Hancock’s conjecture [6] about the strength of ID₁*. This theory is obtained from the well-known theory ID₁ by restricting fixed point induction to formulas that contain fixed point constants only positively. The techniques used to perform the proof-theoretic analysis of ID₁* also permit to analyze its transfinitely iterated variants IDα*. Thus, we eventually know that |\hat{ID}α| = |IDα*|.
Publié le : 2006-09-14
Classification:  Fixed points,  Iteration,  Pseudo-hierarchies 
@article{1154698573,
     author = {Probst, Dieter},
     title = {The proof-theoretic analysis of transfinitely iterated quasi least fixed points},
     journal = {J. Symbolic Logic},
     volume = {71},
     number = {1},
     year = {2006},
     pages = { 721-746},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1154698573}
}

Probst, Dieter. The proof-theoretic analysis of transfinitely iterated quasi least fixed points. J. Symbolic Logic, Tome 71 (2006) no. 1, pp.  721-746. http://gdmltest.u-ga.fr/item/1154698573/