scientific article; zbMATH DE number 922625

MaRDI QIDQ4893145zbMATH OpenFDO

Authors Benjamin Blankertz, Andreas Weiermann

Publication date 13 January 1997

zbMATH Keywords

cut-eliminationoperator controlled derivationsordinal analysisordinal recursive functionsPeano arithmeticprovably recursive functionsprovably total functionssubrecursive hierarchies

Mathematics Subject Classification ID

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

Recommendations

• How to characterize provably total functions by local predicativity
• scientific article; zbMATH DE number 4033742
• scientific article; zbMATH DE number 7324257
• scientific article; zbMATH DE number 1215495
• scientific article; zbMATH DE number 1102104

Cited in

(9)

• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• From subsystems of analysis to subsystems of set theory
• Classifying the Provably Total Functions of PA
• Streamlined subrecursive degree theory
• scientific article; zbMATH DE number 733384 (Why is no real title available?)
• scientific article; zbMATH DE number 1102104 (Why is no real title available?)
• How to characterize provably total functions by local predicativity
• On the Performance of Axiom Systems
• Iterated inductive definitions revisited

This page was built for publication:

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