The Proof-Theoretic Analysis of Transfinitely Iterated Quasi Least Fixed Points

Journal of Symbolic Logic 71 (3):721 - 746 (2006)
  Copy   BIBTEX

Abstract

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 ${\rm ID}_{1}^{\ast}$. 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 ${\rm ID}_{1}^{\ast}$ also permit to analyze its transfinitely iterated variants ${\rm ID}_{\alpha}^{\ast}$. Thus, we eventually know that $|\widehat{{\rm ID}}_{\alpha}|=|{\rm ID}_{\alpha}^{\ast}|$

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-08-24

Downloads
39 (#398,761)

6 months
4 (#1,006,434)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Mathematical Logic.Georg Kreisel - 1965 - In Lectures on Modern Mathematics. New York: Wiley. pp. 95-195.
The proof-theoretic analysis of Σ11 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1-3):195-234.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.

Add more references