Accessible Recursive Functions

DOI10.2307/421185zbMath0954.03041OpenAlexW2134547439MaRDI QIDQ4940736

Stanley S. Wainer

Publication date: 5 February 2001

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

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0503-toc.htm

zbMATH Keywords

recursive functionwell-orderingdilatorsprovably recursivesubrecursive class

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Functorial Fast-Growing Hierarchies ⋮ Die another day

Cites Work

• A slow growing analogue to Buchholz' proof
• Functors and ordinal notations. IV: The Howard ordinal and the functor ∧.
• Π12-logic, Part 1: Dilators
• A Uniform Approach to Fundamental Sequences and Hierarchies
• On Wainer's notation for a minimal subrecursive inaccessible ordinal
• How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals

This page was built for publication: Accessible Recursive Functions