Vorträge (In Alphabetischer Reihenfolge)

Theoretical Computer Science 4th GI Conference

Volume 67 of the series Lecture Notes in Computer Science pp 170-181


When are two effectively given domains identical?

  • Akira Kanda
  • , David Park

* Final gross prices may vary according to local VAT.

Get Access


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.