Journal of Symbolic Logic 75 (2):602-640 (2010)

Abstract
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. 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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1268917496
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,436
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.
Effective Operations on Partial Recursive Functions.J. Myhill & J. C. Shepherdson - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):310-317.
Total Sets and Objects in Domain Theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Effective Operations on Partial Recursive Functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.

View all 8 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Addiction and Self-Determination: A Phenomenological Approach.Jann E. Schlimme - 2010 - Theoretical Medicine and Bioethics 31 (1):49-62.
On Effective Topological Spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.
Corrigendum: On Effective Topological Spaces.Dieter Spreen - 2000 - Journal of Symbolic Logic 65 (4):1917-1918.
The Effectivity of Questions.Gerold Stahl - 1969 - Noûs 3 (2):211-218.
The Continuity of Consciousness.Oliver Rashbrook - 2013 - European Journal of Philosophy 21 (4):611-640.
Unacceptable Risks and the Continuity Axiom.Karsten Klint Jensen - 2012 - Economics and Philosophy 28 (1):31-42.
Isomorphisms Between HEO and HROE, ECF and ICFE.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (2):359 - 371.
Leibniz on Continuity.Richard T. W. Arthur - 1986 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1986:107 - 115.
Peirce's Clarifications of Continuity.Jérôme Havenel - 2008 - Transactions of the Charles S. Peirce Society 44 (1):pp. 86-133.

Analytics

Added to PP index
2010-09-12

Total views
45 ( #253,604 of 2,519,861 )

Recent downloads (6 months)
1 ( #406,012 of 2,519,861 )

How can I increase my downloads?

Downloads

My notes