Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T22:20:20.838Z Has data issue: false hasContentIssue false

On power set in explicit mathematics

Published online by Cambridge University Press:  12 March 2014

Thomas Glass*
Affiliation:
Siemens AG, Zentralabteilung Forschung und Entwicklung, D-81730 München, Germany

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable