Decidability in analysis

DOI10.1007/s00607-004-0107-xzbMath1075.03035OpenAlexW2126074999MaRDI QIDQ2572942

Qing Zhou, Weihao Hu

Publication date: 7 November 2005

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-004-0107-x

zbMATH Keywords

computable realscomputable analysisrecursivenessalmost decidable predicates of real variables

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Euclidean geometries (general) and generalizations (51M05) Constructive real analysis (26E40)

Cites Work

• Unnamed Item
• Representations of the real numbers and of the open subsets of the set of real numbers
• Recursive characterization of computable real-valued functions and relations
• Computability on Regular Subsets of Euclidean Space
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space