Accessible Recursive Functions

DOI10.2307/421185MaRDI QIDQ4940736zbMATH OpenOpenAlexFDO

Authors Stanley S. Wainer

Publication date 5 February 2001

Published in The 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

dilatorsprovably recursiverecursive functionsubrecursive classwell-ordering

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
• scientific article; zbMATH DE number 218515
• scientific article; zbMATH DE number 3941519
• scientific article; zbMATH DE number 1215495
• Ordinal complexity of recursive definitions

Cites work

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

Cited in

(4)

• Die another day
• Countable Admissible Ordinals and Dilators
• scientific article; zbMATH DE number 218515 (Why is no real title available?)
• Functorial Fast-Growing Hierarchies

This page was built for publication: Accessible Recursive Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940736)