Effectively open real functions

Cited 8 time in webofscience Cited 10 time in scopus
  • Hit : 532
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorZiegler, Martinko
dc.date.accessioned2016-04-12T07:52:16Z-
dc.date.available2016-04-12T07:52:16Z-
dc.date.created2015-09-17-
dc.date.created2015-09-17-
dc.date.issued2006-12-
dc.identifier.citationJOURNAL OF COMPLEXITY, v.22, no.6, pp.827 - 849-
dc.identifier.issn0885-064X-
dc.identifier.urihttp://hdl.handle.net/10203/203399-
dc.description.abstractA function f is continuous iff the pre-image f(-1) vertical bar V vertical bar of any open set V is open again. Dual to this topological property, f is called open iff the image f vertical bar U vertical bar 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 (bar right arrow) f(-1) vertical bar V vertical bar being effective: given a list of open rational balls exhausting V, a Turing Machine can generate a corresponding list for f(-1)vertical bar V vertical bar. Analogously, effective openness requires the mapping U (bar right arrow) f vertical bar U vertical bar on open real subsets to be effective. The present work combines real analysis with algebraic topology and Tarski's quantifier elimination to effectivize classical open mapping theorems and to establish several rich classes of real functions as effectively open. (C) 2006 Elsevier Inc. All rights reserved.-
dc.languageEnglish-
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE-
dc.titleEffectively open real functions-
dc.typeArticle-
dc.identifier.wosid000243341000009-
dc.identifier.scopusid2-s2.0-33751545525-
dc.type.rimsART-
dc.citation.volume22-
dc.citation.issue6-
dc.citation.beginningpage827-
dc.citation.endingpage849-
dc.citation.publicationnameJOURNAL OF COMPLEXITY-
dc.identifier.doi10.1016/j.jco.2006.05.002-
dc.contributor.localauthorZiegler, Martin-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordAuthorrecursion theory-
dc.subject.keywordAuthorcomputable analysis-
dc.subject.keywordAuthoropen mapping-
dc.subject.keywordAuthortopology-
dc.subject.keywordAuthorquantifier elimination-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0