Jump to content

Talk:Induction-recursion

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mark viking (talk | contribs) at 04:34, 27 August 2018 (Assessment: +Mathematics: class=Start, priority=Low, field=foundations (assisted)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

When I wrote the initial version, I contacted Dybjer to make sure it was accurate. This was his reply on 2013 Jan 30:

Hi Mike,

Thanks for writing this article.

"In intuitionistic type theory (ITT), induction-recursion is a feature for declaring a type and function on that type. It allows the creation of larger types, such as universes, than inductive Types. The types created still remains predicative inside ITT."

What you write is fine except that I would emphasize the simultaneity of the declaration of the type and the function. I actually feel inclined to write a bit more. Is the following comprehensible?

"In intuitionistic type theory (ITT), inductive-recursive definitions generalize {\link inductive definitions}.

An inductive definition is given by rules for generating elements of a type. One can then define functions from that type by induction on the way the elements of the type are generated. Induction-recursion generalizes this situation since one can {\it simultaneously} define the type and the function, because the rules for generating elements of the type are allowed to refer to the function.

Induction-recursion can be used to define large types including various universe constructions. It increases the proof-theoretic strength of type theory substantially. Nevertheless, inductive-recursive recursive definitions are still considered {\it predicative}."

One could also include the definition of the universe a la Tarski, the first and prototypical example, of an inductive-recursive definition.

Best wishes, Peter