arXiv:1102.0596 [math.LO]AbstractReferencesReviewsResources
A sneak preview of proof theory of ordinals
Published 2011-02-03Version 1
This talk is a sneak preview of the project, 'proof theory for theories of ordinals'. Background, aims, survey and furture works on the project are given. Subsystems of second order arithmetic are embedded in recursively large ordinals and then the latter are analysed. We scarcely touch upon proof theoretical matters.
Journal: Annals of the Japan Association for Philosophy of Science vol. 20(2012), pp. 29-47
Categories: math.LO
Subjects: 03F03
Keywords: proof theory, sneak preview, second order arithmetic, proof theoretical matters, recursively large ordinals
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0906.3882 [math.LO] (Published 2009-06-21)
Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic
arXiv:1606.04194 [math.LO] (Published 2016-06-14)
Cut-elimination for SBL
arXiv:1604.08822 [math.LO] (Published 2016-04-29)
Unified Correspondence and Proof Theory for Strict Implication