An application of graphical enumeration to PA *

DOI10.2178/JSL/1045861503zbMATH Open1041.03045OpenAlexW4233249654MaRDI QIDQ4457723FDOQ4457723

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)

Cites Work

• The number of trees
• Proof-theoretic investigations on Kruskal's theorem
• Title not available (Why is that?)
• Elementary descent recursion and proof theory
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• The Enumeration of Trees by Height and Diameter
• Analytic Number Theory
• Title not available (Why is that?)
• On the slowly well orderedness of \(\varepsilon_0\)
• Title not available (Why is that?)

Cited In (18)

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

   Recommendations

• A modified sentence unprovable in PA 👍 👎
• Title not available (Why is that?) 👍 👎
• Provably recursive functions in fragments of Peano arithmetic 👍 👎
• Transfinite induction within Peano arithmetic 👍 👎
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen 👍 👎

This page was built for publication: An application of graphical enumeration to PA *

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457723)