Generalizations of the Kruskal-Friedman theorems

DOI10.2307/2274960zbMath0709.03043OpenAlexW2169416686MaRDI QIDQ3491541

L. N. Gordeev

Publication date: 1990

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274960

zbMATH Keywords

Kruskal's theoremunprovabilityordinal notationReverse Mathematicswell-quasi-orderingsbad sequencescomplex generalized modified embeddingiterated inducive definitionsnormal complex generalized labeled trees

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20)

Related Items

How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems, Strong WQO Tree Theorems, Phase transitions of iterated Higman-style well-partial-orderings, Well-partial-orderings and the big Veblen number, From Kruskal’s theorem to Friedman’s gap condition

Cites Work

• Proof-theoretical analysis: Weak systems of functions and classes
• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• A new system of proof-theoretic ordinal functions
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams