Ackermann's substitution method (remixed)

DOI10.1016/j.apal.2005.09.016zbMath1103.03058OpenAlexW2099681375MaRDI QIDQ2503393

Georg Moser

Publication date: 14 September 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.09.016

zbMATH Keywords

epsilon substitution methodprovably recursive functionsHardy functions

Mathematics Subject Classification ID

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

Related Items (6)

On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem ⋮ EPSILON THEOREMS IN INTERMEDIATE LOGICS ⋮ Herbrand complexity and the epsilon calculus with equality ⋮ Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs ⋮ VON NEUMANN’S CONSISTENCY PROOF ⋮ The epsilon calculus and Herbrand complexity

Cites Work

• The epsilon calculus and Herbrand complexity
• Proof theory. 2nd ed
• Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\)
• A termination proof for epsilon substitution using partial derivations
• Epsilon substitution method for theories of jump hierarchies
• Provability algebras and proof-theoretic ordinals. I
• Epsilon substitution method for elementary analysis
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• A Uniform Approach to Fundamental Sequences and Hierarchies
• Functionals defined by transfinite recursion
• The substitution method
• A classification of the ordinal recursive functions
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• On the Interpretation of Non-Finitist Proofs--Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ackermann's substitution method (remixed)