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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

  • This entry has no external links. Add one.
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 Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
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.
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.
Reflections on reflections in explicit mathematics.Gerhard Jäger & Thomas Strahm - 2005 - Annals of Pure and Applied Logic 136 (1-2):116-133.
The Recursively Mahlo Property in Second Order Arithmetic.Michael Rathjen - 1996 - Mathematical Logic Quarterly 42 (1):59-66.
Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
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.
Wellordering proofs for metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
Systems of explicit mathematics with non-constructive μ-operator and join.Thomas Glaß & Thomas Strahm - 1996 - Annals of Pure and Applied Logic 82 (2):193-219.
Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
Systems of explicit mathematics with non-constructive μ-operator. Part II.Solomon Feferman & Gerhard Jäger - 1996 - Annals of Pure and Applied Logic 79 (1):37-52.
Universes in metapredicative analysis.Christian Rüede - 2003 - Archive for Mathematical Logic 42 (2):129-151.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Operational set theory and small large cardinals.Solomon Feferman with with R. L. Vaught - manuscript

Analytics

Added to PP
2017-02-21

Downloads
6 (#1,465,246)

6 months
1 (#1,477,342)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
The provably terminating operations of the subsystem of explicit mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.

Add more citations

References found in this work

No references found.

Add more references