A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK
From MaRDI portal
Publication:2921032
DOI10.1017/jsl.2013.23zbMath1338.03089arXiv1302.2975MaRDI QIDQ2921032
Publication date: 30 September 2014
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2975
differentiability; rank function; computable analysis; effective descriptive set theory; hyperarithmetical hierarchy
Related Items
\(K\)-quasiderivations, An effective analysis of the Denjoy rank, Computable analysis and classification problems, Computable structures and operations on the space of continuous functions
Cites Work
- Unnamed Item
- Computable structures and the hyperarithmetical hierarchy
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- The Slaman-Wehner theorem in higher recursion theory
- Index sets for computable differential equations
- On the definitions of computable real continuous functions
- Ranks of differentiable functions
- Hyperarithmetical Index Sets in Recursion Theory
- On the Denjoy rank, the Kechris-Woodin rank and the Zalcwasser rank