Skip to main content
SpringerLink
Log in

When are two effectively given domains identical?

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

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

Abstract

In this paper, we will observe that the notion of computability in an effectively given domain is dependent on the indexing of its basis. This indicates that we cannot identify two effectively given domains just because they are order isomorphic. We propose a suitable notion of effective isomorphism to compensate for this deficiency. Also we show that, for every recursion domain equation, there is an effectively given domain which is an initial solution to within effective isomorphism.

(Extended Abstract)

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Egli-Constable, Computability concepts for programming language semantics, Theoritical Computer Science, Vol. 2 (1976).

    Google Scholar 

  2. Kanda. A, Data types as effective objects, Theory of Computation Report No.22, Warwick University, (1977).

    Google Scholar 

  3. Markowsky-Rosen, Bases for chain complete posets, IBM Journal of Research and Development, Vol.20, No.2, (1979).

    Google Scholar 

  4. Plotkin. G, A power domain construction, SIAM Journal on Computing, Vol.5, (1976).

    Google Scholar 

  5. Rogers, H. Theory of recursive functions and effective computability, McGraw Hill, New York, (1967).

    Google Scholar 

  6. Tang. A, Recrusion theory and descriptive set theory in effectively given To-spaces, Ph.D. theesis, Princeton Univ. (1974).

    Google Scholar 

  7. Scott. D, Outline of the mathematical theory of computation, Proc. of the 4th Princeton Conference on Information Science, (1970).

    Google Scholar 

  8. Smyth. M, Effectively given domains, Theoretical Computer Science, Vol. 5 (1977).

    Google Scholar 

  9. Smyth-Plotkin, The categorical solution of recursive domain equattions, Proc. of the 18th IEEE FOCS Conference, (1977).

    Google Scholar 

Download references

Authors
  1. Akira Kanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanda, A., Park, D. (1979). When are two effectively given domains identical?. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation