About the proof-theoretic ordinals of weak fixed point theories

&
Journal of Symbolic Logic 57 (3):1108-1119 (1992)
  Copy   BIBTEX

Abstract

This paper presents several proof-theoretic results concerning weak fixed point theories over second order number theory with arithmetic comprehension and full or restricted induction on the natural numbers. It is also shown that there are natural second order theories which are proof-theoretically equivalent but have different proof-theoretic ordinals

Categories

Keywords

Reprint years

DOI

10.2307/2275451

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,506

External links

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

Through your library

My notes

Similar books and articles

Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
The proof-theoretic analysis of transfinitely iterated fixed point theories.Gerhard Jager, Reinhard Kahle, Anton Setzer & Thomas Strahm - 1999 - Journal of Symbolic Logic 64 (1):53-67.
Some theories with positive induction of ordinal strength ϕω.Gerhard Jäger & Thomas Strahm - 1996 - Journal of Symbolic Logic 61 (3):818-842.
The model-theoretic ordinal analysis of theories of predicative strength.Jeremy Avigad & Richard Sommer - 1999 - Journal of Symbolic Logic 64 (1):327-349.
Second order theories with ordinals and elementary comprehension.Gerhard Jäger & Thomas Strahm - 1995 - Archive for Mathematical Logic 34 (6):345-375.
Some Notes on Truths and Comprehension.Thomas Schindler - 2018 - Journal of Philosophical Logic 47 (3):449-479.
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.
Proof-theoretic strengths of the well-ordering principles.Toshiyasu Arai - 2020 - Archive for Mathematical Logic 59 (3-4):257-275.
Systems of explicit mathematics with non-constructive μ-operator. Part I.Solomon Feferman & Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 65 (3):243-263.
The [mathematical formula] quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.Markus Marzetta & Thomas Strahm - 1997 - Archive for Mathematical Logic 36 (6):391-413.

Analytics

Added to PP
2009-01-28

Downloads
279 (#104,336)

6 months
17 (#181,306)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Non‐elementary speed‐ups in logic calculi.Toshiyasu Arai - 2008 - Mathematical Logic Quarterly 54 (6):629-640.

Add more citations

References found in this work

Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.

Add more references