How to characterize provably total functions by local predicativity

DOI10.2307/2275597zbMath0859.03028OpenAlexW1993440975MaRDI QIDQ4879900

Andreas Weiermann

Publication date: 10 April 1997

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

Full work available at URL: https://doi.org/10.2307/2275597

zbMATH Keywords

ordinal notationsprovably total functionsprovably recursive functionslocal predicativity

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Related Items (5)

On the Performance of Axiom Systems ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ Classifying the Provably Total Functions of PA ⋮ A Glimpse of $$ \sum_{3} $$-elementarity

Cites Work

• Simplified collapsing functions and their applications
• Fragments of arithmetic
• Proof-theoretic analysis of KPM
• Elementary descent recursion and proof theory
• Proof theory and ordinal analysis
• Notation systems for infinitary derivations
• A Uniform Approach to Fundamental Sequences and Hierarchies
• A classification of the ordinal recursive functions
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to characterize provably total functions by local predicativity