Well-ordering proofs for Martin-Löf type theory
نویسندگان
چکیده
منابع مشابه
Well-Ordering, Proofs for Martin-Löf Type Theory
We present well-ordering proofs for Martin-Löf’s type theory with W-type and one universe. These proofs, together with an embedding of the type theory in a set theoretical system as carried out in [Set93] show that the proof theoretical strength of the type theory is precisely ψΩ1ΩI+ω, which is slightly more than the strength of Feferman’s theory T0, classical set theory KPI and the subsystem o...
متن کاملGame Semantics for Martin-Löf Type Theory
We present a new game semantics for Martin-Löf type theory (MLTT); our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families (a categorical model of MLTT) of a novel variant of games, which induces an injective (when Id-types are excluded) and surjective interpretation of the intensional variant of MLTT equipped with unit-, empty-, ...
متن کاملNotions of Anonymous Existence in Martin-Löf Type Theory
As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-Löf Type Theory can not generally shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do have unique identity proofs. A key ingredient in these constructions are weakly constant endofunctions on identity types. We study such endofunctions on arbitrar...
متن کاملPartial Recursive Functions in Martin-Löf Type Theory
In this article we revisit the approach by Bove and Capretta for formulating partial recursive functions in Martin-Löf Type Theory by indexed inductive-recursive definitions. We will show that all inductiverecursive definitions used there can be replaced by inductive definitions. However, this encoding results in an additional technical overhead. In order to obtain directly executable partial r...
متن کاملExtending Martin-Löf Type Theory by one Mahlo-universe
We deene a type theory MLM, which has proof theoretical strength slightly greater then Rathjens theory KPM. This is achieved by replacing the universe in Martin-LL of's Type Theory by a new universe V, which has the property that for every function f, mapping families of sets in V to families of sets in V, there exists a universe closed under f. We show that the proof theoretical strength of ML...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1998
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(97)00078-x