Classifying the Provably Total Functions of PA

DOI10.2178/BSL/1146620058MaRDI QIDQ3430936zbMATH OpenOpenAlexFDO

Authors Andreas Weiermann

Publication date 5 April 2007

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

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

zbMATH Keywords

classification of provably computable functions of PAcut elimination

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1889701
• Provably total functions of intuitionistic bounded arithmetic
• How to characterize provably total functions by local predicativity
• Provably total functions of Basic Arithmetic
• Parameter free induction and provably total computable functions
• On equational definability of function classes
• On classes of computable functions
• Computer Science Logic
• scientific article; zbMATH DE number 5652610
• On sets ∀-definable from Pfaffian functions

Cites work

• A classification of the ordinal recursive functions
• A Model-Theoretic Approach to Ordinal Analysis
• A Uniform Approach to Fundamental Sequences and Hierarchies
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• Elementary descent recursion and proof theory
• How to characterize provably total functions by local predicativity
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 922625 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• Notation systems for infinitary derivations
• On the interpretation of non-finitist proofs–Part II
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

Cited in

(9)

• Phase transitions for Gödel incompleteness
• Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
• Current research on Gödel's incompleteness theorems
• GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
• 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
• Isaacson's thesis on arithmetical truth

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

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