A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK

DOI10.1017/jsl.2013.23zbMath1338.03089arXiv1302.2975OpenAlexW2963345040MaRDI QIDQ2921032

Linda Brown Westrick

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

zbMATH Keywords

differentiabilityrank functioncomputable analysiseffective descriptive set theoryhyperarithmetical hierarchy

Mathematics Subject Classification ID

Descriptive set theory (03E15) Computation over the reals, computable analysis (03D78)

Related Items (4)

\(K\)-quasiderivations ⋮ Computable structures and operations on the space of continuous functions ⋮ An effective analysis of the Denjoy rank ⋮ Computable analysis and classification problems

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

This page was built for publication: A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK