Journal of Symbolic Logic · 1998 · 66 citations · 20 references
Natural SciencesComputer ScienceMathematicsProgramming LanguagesSet TheoryTopologyMetric SpacesRecursion TheoryTopological SpacesLanguage SemanticsOpen SetsOperatorsRecursionRice's Theorem
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.
20
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Douglas Bridges · CUBO, A Mathematical Journal · 2004 · 373 citations
Processes and the denotational semantics of concurrency
J. W. de Bakker, J. I. Zucker · Information and Control · 1982 · 278 citations · Full text
Yiannis N. Moschovakis · Fundamenta Mathematicae · 1964 · 116 citations · Full text