An application of graphical enumeration to PA *
From MaRDI portal
Publication:4457723
Recommendations
Cites work
- scientific article; zbMATH DE number 4031661 (Why is no real title available?)
- scientific article; zbMATH DE number 1557173 (Why is no real title available?)
- scientific article; zbMATH DE number 1390283 (Why is no real title available?)
- Analytic Number Theory
- Elementary descent recursion and proof theory
- On the slowly well orderedness of \(\varepsilon_0\)
- Proof-theoretic investigations on Kruskal's theorem
- The Enumeration of Trees by Height and Diameter
- The number of trees
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(18)- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
- Exact unprovability results for compound well-quasi-ordered combinatorial classes
- Graphical enumeration techniques: series expansions and animal problems
- Classifying the phase transition threshold for Ackermannian functions
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- Well partial orders
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- Combinatorial unprovability proofs and their model-theoretic counterparts
- Current research on Gödel's incompleteness theorems
- Phase transitions for Gödel incompleteness
- Pure \(\Sigma_2\)-elementarity beyond the core
- A Glimpse of $$ \sum_{3} $$-elementarity
- Sharp thresholds for hypergraph regressive Ramsey numbers
- A modified sentence unprovable in PA
- On the slowly well orderedness of \(\varepsilon_0\)
- Phase transitions of iterated Higman-style well-partial-orderings
- 2004 Summer Meeting of the Association for Symbolic Logic
- Unprovability threshold for the planar graph minor theorem
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)