Characterizations of the class Δta2 over Euclidean spaces

DOI10.1002/malq.200310108zbMath1058.03045OpenAlexW1485368214MaRDI QIDQ3159435

Armin Hemmerling

Publication date: 16 February 2005

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

Full work available at URL: https://doi.org/10.1002/malq.200310108

zbMATH Keywords

computable analysisErshov's hierarchyHausdorff's difference hierarchytopological arithmetical hierarchyapproximate decidabilityrecursivity in analysis

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Constructive real analysis (26E40) General topics in the theory of computing (68Q01) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)

Related Items

The Hausdorff-Ershov hierarchy in Euclidean spaces, Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity, 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, Quantum computation techniques for gauging reliability of interval and fuzzy data