Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory
Jager, Gerhard ; Strahm, Thomas
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 935-958 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2001-06-14
Classification:  
@article{1183746483,
     author = {Jager, Gerhard and Strahm, Thomas},
     title = {Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 935-958},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746483}
}

Jager, Gerhard; Strahm, Thomas. Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  935-958. http://gdmltest.u-ga.fr/item/1183746483/