{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T02:54:04Z","timestamp":1785984844837,"version":"3.56.0"},"reference-count":43,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1380,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>If one wants to compute with infinite objects like real numbers or data streams, continuity is a necessary requirement: better and better (finite) approximations of the input are transformed into better and better (finite) approximations of the output. In case the objects are constructively generated, they can be represented by a finite description of the generating procedure. By effectively transforming such descriptions for the generation of the input (respectively, their codes) into (the code of) a description for the generation of the output another type of computable operation is obtained. Such operations are also called effective. The relationship of both classes of operations has always been a question of great interest.<\/jats:p><jats:p>In this paper the setting is extended to the case of multifunctions. Various ways of coding (indexing) sets are discussed and their relationship is investigated. Moreover, effective versions of several continuity notions for multifunctions are introduced. For each of these notions an indexing system for sets is exhibited so that the multifunctions that are effective with respect to this indexing system are exactly the multifunction which are effectively continuous with respect to the continuity notion under consideration. Mostly, in addition to being effective the multifunctions need also possess certain witnessing functions. Important special cases are discussed where such witnessing functions always exist.<\/jats:p>","DOI":"10.2178\/jsl\/1268917496","type":"journal-article","created":{"date-parts":[[2010,3,18]],"date-time":"2010-03-18T13:05:57Z","timestamp":1268917557000},"page":"602-640","source":"Crossref","is-referenced-by-count":3,"title":["Effectivity and effective continuity of multifunctions"],"prefix":"10.1017","volume":"75","author":[{"given":"Dieter","family":"Spreen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002693_ref042","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable analysis, an introduction","author":"Weihrauch","year":"2000"},{"key":"S0022481200002693_ref032","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"S0022481200002693_ref019","first-page":"369","article-title":"The theory of A-spaces","volume":"12","author":"Er\u0161ov","year":"1973","journal-title":"Algebra i Logika"},{"key":"S0022481200002693_ref031","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7"},{"key":"S0022481200002693_ref025","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90048-2"},{"key":"S0022481200002693_ref020","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210164"},{"key":"S0022481200002693_ref024","first-page":"290","volume-title":"Constructivity in mathematics","author":"Kreisel","year":"1957"},{"key":"S0022481200002693_ref028","unstructured":"Moschovakis Y. N. , Recursive analysis, Ph.D. thesis, University of Wisconsin, Madison, Wisconsin. 1963."},{"key":"S0022481200002693_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(96)00017-6"},{"key":"S0022481200002693_ref002","volume-title":"Set-valued analysis","author":"Aubin","year":"1990"},{"key":"S0022481200002693_ref018","first-page":"523","article-title":"Continuous lattices and A-spaces","volume":"207","author":"Er\u0161ov","year":"1972","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"S0022481200002693_ref021","volume-title":"Theory of numberings","author":"Er\u0161ov","year":"1977"},{"key":"S0022481200002693_ref023","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725"},{"key":"S0022481200002693_ref026","volume-title":"The metamathematics of algebraic systems. Collected papers: 1936\u20131967","author":"Mal'cev","year":"1971"},{"key":"S0022481200002693_ref001","first-page":"1","volume-title":"Handbook of logic in computer science, Vol. 3","author":"Abramsky","year":"1994"},{"key":"S0022481200002693_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8149-3"},{"key":"S0022481200002693_ref004","volume-title":"Topological spaces","author":"Berge","year":"1997"},{"key":"S0022481200002693_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00045-6"},{"key":"S0022481200002693_ref034","doi-asserted-by":"publisher","DOI":"10.1007\/BF01469380"},{"key":"S0022481200002693_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_81"},{"key":"S0022481200002693_ref009","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0488"},{"key":"S0022481200002693_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00693-X"},{"key":"S0022481200002693_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00284-9"},{"key":"S0022481200002693_ref037","first-page":"185","volume":"63","author":"Spreen","year":"1998","journal-title":"On effective topological spaces"},{"key":"S0022481200002693_ref012","first-page":"295","article-title":"Algorithmic operators in constructive metric spaces","volume":"67","author":"Ce\u012dtin","year":"1962","journal-title":"Trudy Matematicheskogo Instituia imeni V. A. Steklova"},{"key":"S0022481200002693_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.001"},{"key":"S0022481200002693_ref014","volume-title":"A domain theoretic approach to effective distribution theory","author":"Dahlgren","year":"2007"},{"key":"S0022481200002693_ref015","doi-asserted-by":"publisher","DOI":"10.2307\/421098"},{"key":"S0022481200002693_ref022","first-page":"852","article-title":"Un contre-exemple relatif aux fonctionnelles r\u00e9cursives","volume":"247","author":"Friedberg","year":"1958","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences"},{"key":"S0022481200002693_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90029-3"},{"key":"S0022481200002693_ref017","first-page":"367","article-title":"Computable functional of finite type","volume":"11","author":"Er\u0161ov","year":"1972","journal-title":"Algebra i Logika"},{"key":"S0022481200002693_ref027","first-page":"302","volume-title":"Categorical methods in computer science","volume":"393","author":"Melton","year":"1989"},{"key":"S0022481200002693_ref043","volume-title":"Berechenbarkeit auf cpo's","author":"Weihrauch","year":"1980"},{"key":"S0022481200002693_ref029","doi-asserted-by":"publisher","DOI":"10.4064\/fm-55-3-215-238"},{"key":"S0022481200002693_ref030","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19550010407"},{"key":"S0022481200002693_ref033","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200002693_ref035","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036946"},{"key":"S0022481200002693_ref036","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1143"},{"key":"S0022481200002693_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90038-F"},{"key":"S0022481200002693_ref038","first-page":"221","volume-title":"Logic Colloquium 2005","author":"Spreen","year":"2008"},{"key":"S0022481200002693_ref039","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1093\/oso\/9780198537809.003.0004","volume-title":"Handbook of logic in computer science","volume":"4","author":"Stoltenberg-Hansen","year":"1995"},{"key":"S0022481200002693_ref040","first-page":"271","article-title":"M\u00e9moire sur la r\u00e9solution des \u00e9quations num\u00e9riques","volume":"6","author":"Sturm","year":"1835","journal-title":"Annales Math\u00e9matiques pures applic\u00e9es"},{"key":"S0022481200002693_ref041","doi-asserted-by":"publisher","DOI":"10.1145\/1024922.1024924"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T05:45:09Z","timestamp":1711345509000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002693\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0022481200002693"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1268917496","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}