Representing inductively defined sets by wellorderings in Martin-Löf's type theory

✍ Scribed by Peter Dybjer

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 347 KB
• Volume: 176
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(96)00145-4

✦ Synopsis

We prove that every strictly positive endofimctor on the category of sets generated by Martin-Liif's extensional type theory has an initial algebra. This representation of inductively defined sets uses essentially the wellorderings introduced by Martin-Liif in "Constructive Mathematics and Computer Programming".