Bulletin of Symbolic Logic 20 (2):170-200 (2014)

Authors
Chaehyun Chong
Sogang University
Abstract
We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/bsl.2014.14
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: 56,016
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
The Fine Structure of the Constructible Hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Ramsey's Theorem and Recursion Theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.

View all 21 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2016-06-30

Total views
11 ( #791,820 of 2,403,593 )

Recent downloads (6 months)
2 ( #360,719 of 2,403,593 )

How can I increase my downloads?

Downloads

My notes