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 above
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/bsl/1286284559
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,750
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
[Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.

View all 37 references / Add more references

Citations of this work BETA

Hilbert, Completeness and Geometry.Giorgio Venturi - 2011 - Rivista Italiana di Filosofia Analitica Junior 2 (2):80-102.

View all 7 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2010-10-06

Total views
135 ( #76,050 of 2,438,647 )

Recent downloads (6 months)
1 ( #436,491 of 2,438,647 )

How can I increase my downloads?

Downloads

My notes