Skip to main content Accessibility help
×
×
Home

On power set in explicit mathematics

  • Thomas Glass (a1)
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.

Copyright
References
Hide All
[1]Cantini, A., On the relation between choice and comprehension principles in second order arithmetic, this Journal, vol. 51 (1986), pp. 360373.
[2]Feferman, S., A language and axioms for explicit mathematics, Algebra and logic (Crossley, J. N., editor), Lect. Notes Math., vol. 450, Springer-Verlag, Heidelberg, New York, 1975, pp. 87139.
[3]Feferman, S., Recursion theory and set theory: a marriage of convenience, Generalized recursion theory II (Fenstad, J. E.et al., editors), Studies in Logic and the Foundations of Mathematics, vol. 94, North-Holland, Amsterdam, 1978, pp. 5598.
[4]Feferman, S., Constructive theories of functions and classes, Logic colloquium '78 (Boffa, M.et al, editor), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 159224.
[5]Feferman, S. and Jäger, G., Systems of explicit mathematics with non-constructive μ-operator. Part II, to appear in Annals of Pure and Applied Logic.
[6]Feferman, S. and Sieg, W., Inductive definitions and subsystems of analysis, Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies (Buchholz, W.et al., editors), Lecture Notes in Mathematics, vol. 897, Springer-Verlag, Heidelberg, New York, 1981, pp. 1677.
[7]Feferman, S., Proof-theoretic equivalence between classical and constructive theories for analysis, Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies (Buchholz, W.et al., editors), Lecture Notes in Mathematics, vol. 897, Springer, Heidelberg, New York, 1981, pp. 78142.
[8]Girard, J.-Y., A survey of Π12-logic, Logic, methodology and philosophy of science VI (Cohen, L. J.et al., editors), Studies in Logic and the Foundations of Mathematics, no. 104, North-Holland, Amsterdam, 1982, pp. 89107.
[9]Glaß, T., Understanding uniformity in Feferman's explicit mathematics, Annals of Pure and Applied Logic, vol. 75 (1995), pp. 83106.
[10]Giaß, T. and Strahm, T., Systems of explicit mathematics with non-constructive μ-operator and join, to to appear in Annals of Pure and Applied Logic.
[11]Griffor, E. and Rathjen, M., The strength of some Martin-Löf type theories, Archive for Mathematical Logic, vol. 33 (1994), pp. 347385.
[12]Jäger, G., Theories for admissible sets. A unifying approach to proof theory, Studies in Proof Theory, vol. 2, Bibliopolis, Naples, 1986.
[13]Pohlers, W., Proof-theoretical analysis of IDv by the method of local predicativity, Iterated induetive definitions and subsystems of analysis: Recent proof-theoretical studies (Buchholz, W.et al., editors), Lecture Notes in Mathematics, Springer-Verlag, Heidelberg, New York, 1981, pp. 261357.
[14]Pohlers, W., Proof theory. An introduction, Lecture Notes in Mathematics, no. 1407, Springer-Verlag, Berlin, Heidelberg, New York, 1989.
[15]Rathjen, M., Untersuchungen zu Teilsystemen der Zahlentheorie zweiter Stufe und der Mengenlehre mit einer zwischen Δ12-CA und Δ12-CA + BI liegenden Beweisstärke, Institut für Mathematische Logik und Grundlagenforschung, Münster (1989).
[16]Schütte, K., Proof theory, Grundlehren der Mathematischen Wissenschaften, vol. 225, Springer-Verlag, Heidelberg, New York, 1977.
[17]Simpson, S. G., Subsystems of second order arithmetic, Pennsylvania State Univiversity, 1986.
[18]Takahashi, S., Monotone inductive definitions in a constructive theory of functions and classes, Annals of Pure and Applied Logic, vol. 42 (1989), pp. 255297.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed