Nonassociative Computable Rings and Their Isomorphisms. (1998)

Khoussainov, B.; Slinko, A.

dc.contributor.author	Khoussainov, B.	en
dc.contributor.author	Slinko, A.	en
dc.date.accessioned	2009-08-28T03:21:39Z	en
dc.date.available	2009-08-28T03:21:39Z	en
dc.date.issued	1998-03	en
dc.identifier.citation	Department of Mathematics - Research Reports-386 (1998)	en
dc.identifier.issn	1173-0889	en
dc.identifier.uri	http://hdl.handle.net/2292/5047	en
dc.description.abstract	We prove that for any $ninomegacup{omega}$ there exists a ring with exactly $n$ computable isomorphism types. We also investigate the relationship between the number of computable isomorphism types of a ring and the number of computable isomorphism types of its expansion by a finite number of constants.	en
dc.publisher	Department of Mathematics, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	Research Reports - Department of Mathematics	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.math.auckland.ac.nz/Research/Reports/view.php?id=386	en
dc.title	Nonassociative Computable Rings and Their Isomorphisms. (1998)	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::230000 Mathematical Sciences::230100 Mathematics	en
dc.rights.holder	The author(s)	en