Strong WQO Tree Theorems

DOI10.1007/978-3-030-30229-0_4zbMath1481.03064OpenAlexW2997884605MaRDI QIDQ3295147

L. N. Gordeev

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-30229-0_4

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
• Harvey Friedman's research on the foundations of mathematics
• Termination of rewriting
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Proof-theoretic investigations on Kruskal's theorem
• Proof theory. An introduction
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Generalizations of the Kruskal-Friedman theorems
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Strong WQO Tree Theorems