On Power Set in Explicit Mathematics
Glass, Thomas
J. Symbolic Logic, Tome 61 (1996) no. 1, p. 468-489 / Harvested from Project Euclid
This paper is concerned with the determination of the proof-strength of the power set axiom relative to axiom systems for Feferman's explicit mathematics. As conjectured by Feferman, we obtain that the presence of the power set axiom does not increase proof-strength. Results are achieved by reducing the systems including the power set axiom to subsystems of classical analysis. In those cases where only the induction axiom is available, we make use of the technique of asymmetrical interpretations.
Publié le : 1996-06-14
Classification: 
@article{1183745010,
     author = {Glass, Thomas},
     title = {On Power Set in Explicit Mathematics},
     journal = {J. Symbolic Logic},
     volume = {61},
     number = {1},
     year = {1996},
     pages = { 468-489},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745010}
}
Glass, Thomas. On Power Set in Explicit Mathematics. J. Symbolic Logic, Tome 61 (1996) no. 1, pp.  468-489. http://gdmltest.u-ga.fr/item/1183745010/