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.
CITATION STYLE
Kanda, A., & Park, D. (1979). When are two effectively given domains identical? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 67 LNCS, pp. 170–181). Springer Verlag. https://doi.org/10.1007/3-540-09118-1_19
Mendeley helps you to discover research relevant for your work.