Phase Transitions for Weakly Increasing Sequences

DOI10.1007/978-3-540-69407-6_20zbMath1143.03020OpenAlexW1602168979MaRDI QIDQ3507431

Andreas Weiermann, Michiel De Smet

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_20

zbMATH Keywords

phase transitionsRamsey theoryAckermann functionDilworthErdös-Szekeresweakly increasing sequences

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Primitive recursion and the chain antichain principle

Cites Work

• Unnamed Item
• Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
• Classifying the phase transition threshold for Ackermannian functions
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• On the strength of Ramsey's theorem for pairs
• An extremely sharp phase transition threshold for the slow growing hierarchy
• Phase transition thresholds for some Friedman-style independence results
• Some independence results for Peano arithmetic
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Logical Approaches to Computational Barriers

This page was built for publication: Phase Transitions for Weakly Increasing Sequences