Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory

&
Journal of Symbolic Logic 66 (2):935-958 (2001)
  Copy   BIBTEX

Abstract

In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper proof-theoretic bounds of these systems are established

Categories

Keywords

Reprint years

DOI

10.2307/2695054

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: 105,768

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

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.Gerhard Jager & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
Wellordering proofs for metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe.Sergei Tupailo - 2003 - Annals of Pure and Applied Logic 120 (1-3):165-196.
On the relationship between fixed points and iteration in admissible set theory without foundation.Dieter Probst - 2005 - Archive for Mathematical Logic 44 (5):561-580.
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms.Gerhard Jäger & Thomas Studer - 2002 - Annals of Pure and Applied Logic 114 (1-3):79-101.
Universes in metapredicative analysis.Christian Rüede - 2003 - Archive for Mathematical Logic 42 (2):129-151.
The Recursively Mahlo Property in Second Order Arithmetic.Michael Rathjen - 1996 - Mathematical Logic Quarterly 42 (1):59-66.
On the proof-theoretic strength of monotone induction in explicit mathematics.Thomas Glaß, Michael Rathjen & Andreas Schlüter - 1997 - Annals of Pure and Applied Logic 85 (1):1-46.
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.
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.

Analytics

Added to PP
2009-01-28

Downloads
77 (#293,632)

6 months
16 (#194,692)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.

View all 14 citations / Add more citations

References found in this work

Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.
Extending Martin-Löf Type Theory by one Mahlo-universe.Anton Setzer - 2000 - Archive for Mathematical Logic 39 (3):155-181.

View all 8 references / Add more references