Decidability in Analysis
In this paper, we introduce the notion of almost decidable predicates of real variables. The notion comes from the concept of decidability of number theoretical predicates together with the idea of effective convergence in computable analysis. The weakness of traditional definitions of decidability is discussed. The definition of almost decidable predicates of real variables is given. It is proved that some commonly used predicates on Open image in new window such as Open image in new window between computable reals and recursive open/closed sets are almost decidable, which justifies our definition of decidability in Euclidean spaces. Additionally, the relation between almost decidability and computability of reals and recursiveness of subsets of Open image in new window is considered, which provides a bridge to include our works here to the earlier literature on computability in analysis.
AMS Subject Classifications:03F60 03D80 51M05
KeywordsDecidable almost decidable
Unable to display preview. Download preview PDF.
- Cutland, N. 1980ComputabilityCambridge University PressCambridgeGoogle Scholar
- Ge, X., Nerode, A.: On extreme points of convex compact Turing located sets. In: Logical foundations of computer science (Nerode, A., Matiyasevich, Yu. V., eds.). Lecture Notes in Computer Science, pp. 114–128. Berlin: Springer 1994. 3rd Int. Symp., LFCS ’94, St. Petersburg, Russia, July 11–14, 1994.Google Scholar
- Pourl-El, M. B., Richards, J. I. 1989Computability in analysis and physicsSpringerBerlin Heidelberg New YorkGoogle Scholar
- Zhou, Q. 1996Computable real-valued functions on recursive open and closed subsets of Euclidean spaceMath. Logic Quart.42379409Google Scholar