How to characterize provably total functions by local predicativity
From MaRDI portal
Publication:4879900
Recommendations
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3803323 (Why is no real title available?)
- scientific article; zbMATH DE number 3229476 (Why is no real title available?)
- A Uniform Approach to Fundamental Sequences and Hierarchies
- A classification of the ordinal recursive functions
- Eine Klassifikation der ε0‐Rekursiven Funktionen
- Elementary descent recursion and proof theory
- Fragments of arithmetic
- Notation systems for infinitary derivations
- Proof theory and ordinal analysis
- Proof-theoretic analysis of KPM
- Simplified collapsing functions and their applications
Cited in
(12)- On the Performance of Axiom Systems
- Classifying the Provably Total Functions of PA
- Iterated local reflection versus iterated consistency
- Normal forms for elementary patterns
- A SECOND NORMAL FORM FOR FUNCTIONS OF THE SYSTEM EP
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- A Glimpse of $$ \sum_{3} $$-elementarity
- A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
- scientific article; zbMATH DE number 432702 (Why is no real title available?)
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
- scientific article; zbMATH DE number 922625 (Why is no real title available?)
This page was built for publication: How to characterize provably total functions by local predicativity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879900)