The Library

When are two effectively given domains identical?

Tools

Kanda, A. and Park, D. M. R. (1979) When are two effectively given domains identical? Coventry, UK: Department of Computer Science..

Full text not available from this repository.

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 recursive domain equation, there is an effectively given domain which is an initial solution to within effective isomorphism.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)
Divisions: Faculty of Science > Computer Science
Publisher: Department of Computer Science
Place of Publication: Coventry, UK
Date: April 1979
Identification Number: CS-RR-029
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access
Related URLs:
URI: http://wrap.warwick.ac.uk/id/eprint/46326

Request changes to a record

Actions (login required)

View Item View Item