Phase transitions of iterated Higman-style well-partial-orderings

DOI10.1007/S00153-011-0258-3zbMath1251.03076OpenAlexW2034032295MaRDI QIDQ661281

Andreas Weiermann, L. N. Gordeev

Publication date: 10 February 2012

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-011-0258-3

zbMATH Keywords

phase transitionsproof theoryordinal notationsasymptotic combinatoricswell-partial-orderingssymmetric gap condition

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) First-order arithmetic and fragments (03F30) Asymptotic enumeration (05A16) Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (2)

Dickson's lemma and weak Ramsey theory ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phase transitions for Gödel incompleteness
• Computable linearizations of well-partial-orderings
• Phase transition thresholds for some Friedman-style independence results
• Classifying the Provably Total Functions of PA
• Generalizations of the Kruskal-Friedman theorems
• A Uniform Approach to Fundamental Sequences and Hierarchies
• A modified sentence unprovable in PA
• A classification of rapidly growing Ramsey functions
• An application of graphical enumeration to PA *
• Generalizations of the one-dimensional version of the Kruskal-Friedman theorems

This page was built for publication: Phase transitions of iterated Higman-style well-partial-orderings