On effective topological spaces

Journal of Symbolic Logic 63 (1):185-221 (1998)
  Copy   BIBTEX

Abstract

Starting with D. Scott's work on the mathematical foundations of programming language semantics, interest in topology has grown up in theoretical computer science, under the slogan `open sets are semidecidable properties'. But whereas on effectively given Scott domains all such properties are also open, this is no longer true in general. In this paper a characterization of effectively given topological spaces is presented that says which semidecidable sets are open. This result has important consequences. Not only follows the classical Rice-Shapiro Theorem and its generalization to effectively given Scott domains, but also a recursion theoretic characterization of the canonical topology of effectively given metric spaces. Moreover, it implies some well known theorems on the effective continuity of effective operators such as P. Young and the author's general result which in its turn entails the theorems by Myhill-Shepherdson, Kreisel-Lacombe-Shoenfield and Ceĭtin-Moschovakis, and a result by Eršov and Berger which says that the hereditarily effective operations coincide with the hereditarily effective total continuous functionals on the natural numbers

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On topological spaces equivalent to ordinals.Jörg Flum & Juan Carlos Martinez - 1988 - Journal of Symbolic Logic 53 (3):785-795.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Dynamic topological S5.Philip Kremer - 2009 - Annals of Pure and Applied Logic 160 (1):96-116.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Corrigendum: On effective topological spaces.Dieter Spreen - 2000 - Journal of Symbolic Logic 65 (4):1917-1918.
Expressive power in first order topology.Paul Bankston - 1984 - Journal of Symbolic Logic 49 (2):478-487.

Analytics

Added to PP
2009-01-28

Downloads
225 (#82,154)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.
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 12 references / Add more references