scientific article
From MaRDI portal
Publication:3772200
zbMath0634.03038MaRDI QIDQ3772200
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Undecidability and degrees of sets of sentences (03D35) First-order arithmetic and fragments (03F30)
Related Items (8)
A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Unprovability threshold for the planar graph minor theorem ⋮ Unprovable combinatorial statements ⋮ An Unprovable Ramsey-Type Theorem ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ Phase transitions for Gödel incompleteness ⋮ An application of graphical enumeration to PA * ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
This page was built for publication:
