A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions

DOI10.1093/LOGCOM/EXM035MaRDI QIDQ5441122zbMATH OpenOpenAlexFDO

Authors Arnoud den Boer, Andreas Weiermann

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

combinatorial well-orderelementary descent recursive functionsmultiplicative number theoryphase transitionproof theoryprovability/unprovability in PA

Mathematics Subject Classification ID

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

Recommendations

• Phase transitions for Gödel incompleteness
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 2212833
• Phase transitions of iterated Higman-style well-partial-orderings
• An extremely sharp phase transition threshold for the slow growing hierarchy

Cited in

(5)

• Phase transitions for Gödel incompleteness
• Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
• scientific article; zbMATH DE number 2212833 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• Phase transitions of iterated Higman-style well-partial-orderings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441122)