Inductive Complexity of Goodstein's Theorem

Show simple item record Hertel, J en 2013-01-06T23:09:22Z en 2013-01-06T23:09:22Z en 2012 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-418 (2012) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri 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 en
dc.source.uri 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 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace