A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions

DOI10.1093/LOGCOM/EXM035zbMath1134.03032OpenAlexW2073732226MaRDI QIDQ5441122

Andreas Weiermann, Arnoud V. den Boer

Publication date: 7 February 2008

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

Full work available at URL: https://semanticscholar.org/paper/3e9c1400225dc34fae35fd141cb045ae6981445e

zbMATH Keywords

phase transitionproof theorymultiplicative number theorycombinatorial well-orderelementary descent recursive functionsprovability/unprovability in PA

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15)

Related Items (2)

Phase transitions for Gödel incompleteness ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension

This page was built for publication: A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions