2 search results - page 1 / 1 » Classifying the Provably Total Functions of PA |
BSL
2006
13 years 5 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
LOGCOM
2007
13 years 5 months ago
2007
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...