Skip to main content

Effective operators and continuity revisited

  • Conference paper
  • First Online:
Logical Foundations of Computer Science — Tver '92 (LFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 620))

Included in the following conference series:

Abstract

In programming language semantics different kinds of semantical domains are used, among them Scott domains and metric spaces. D. Scott raised the problem of finding a suitable class of spaces which should include Scott domains and metric spaces such that effective mappings between these spaces are continuous. It is well known that between spaces like effectively given Scott domains or constructive metric spaces such operators are effectively continuous and vice versa. But, as an example of Friedberg shows, effective mappings from metric spaces into Scott domains are not continuous in general.

In a joint paper P. Young and the author presented a condition which under fairly general effectivity assumptions forces effective mappings between separable countable topological T o-spaces to be effectively continuous. In this paper the condition is weakened. Moreover, a large class of separable countable T o-spaces is given, and it is proved that a mapping between spaces of the class is effectively continuous, iff it is effective and satisfies the condition. A modification of Friedberg's example shows that the result is false without the extra condition.

Among others the class of spaces contains all recursively separable recursive metric spaces in which one can effectively pass from convergent normed recursive Cauchy sequences to their limits and all Scott domains that can be obtained via product and function space constructions from flat domains with at least three elements. The topology of the spaces in this class is effectively equivalent to the topology generated by those elements in the distributive lattice of all completely enumerable subsets of the space which possess a pseudocomplement and are regular with respect to this operation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • America, P. and Rutten, J. (1988). Solving reflexive domain equations in a category of complete metric spaces. In Mathematical Foundations of Programming Language Semantics, 3rd Workshop (Main, M. et al., eds.), 252–288. Lec. Notes Comp. Sci. 298. Springer, Berlin.

    Google Scholar 

  • de Bakker, J.W. and Zucker, J.I. (1982). Processes and the denotational semantics of concurrency. Inform. and Control 54, 70–120.

    Article  Google Scholar 

  • Bourbaki, N. (1966). General Topology I. Hermann, Paris.

    Google Scholar 

  • Ceitin, G.S. (1962). Algorithmic operators in constructive metric spaces. Trudy Mat. Inst. Steklov 67, 295–361; English transl., Amer. Math. Soc. Transl. (2) 64, 1–80 (1967).

    Google Scholar 

  • Egli, H. and Constable, R.L. (1976). Computability concepts for programming language semantics. Theoret. Comp. Sci. 2, 133–145.

    Article  Google Scholar 

  • Eršov, Ju.L. (1977). Model C of partial continuous functionals. Logic Colloquium '76 (Gandy, R. et al., eds.), 455–467. North-Holland, Amsterdam.

    Google Scholar 

  • Friedberg, R. (1958). Un contre-exemple relatif aux fonctionelles récursives. Compt. Rend. Acad. Sci. (Paris) 247, 852–854.

    Google Scholar 

  • Helm, J. (1971). On effectively computable operators. Zeitschr. f. math. Logik Grundl. d. Math. 17, 231–244.

    Google Scholar 

  • Lachlan, A. (1964). Effective operators in a general setting. J. Symbolic Logic 29, 163–178.

    Google Scholar 

  • Kreisel, G., Lacombe, D. and Shoenfield, J. (1959). Partial recursive functionals and effective operations. Constructivity in Mathematics (Heyting, A., ed.), 290–297. North-Holland, Amsterdam.

    Google Scholar 

  • Moschovakis, Y.N. (1963). Recursive analysis. Ph.D. Thesis, Univ. of Wisconsin, Madison, Wis.

    Google Scholar 

  • Moschovakis, Y.N. (1964). Recursive metric spaces. Fund. Math. 55, 215–238.

    Google Scholar 

  • Myhill, J. and Shepherdson, J.C. (1955). Effective operators on partial recursive functions. Zeitschr. f. math. Logik Grundl. d. Math. 1, 310–317.

    Google Scholar 

  • Nivat, M. (1979). Infinite words, infinite trees, infinite computations. Foundations of Computer Science III, Part 2 (de Bakker, J.W. et al., eds.), 1–52. Math. Centre Tracts 109.

    Google Scholar 

  • Pour-El, M.B. (1960). A comparison of five ‘computable’ operators. Zeitschr. f. math. Logik Grundl. d. Math. 6, 325–340.

    Google Scholar 

  • Reed, G.M. and Roscoe, A.W. (1988). Metric spaces as models for real-time concurrency. Mathematical Foundations of Programming Language Semantics, 3rd Workshop (Main, M. et al., eds.), 330–343. Lec. Notes Comp. Sci. 298. Springer, Berlin.

    Google Scholar 

  • Rogers, H., Jr. (1988). Theory of Recursive Functions and Effective Computability. 2nd printing. MIT Press, Cambridge, Mass.

    Google Scholar 

  • Scott, D. (1972). Lattice theory, data types and semantics. Formal Semantics of Programming Languages (Rustin, R., ed.), 65–106. Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Scott, D. (1973). Models for various type-free calculi. Logic, Methodology and Philosophy of Science IV (Suppes, P. et al., eds.), 157–187. North-Holland, Amsterdam.

    Google Scholar 

  • Scott, D. (1976). Data types as lattices. SIAM J. on Computing 5, 522–587.

    Article  Google Scholar 

  • Scott, D. (1982). Domains for denotational semantics. Automata, Languages and Programming (Nielsen, M. et al, eds.), 577–613. Lec. Notes Comp. Sci. 140. Springer, Berlin.

    Google Scholar 

  • Scott, D. and Strachey, C. (1971). Towards a mathematical semantics for computer languages. Computers and Automata (Fox, J., ed.), 19–46. Polytechnic Press, Brooklyn, N.Y.

    Google Scholar 

  • Smyth, M.B. (1987). Completeness of quasi-uniform spaces in terms of filters. Manuscript.

    Google Scholar 

  • Smyth, M.B. (1988). Quasi-uniformities: reconciling domains with metric spaces. Mathematical Foundations of Programming Language Semantics, 3rd Workshop (Main, M. et al., eds.), 236–253. Lec. Notes Comp. Sci. 298. Springer, Berlin.

    Google Scholar 

  • Smyth, M.B. (1977). Effectively given domains. Theoret. Comp. Sci. 5, 257–274.

    Article  Google Scholar 

  • Spreen, D. and Young, P. (1984). Effective operators in a topological setting. Computation and Proof Theory, Proc. Logic Colloquium '83 (Richter, M.M. et al., eds.), 437–451. Lec. Notes Math. 1104. Springer, Berlin.

    Google Scholar 

  • Spreen, D. (1990). A characterization of effective topologies. Recursion Theory Week, Proc., Oberwolfach 1989 (Ambos-Spies, K. et al, eds.), 363–388. Lec. Notes Math. 1432. Springer, Berlin.

    Google Scholar 

  • Spreen, D. (1991). A characterization of effective topologies II. Topology and Category Theory in Computer Science (Reed, G.M. et al., eds.), 231–255. Oxford University Press, Oxford.

    Google Scholar 

  • Weihrauch, K. and Deil, Th. (1980). Berechenbarkeit auf cpo-s. Schriften zur Angew. Math. u. Informatik Nr. 63, Rheinisch-Westfälische Technische Hochschule Aachen.

    Google Scholar 

  • Young, P. (1968). An effective operator, continuous but not partial recursive. Proc. Amer. Math. Soc. 19, 103–108.

    Google Scholar 

  • Young, P. and Collins, W. (1983). Discontinuities of provably correct operators on the provably recursive real numbers. J. Symbolic Logic 48, 913–920.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spreen, D. (1992). Effective operators and continuity revisited. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023898

Download citation

  • DOI: https://doi.org/10.1007/BFb0023898

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics