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
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,411
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
Thomas Studer (2005). Explicit Mathematics: Power Types and Overloading. Annals of Pure and Applied Logic 134 (2-3):284-302.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

12 ( #355,112 of 1,924,749 )

Recent downloads (6 months)

1 ( #417,923 of 1,924,749 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.