Skip to main content
SpringerLink
Log in
Book cover

Symposium on Recursive Combinatorics

LaM 1983: Logic and Machines: Decision Problems and Complexity pp 103–117Cite as

On r.e. inseparability of CPO index sets

  • Section I: Complexity
  • Conference paper
  • First Online:

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

Abstract

In this paper the r.e. inseparability and the effective r.e. inseparability of index sets under certain indexings of the computable elements of an effective cpo are studied. As a consequence of the main result on effective r.e. inseparability we obtain a generalization of a theorem by McNaughton. As a further application we obtain generalizations of results by Myhill/Dekker on the productivity of certain index sets. From this we infer the generalization of theorems by Rice/Shapiro/McNaughton/Myhill and Myhill/Shepherdson. This demonstrates the importance of the r.e. inseparability notion.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Case, J.: private communication (1982).

    Google Scholar 

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

    Google Scholar 

  3. Eršov, Ju. L.: Theorie der Numerierungen I. Zeitschr. f. Math. Logik u. Grundl. d. Math. 19, 289–388 (1973).

    Google Scholar 

  4. Gierz, G. et. al.: A Compendium of Continuous Lattices. Berlin: Springer (1980).

    Google Scholar 

  5. Kanda, A.; Park, D.: When are two effectively given domains identical? 4th GI Conference Theoretical Comput. Sci., Aachen 1979, Lec. Notes Comput. Sci. 67, 170–181 (1979).

    Google Scholar 

  6. Myhill, J.; Dekker, J.C.E.: Some theorems on classes of recursively enumerable sets. Transact. AMS 89, 29–59 (1958).

    Google Scholar 

  7. Plotkin, G.: Пω as a universal domain. J. Computer Syst. Sci. 17, 209–236 (1978).

    Google Scholar 

  8. Rogers, H., Jr.: Theory of Recursive Functions and Effective Computability. New York: McGraw-Hill (1967).

    Google Scholar 

  9. Scott, D.: Outline of a mathematical theory of computation. Techn. Monograph PRG-2, Oxford Uni. Comp. Lab. (1970).

    Google Scholar 

  10. Sciore, E.; Tang, A.: Admissible coherent cpo-s. Automata, Languages and Programming, 5th Colloq., Udine 1978, Lec. Notes Comput. Sci. 62, 440–456 (1978).

    Google Scholar 

  11. Smyth, M.B.: Effectively given domains. Theoret. Comp. Sci. 257–274 (1973).

    Google Scholar 

  12. Weihrauch, K.; Deil, Th.: Berechenbarkeit auf cpo-s. Schriften zur Angew. Math. u. Informatik Nr. 63, RWTH Aachen (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik I, Rheinisch-Westfälische Technische Hochschule Aachen, Büchel 29-31, D-5100, Aachen, West Germany

    Dieter Spreen

Authors
  1. Dieter Spreen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spreen, D. (1984). On r.e. inseparability of CPO index sets. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation