On power set in explicit mathematics

Journal of Symbolic Logic 61 (2):468-489 (1996)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275671
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 39,626
Through your library

References found in this work BETA

Subsystems of Second-Order Arithmetic.Stephen G. Simpson - 2004 - Studia Logica 77 (1):129-129.
The Strength of Some Martin-Löf Type Theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
Understanding Uniformity in Feferman's Explicit Mathematics.Thomas Glaß - 1995 - Annals of Pure and Applied Logic 75 (1-2):89-106.

Add more references

Citations of this work BETA

The Universal Set and Diagonalization in Frege Structures.Reinhard Kahle - 2011 - Review of Symbolic Logic 4 (2):205-218.
Explicit Mathematics: Power Types and Overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.

Add more citations

Similar books and articles


Added to PP index

Total views
19 ( #399,143 of 2,325,956 )

Recent downloads (6 months)
3 ( #531,536 of 2,325,956 )

How can I increase my downloads?


My notes

Sign in to use this feature