Journal of Symbolic Logic

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory

Gerhard Jager and Thomas Strahm

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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.

Article information

Source
J. Symbolic Logic, Volume 66, Issue 2 (2001), 935-958.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183746483

Mathematical Reviews number (MathSciNet)
MR1833488

Zentralblatt MATH identifier
1011.03046

JSTOR
links.jstor.org

Citation

Jager, Gerhard; Strahm, Thomas. Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. J. Symbolic Logic 66 (2001), no. 2, 935--958. https://projecteuclid.org/euclid.jsl/1183746483


Export citation