On Computable Theoretic Properties of Structures and Their Cartesian Products

Khoussainov, B

dc.contributor.author	Khoussainov, B	en
dc.date.accessioned	2009-04-16T23:15:01Z	en
dc.date.available	2009-04-16T23:15:01Z	en
dc.date.issued	2000-03	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-125 (2000)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3634	en
dc.description.abstract	In this paper we show that for any set X C ω there exists a structure A that has no presentation computable in X such that A2 has a computable presentation. We also show that there exists a structure A with infinitely many computable isomorphism types such that A2 has exactly one computable isomorphism type.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	On Computable Theoretic Properties of Structures and Their Cartesian Products	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en