Journal of Symbolic Logic

Explicit Mathematics with the Monotone Fixed Point Principle

Michael Rathjen

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.


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 $\Pi^1_2$ comprehension.

Article information

J. Symbolic Logic, Volume 63, Issue 2 (1998), 509-542.

First available in Project Euclid: 6 July 2007

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier



Rathjen, Michael. Explicit Mathematics with the Monotone Fixed Point Principle. J. Symbolic Logic 63 (1998), no. 2, 509--542.

Export citation

See also

  • Part II: Michael Rathjen. Explicit Mathematics with the Monotone Fixed Point Principle. II: Models. J. Symbolic Logic, Volume 64, Issue 2 (1999), 517--550.