Explicit mathematics with the monotone fixed point principle

Journal of Symbolic Logic 63 (2):509-542 (1998)

Authors
Michael Rathjen
University of Leeds
Abstract
The context for this paper is Feferman's theory of explicit mathematics, a formal framework serving many purposes. It is suitable for representing Bishop-style constructive mathematics as well as generalized recursion, including direct expression of structural concepts which admit self-application. The object of investigation here is the theory of explicit mathematics augmented by the monotone fixed point principle, which asserts that any monotone operation on classifications (Feferman's notion of set) possesses a least fixed point. To be more precise, the new axiom not merely postulates the existence of a least solution, but, by adjoining a new functional constant to the language, it is ensured that a fixed point is uniformly presentable as a function of the monotone operation. The upshot of the paper is that the latter extension of explicit mathematics (when based on classical logic) embodies considerable proof-theoretic strength. It is shown that it has at least the strength of the subsystem of second order arithmetic based on Π 1 2 comprehension
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586846
Options
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: 40,131
Through your library

References found in this work BETA

Elementary Induction on Abstract Structures.Yiannis N. Moschovakis - 1979 - Journal of Symbolic Logic 44 (1):124-125.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Mathematical Logic.Joseph R. Shoenfield - 1975 - Journal of Symbolic Logic 40 (2):234-236.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Power Types in Explicit Mathematics?Gerhard Jäger - 1997 - Journal of Symbolic Logic 62 (4):1142-1146.
Minimal Predicates. Fixed-Points, and Definability.Johan Van Benthem - 2005 - Journal of Symbolic Logic 70 (3):696 - 712.
On Power Set in Explicit Mathematics.Thomas Glass - 1996 - Journal of Symbolic Logic 61 (2):468-489.
Monotone Inductive Definitions in Explicit Mathematics.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (1):125-146.

Analytics

Added to PP index
2009-01-28

Total views
170 ( #40,161 of 2,237,214 )

Recent downloads (6 months)
3 ( #601,414 of 2,237,214 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature