The Hausdorff-Ershov hierarchy in Euclidean spaces

DOI10.1007/s00153-005-0317-8zbMath1095.03031OpenAlexW1999287632MaRDI QIDQ818930

Armin Hemmerling

Publication date: 22 March 2006

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-005-0317-8

zbMATH Keywords

computable analysiseffective descriptive set theoryErshov's hierarchyglobal and local depth of setsHausdorff's difference hierarchyresolvable setstopological arithmetical hierarchy

Mathematics Subject Classification ID

Descriptive set theory (03E15) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)

Related Items

Non-collapse of the effective Wadge hierarchy, Towards a descriptive set theory for domain-like structures, Towards the Effective Descriptive Set Theory, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Hierarchies of function classes defined by the first-value operator, Fine hierarchies and m-reducibilities in theoretical computer science, On the Difference Hierarchy in Countably Based T0-Spaces, Function operators spanning the arithmetical and the polynomial hierarchy, Non-collapse of the effective wadge hierarchy

Cites Work

• Descriptive set theory
• Computational complexity of real functions
• Classical recursion theory. The theory of functions and sets of natural numbers
• On approximate and algebraic computability over the real numbers
• Effective metric spaces and representations of the reals.
• Computability on computable metric spaces
• Characterizations of the class Δ^ta₂ over Euclidean spaces
• Wadge Degrees ofω-Languages of Deterministic Turing Machines
• Approximate decidability in euclidean spaces
• Recursive Structures and Ershov's Hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item