Inductive Complexity of Goodstein's Theorem

Hertel, J

dc.contributor.author	Hertel, J	en
dc.date.accessioned	2013-01-06T23:09:22Z	en
dc.date.available	2013-01-06T23:09:22Z	en
dc.date.issued	2012	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-418 (2012)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/19807	en
dc.description.abstract	We use the recently introduced [1,2] inductive complexity measure to evaluate the inductive complexity of Goodstein's Theorem, a statement that is independent from Peano Arithmetic.	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	Inductive Complexity of Goodstein's Theorem	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