Classifying the Provably Total Functions of PA

DOI10.2178/BSL/1146620058zbMath1118.03053OpenAlexW1972602491MaRDI QIDQ3430936

Andreas Weiermann

Publication date: 5 April 2007

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1146620058

zbMATH Keywords

cut eliminationclassification of provably computable functions of PA

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15)

Related Items (8)

Predicatively unprovable termination of the Ackermannian Goodstein process ⋮ A WALK WITH GOODSTEIN ⋮ Phase transitions of iterated Higman-style well-partial-orderings ⋮ A note on da Costa-Doria ``exotic formalizations ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION ⋮ Phase transitions for Gödel incompleteness ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary descent recursion and proof theory
• Notation systems for infinitary derivations
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• A Uniform Approach to Fundamental Sequences and Hierarchies
• A Model-Theoretic Approach to Ordinal Analysis
• How to characterize provably total functions by local predicativity
• A classification of the ordinal recursive functions
• On the interpretation of non-finitist proofs–Part II

This page was built for publication: Classifying the Provably Total Functions of PA