Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1

Downey, R.G; Jockusch Jr, C.G

dc.contributor.author	Downey, R.G	en
dc.contributor.author	Jockusch Jr, C.G	en
dc.date.accessioned	2009-04-16T23:15:18Z	en
dc.date.available	2009-04-16T23:15:18Z	en
dc.date.issued	1997-08	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-051 (1997)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3560	en
dc.description.abstract	We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B=I is of Cantor-Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of infinite Cantor-Bendixson rank.	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	Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1	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