Summary
We interpret intuitionistic theories of (iterated) strictly positive inductive definitions (s.p.-ID i′s) into Martin-Löf's type theory. The main purpose being to obtain lower bounds of the proof-theoretic strength of type theories furnished with means for transfinite induction (W-type, Aczel's set of iterative sets or recursion on (type) universes). Thes.p.-ID i′s are essentially the wellknownID i-theories, studied in ordinal analysis of fragments of second order arithmetic, but the set variable in the operator form is restricted to occur only strictly positively. The modelling is done by constructivizing continuity notions for set operators at higher number classes and proving that strictly positive set operators are continuous in this sense. The existence of least fixed points, or more accurately, least sets closed under the operator, then easily follows.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aczel, P.: The strength of Martin-Löf's intuitionistic type theory with one universe. In: Miettinen, S., Väänänen, J. (eds.) Proc. Symp. on Mathematical Logic (Oulu, 1974). (Report no. 2, Department of Philosophy, University of Helsinki), Helsinki 1977
Aczel, P.: Introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of mathematical logic. Amsterdam: North-Holland 1977
Aczel, P.: The type theoretic interpretation of constructive set theory: inductive definitions. In: Marcus, R.B. et al. (eds.) Logic, methodology and philosophy of science VII. Amsterdam: North-Holland 1986
Beeson, B.: Foundations of constructive mathematics. Berlin Heidelberg New York: Springer 1985
Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies. (Lect. Notes Math., vol. 897) Berlin Heidelberg New York: Springer 1981
Dybjer, P.: Inductively defined sets in Martin-Löf's set theory. In: Proceedings of the Workshop on General Logic. Edinburgh 1987
Feferman, S.: Iterated inductive fixed-point theories. Application to Hancock's conjecture. In: Metakides, G. (ed.) Patras logic symposium '80. Amsterdam: North-Holland 1982
Gentzen, G.: Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie. Math. Ann.119, 140–161 (1943)
Martin-Löf, P.: An intuitionistic theory of types. (Report 71-3, Department of Mathematics, University of Stockholm) Stockholm 1971
Martin-Löf, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E. (ed.) Proc. 2nd Scand. Logic Symp. Amsterdam: North-Holland 1971
Martin-Löf, P.: An intuitionistic theory of types: predicative part, In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium '73. Amsterdam: North-Holland 1975
Martin-Löf, P.: Intuitionistic type theory. Napoli: Bibliopolis 1984
Nordström, B., Peterson, K., Smith, J.M.: Programming in Martin-Löf's type theory: an introduction. Oxford: Oxford University Press 1990
Palmgren, E.: On fixed point operators, inductive definitions and universes in Martin-Löf's type theory. (Doctoral dissertation; Report 1991:8, Department of Mathematics, Uppsala University), Uppsala 1991
Pohlers, W.: Proof theory: an introduction. (Lect. Notes Math., vol. 1407) Berlin Heidelberg New York: Springer 1989
Troelstra, A.S., van Dalen, D.: Constructivism in mathematics: an introduction, volume I and II. Amsterdam: North-Holland 1988
Author information
Authors and Affiliations
Additional information
During the preparation of this paper the author was supported by the Swedish Natural Science Research Council (NFR) as a doctoral student in mathematical logic
Rights and permissions
About this article
Cite this article
Palmgren, E. Type-theoretic interpretation of iterated, strictly positive inductive definitions. Arch Math Logic 32, 75–99 (1992). https://doi.org/10.1007/BF01269951
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01269951