Computer Science – Logic in Computer Science
Scientific paper
2005-01-12
pp.827-849 in Journal of Complexity vol.22 (2006)
Computer Science
Logic in Computer Science
added section on semi-algebraic functions; to appear in Proc. http://cca-net.de/cca2005
Scientific paper
10.1016/j.jco.2006.05.002
A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in Analysis provide a variety of sufficient conditions for openness. By the Main Theorem of Recursive Analysis, computable real functions are necessarily continuous. In fact they admit a well-known characterization in terms of the mapping V+->f^{-1}[V] being EFFECTIVE: Given a list of open rational balls exhausting V, a Turing Machine can generate a corresponding list for f^{-1}[V]. Analogously, EFFECTIVE OPENNESS requires the mapping U+->f[U] on open real subsets to be effective. By effectivizing classical Open Mapping Theorems as well as from application of Tarski's Quantifier Elimination, the present work reveals several rich classes of functions to be effectively open.
Ziegler Martin
No associations
LandOfFree
Effectively Open Real Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Effectively Open Real Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effectively Open Real Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-179556