Unprovability threshold for the planar graph minor theorem
From MaRDI portal
Publication:638483
DOI10.1016/j.apal.2010.09.003zbMath1225.03072MaRDI QIDQ638483
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
unprovability; growth constant; graph minor theorem; impredicative methods; unprovability threshold; Weiermann's programme
05C83: Graph minors
03F35: Second- and higher-order arithmetic and fragments
03F03: Proof theory in general (including proof-theoretic semantics)
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