Higman's Embedding Theorem. An Elementary Proof

Dediu, L

dc.contributor.author	Dediu, L	en
dc.date.accessioned	2009-04-16T23:10:43Z	en
dc.date.available	2009-04-16T23:10:43Z	en
dc.date.issued	1995-10	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-010 (1995)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3519	en
dc.description.abstract	In 1961 G. Higman proved a remarkable theorem establishing a deep connection between the logical notion of recursiveness and questions about finitely presented groups. The basic aim of the present paper is to provide the reader with a rigorous and detailed proof of Higman's Theorem. All the necessary preliminary material, including elements of group theory and recursive functions theory, is systematically presented and with complete proofs. The aquainted reader may skip the first sections and proceed immediately to the last.	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	Higman's Embedding Theorem. An Elementary Proof	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