Systems of explicit mathematics with non-constructive μ-operator. Part I

Annals of Pure and Applied Logic 65 (3):243-263 (1993)
  Copy   BIBTEX

Abstract

Feferman, S. and G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic 65 243-263. This paper is mainly concerned with the proof-theoretic analysis of systems of explicit mathematics with a non-constructive minimum operator. We start off from a basic theory BON of operators and numbers and add some principles of set and formula induction on the natural numbers as well as axioms for μ. The principal results then state: BON plus set induction is proof-theoretically equivalent to Peano arithmetic PA; BON plus formula induction is proof-theoretically equivalent to the system <0 of second-order arithmetic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,963

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Can constructive mathematics be applied in physics?Douglas S. Bridges - 1999 - Journal of Philosophical Logic 28 (5):439-453.
Power types in explicit mathematics?Gerhard Jäger - 1997 - Journal of Symbolic Logic 62 (4):1142-1146.
Intentional mathematics.Stewart Shapiro (ed.) - 1985 - New YorK, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
Explicit mathematics with the monotone fixed point principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.

Analytics

Added to PP
2014-01-16

Downloads
42 (#379,205)

6 months
9 (#309,376)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The unfolding of non-finitist arithmetic.Solomon Feferman & Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):75-96.
On Feferman’s operational set theory OST.Gerhard Jäger - 2007 - Annals of Pure and Applied Logic 150 (1-3):19-39.
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.

View all 22 citations / Add more citations

References found in this work

A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.

Add more references