An application of graphical enumeration to PA *

DOI10.2178/jsl/1045861503zbMath1041.03045OpenAlexW4233249654MaRDI QIDQ4457723

Andreas Weiermann

Publication date: 25 March 2004

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1045861503

zbMATH Keywords

primitive recursive arithmeticfirst-order Peano arithmeticasymptotic analysis of enumerationslengths of strictly descending sequences of ordinals

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items

A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ Unnamed Item ⋮ Unprovability threshold for the planar graph minor theorem ⋮ Combinatorial unprovability proofs and their model-theoretic counterparts ⋮ Phase transitions of iterated Higman-style well-partial-orderings ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ Phase transitions for Gödel incompleteness ⋮ Classifying the phase transition threshold for Ackermannian functions ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ A Glimpse of $$ \sum_{3} $$-elementarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof-theoretic investigations on Kruskal's theorem
• Elementary descent recursion and proof theory
• The number of trees
• The Enumeration of Trees by Height and Diameter
• Analytic Number Theory
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture