Skip to main content
Log in

A well-ordering proof for Feferman's theoryT 0

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Buchholz, W.: Normalfunktionen und konstruktive Systeme von Ordinalzahlen. Proof Theory Symposion Kiel 1974. In: Lecture Notes in Mathematics, Vol. 500. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  2. Buchholz, W., Pohlers, W.: Provable wellorderings of formal theories for transfinitely iterated inductive definitions. J. Symb. Logic43, 118–125 (1978).

    Google Scholar 

  3. Feferman, S.: A language and axioms for explicit mathematics. Algebra and logic. In: Lecture Notes in Mathematics, Vol. 450. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  4. Feferman, S.: Constructive theories of functions and classes. Logic Colloquium 78. Amsterdam: North-Holland 1979.

    Google Scholar 

  5. Jäger, G., Pohlers, W.: Admissible Proof Theory (in preparation).

  6. Schütte, K.: Proof theory. Berlin, Heidelberg, New York: Springer 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is part of a project supported by the Deutsche Forschungsgemeinschaft.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jäger, G. A well-ordering proof for Feferman's theoryT 0 . Arch math Logik 23, 65–77 (1983). https://doi.org/10.1007/BF02023014

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023014

Keywords

Navigation