Strong WQO Tree Theorems
From MaRDI portal
Publication:3295147
Recommendations
- The strong tree property and weak square
- On strong tree-breadth
- Quasi-bounded trees and analytic inductions
- Theory and Applications of Satisfiability Testing
- The tree lattice existence theorems
- The \(q\)-Calkin-Wilf tree
- A tree version of Kőnig's theorem
- Weak sequential theories of finite full binary trees
- scientific article; zbMATH DE number 434499
- scientific article; zbMATH DE number 3269730
Cites work
- scientific article; zbMATH DE number 3825795 (Why is no real title available?)
- scientific article; zbMATH DE number 475609 (Why is no real title available?)
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
- Generalizations of the Kruskal-Friedman theorems
- Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
- Harvey Friedman's research on the foundations of mathematics
- Investigations of subsystems of second order arithmetic and set theory in strength between \(\Pi^1_1\)-CA and \(\Delta^1_2\)-\(\text{CA}+\text{BI}\). I
- Ordering by Divisibility in Abstract Algebras
- Proof theory. An introduction
- Proof-theoretic investigations on Kruskal's theorem
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- Termination of rewriting
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Cited in
(3)
This page was built for publication: Strong WQO Tree Theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295147)