Well-ordering proofs for Martin-Löf type theory (Q1295372): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new system of proof-theoretic ordinal functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Beziehungen Zwischen den OrdinalzahlsystemenΣ Und $$\bar \Theta \left( \omega \right)$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of some Martin-Löf type theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-ordering proof for Feferman's theoryT 0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive mathematics and computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-theoretic interpretation of iterated, strictly positive inductive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain interpretations of Martin-Löf's partial type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the syntax of Martin-Löf's type theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank
 
Normal rank

Latest revision as of 19:48, 28 May 2024

scientific article
Language Label Description Also known as
English
Well-ordering proofs for Martin-Löf type theory
scientific article

    Statements

    Well-ordering proofs for Martin-Löf type theory (English)
    0 references
    0 references
    16 August 1999
    0 references
    In his Ph.D. thesis [Proof theoretical strength of Martin-Löf type theory with \(W\)-type and one universe, Diss., Univ. München (1993; Zbl 0863.03029)], the author proved an upper bound \(\alpha= \psi_{\Omega_1} \Omega_{I+\omega}\) for the proof-theoretic ordinal of Martin-Löf's intuitionistic type theory with \(W\)-type and one universe. In the present paper he proves in this system transfinite induction up to every ordinal less than \(\alpha\). This determines the proof-theoretic strength of the theory and shows that it is slightly stronger than Feferman's theory \(T_0\) and \((\Delta^1_2- \text{CA})+ (\text{BI})\). The author points out that the proof extends to show that the strength of Martin-Löf's type theory with \(n\) universes is \(\psi_{\Omega_1} \Omega_{I_n+ \omega}\) where \(I_n\) is the \(n\)th inaccessible, and this implies that the strength of the theory with arbitrary finitely iterated universes is \(\psi_{\Omega_1} I_\omega\) where \(I_\omega= \sup\{I_n\mid n\in\omega\}\).
    0 references
    Martin-Löf's intuitionistic type theory
    0 references
    transfinite induction
    0 references
    proof-theoretic strength
    0 references
    finitely iterated universes
    0 references
    0 references

    Identifiers