Approximate decidability in euclidean spaces

DOI10.1002/MALQ.200310003MaRDI QIDQ4798203zbMATH OpenOpenAlexFDO

Authors Armin Hemmerling

Publication date 19 March 2003

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

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

zbMATH Keywords

approximate computabilityapproximate decidabilitycomputable analysisdegree of reducibilityoracle Turing machinesrecursivity in analysisresolvable settopological arithmetical hierarchy

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60) Constructive real analysis (26E40)

Recommendations

• The discrete parts of approximately decidable sets in Euclidean spaces
• Three concepts of decidability for general subsets of uncountable spaces
• Decidability in analysis
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.

Cited in

(8)

• Decidability in analysis
• Hierarchies of function classes defined by the first-value operator
• scientific article; zbMATH DE number 1089735 (Why is no real title available?)
• The discrete parts of approximately decidable sets in Euclidean spaces
• Computability of sets in Euclidean space
• Three concepts of decidability for general subsets of uncountable spaces
• The Hausdorff-Ershov hierarchy in Euclidean spaces
• Towards a descriptive set theory for domain-like structures

This page was built for publication: Approximate decidability in euclidean spaces

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