Induction-recursion and initial algebras
Artikel i vetenskaplig tidskrift, 2003

Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (generalized) inductive definitions and allows us to define all standard sets of Martin-Löf type theory as well as a large collection of commonly occurring inductive data structures. It also includes a variety of universes which are constructive analogues of inaccessibles and other large cardinals below the first Mahlo cardinal. In this article we give a new compact formalization of inductive-recursive definitions by modeling them as initial algebras in slice categories. We give generic formation, introduction, elimination, and equality rules generalizing the usual rules of type theory. Moreover, we prove that the elimination and equality rules are equivalent to the principle of the existence of initial algebras for certain endofunctors. We also show the equivalence of the current formulation with the formulation of induction-recursion as a reflection principle given in Dybjer and Setzer (Lecture Notes in Comput. Sci. 2183 (2001) 93). Finally, we discuss two type-theoretic analogues of Mahlo cardinals in set theory: an external Mahlo universe which is defined by induction-recursion and captured by our formalization, and an internal Mahlo universe, which goes beyond induction-recursion. We show that the external Mahlo universe, and therefore also the theory of inductive-recursive definitions, have proof-theoretical strength of at least Rathjen's theory KPM.

Författare

Peter Dybjer

Chalmers, Institutionen för datavetenskap, Programmeringslogik

Anton Setzer

Swansea University

Annals of Pure and Applied Logic

0168-0072 (ISSN)

Vol. 124 1-3 1-47

Ämneskategorier

Annan matematik

DOI

10.1016/S0168-0072(02)00096-9