Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1110.03052DBLPconf/cie/2006OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898852

Andreas Weiermann

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

zbMATH Keywords

recursive functionsRamsey functionsphase transition thresholds

Mathematics Subject Classification ID

Ramsey theory (05D10) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15)

Related Items (5)

The strength of infinitary Ramseyan principles can be accessed by their densities ⋮ Monomial ideals and independence of ⋮ Phase Transitions for Weakly Increasing Sequences ⋮ Phase transitions for Gödel incompleteness ⋮ Classifying the phase transition threshold for Ackermannian functions

This page was built for publication: Logical Approaches to Computational Barriers