Abstract
The paper is concerned with a line of research that plumbs the scope of constructive theories. The object of investigation here is Feferman’s intuitionistic theory of explicit mathematics augmented by the monotone fixed point principle which asserts that every 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 newfunctional constant to the language, it is ensured that a fixed point is uniformly presentable as a function of the monotone operation. The strength of the classical non-uniform version, MID, was investigated in [6] whereas that of the uniform version was determined in [16, 17] and shown to be that of subsystems of second order arithmetic based on \( \varPi_{2}^{1} \)-comprehension. This involved a rendering of \( \varPi_{2}^{1} \)-comprehension in terms of fixed points of non-monotonic \( \varPi_{1}^{1} \)-operators and a proof-theoretic interpretation of the latter in specific operator theories that can be interpreted in explicit mathematics with the uniform monotone fixed point principle. The intent of the current paper is to show that the same strength obtains when the underlying logic is taken to be intuitionistic logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold and D. Niwinski. Rudiments of the μ-calculus. Elsevier, Amsterdam, 2001.
W. Buchholz, S. Feferman, W. Pohlers, and W. Sieg. Iterated Inductive Definitions and Subsystems of Analysis, volume 897 of Lecture Notes in Mathematics. Springer, 1981.
S. Feferman. A language and axioms for explicit mathematics. In Algebra and Logic, volume 450 of Lecture Notes in Mathematics, pages 87–139. Springer, 1975.
S. Feferman. Constructive theories of functions and classes. In J.N. Crossley, editor, Logic Colloquium’78, pages 159–224. North-Holland, 1979.
S. Feferman. Monotone inductive definitions. In A.S. Troelstra and D. van Dalen, editors, The L.E.J. Brouwer Centenary Symposium, pages 77–89. North-Holland, 1982.
T. Glaß, M. Rathjen, and A. Schlüter. The strength of monotone inductive definitions in explicit mathematics. Annals of Pure and Applied Logic, 85:1–46, 1997.
D. Hilbert and P. Bernays. Grundlagen der Mathematik II. Springer, Berlin, 1938.
P. Hitchcock and D. M. R. Park. Induction rules and termination proofs. In Procceedings of the 1st International Colloquium on Automata, Languages, and Programming, pages 225–251. North-Holland, Amsterdam, 1973.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
G. Kreisel. Generalized inductive definitions. In Stanford Report on the Foundations of Analysis Section III. Mimeographed, Stanford, 1963.
B. Lubarsky. μ-definable sets of integers. Journal of Symbolic Logic, 58:291–313, 1993.
M. Möllerfeld. Generalized Inductive Definitions. The μ-calculus and \( \varPi_{2}^{1} \)-comprehension. Phd dissertation, Universität Münster, 2002.
D. M. R. Park. Fixpoint induction and proof of program semantics. In Mitchie Meltzer, editor, Machine Intelligence V, pages 59–78. Edinburgh University Press, Edinburgh, 1970.
V. Pratt. A decidable μ-calculus. In Proceedings 22nd IEEE Symposium on Foundations of Computer Science, pages 421–427. 1981.
M. Rathjen. Monotone inductive definitions in explicit mathematics. Journal of Symbolic Logic, 61:125–146, 1996.
M. Rathjen. Explicit mathematics with the monotone fixed point principle. Journal of Symbolic Logic, 63:509–542, 1998.
M. Rathjen. Explicit mathematics with the monotone fixed point principle II: Models. Journal of Symbolic Logic, 64:517–550, 1999.
M. Rathjen. Explicit mathematics with monotone inductive definitions: a survey. In W. Sieg et al., editor, Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, volume 15 of Lecture Notes in Logic, pages 329–346. ASL and AK Peters, 2002.
D. Scott and J.W. DeBakker. A theory of programs. Unpublished manuscript, 1969.
S. Takahashi. Monotone inductive definitions in a constructive theory of functions and classes. Ann. Pure Appl. Logic, 42:255–279, 1989.
S. Tupailo. Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic, 120:165–196, 2003.
S. Tupailo. On the intuitionistic strength of monotone inductive definitions. Journal of Symbolic Logic, 69:790–798, 2004.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Rathjen, M., Tupailo, S. (2020). On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics. In: Kahle, R., Rathjen, M. (eds) The Legacy of Kurt Schütte. Springer, Cham. https://doi.org/10.1007/978-3-030-49424-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-49424-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-49423-0
Online ISBN: 978-3-030-49424-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)