Reverse mathematics: the playground of logic
Bulletin of Symbolic Logic 16 (3):378-402 (2010)
Abstract
This paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main systems of reverse mathematics. While retaining the usual base theory and working still within second order arithmetic, theorems are described that range from those far below the usual systems to ones far aboveDOI
10.2178/bsl/1286284559
My notes
Similar books and articles
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
Reverse Mathematics and Uniformity in Proofs without Excluded Middle.Jeffry L. Hirst & Carl Mummert - 2011 - Notre Dame Journal of Formal Logic 52 (2):149-162.
Foundations Without Foundationalism: A Case for Second-Order Logic.Stewart Shapiro - 1991 - Oxford, England: Oxford University Press.
Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.
Analytics
Added to PP
2010-10-06
Downloads
139 (#92,275)
6 months
2 (#302,213)
2010-10-06
Downloads
139 (#92,275)
6 months
2 (#302,213)
Historical graph of downloads
Citations of this work
Set existence principles and closure conditions: unravelling the standard view of reverse mathematics.Benedict Eastaugh - 2019 - Philosophia Mathematica 27 (2):153-176.
The prehistory of the subsystems of second-order arithmetic.Walter Dean & Sean Walsh - 2017 - Review of Symbolic Logic 10 (2):357-396.
On notions of computability-theoretic reduction between Π21 principles.Denis R. Hirschfeldt & Carl G. Jockusch - 2016 - Journal of Mathematical Logic 16 (1):1650002.
Term extraction and Ramsey's theorem for pairs.Alexander P. Kreuzer & Ulrich Kohlenbach - 2012 - Journal of Symbolic Logic 77 (3):853-895.
Almost Theorems of Hyperarithmetic Analysis.Richard A. Shore - forthcoming - Journal of Symbolic Logic:1-33.
References found in this work
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.