How to characterize provably total functions by local predicativity

DOI10.2307/2275597zbMATH Open0859.03028OpenAlexW1993440975MaRDI QIDQ4879900FDOQ4879900

Authors: 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

Recommendations

• A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
• Variations on a theme by Weiermann
• Publication:4893145

zbMATH Keywords

provably total functionsordinal notationsprovably 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)

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• A Glimpse of $$ \sum_{3} $$-elementarity
• 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
• 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
• A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
• Classifying the Provably Total Functions of PA
• A SECOND NORMAL FORM FOR FUNCTIONS OF THE SYSTEM EP
• Normal forms for elementary patterns
• Iterated local reflection versus iterated consistency
• On the Performance of Axiom Systems
• Title not available (Why is that?)

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)