Unprovability threshold for the planar graph minor theorem

DOI10.1016/j.apal.2010.09.003zbMath1225.03072OpenAlexW1976818913MaRDI QIDQ638483

Andrey Bovykin

Publication date: 12 September 2011

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.2010.09.003

zbMATH Keywords

unprovabilitygrowth constantgraph minor theoremimpredicative methodsunprovability thresholdWeiermann's programme

Mathematics Subject Classification ID

Graph minors (05C83) Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03)

Cites Work

• Random graphs on surfaces
• Growth constants of minor-closed classes of graphs
• Phase transitions for Gödel incompleteness
• Random planar graphs
• Proper minor-closed families are small
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• An application of graphical enumeration to PA *
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unprovability threshold for the planar graph minor theorem