Exact unprovability results for compound well-quasi-ordered combinatorial classes

DOI10.1016/j.apal.2008.09.020zbMath1159.03037OpenAlexW2080211289MaRDI QIDQ1006603

Andrey Bovykin

Publication date: 25 March 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.020

zbMATH Keywords

Kruskal's theoremunprovability thresholdwell-partial orderFriedman's finite Kruskal theoremunprovable combinatorial statementsWeiermann's theorem

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Proof theory in general (including proof-theoretic semantics) (03F03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper minor-closed families are small
• The number of trees
• Phase transition thresholds for some Friedman-style independence results
• A classification of rapidly growing Ramsey functions
• An application of graphical enumeration to PA *

This page was built for publication: Exact unprovability results for compound well-quasi-ordered combinatorial classes