Reverse mathematics and a Ramsey-type König's Lemma

Journal of Symbolic Logic 77 (4):1272-1280 (2012)
  Copy   BIBTEX

Abstract

In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,310

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Comparing DNR and WWKL.Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp & Theodore A. Slaman - 2004 - Journal of Symbolic Logic 69 (4):1089-1104.
On the Indecomposability of $\omega^{N}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
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.
Reverse Mathematics: The Playground of Logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
The Weak König Lemma and Uniform Continuity.Josef Berger - 2008 - Journal of Symbolic Logic 73 (3):933-939.
Generalizing König's Infinity Lemma.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):243-247.
Ramsey and the Notion of Arbitrary Function.Gabriel Sandu - 2005 - In Maria J. Frapolli Sanz (ed.), Continuum Studies in British Philosophy. London, Great Brittain: Continuum International Publishing Group. pp. 237-256.
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
Ideals of Nowhere Ramsey Sets Are Isomorphic.Szymon Plewik - 1994 - Journal of Symbolic Logic 59 (2):662-667.

Analytics

Added to PP
2012-11-03

Downloads
28 (#412,831)

6 months
1 (#415,900)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degrees Bounding Principles and Universal Instances in Reverse Mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.
Ramsey-Type Graph Coloring and Diagonal Non-Computability.Ludovic Patey - 2015 - Archive for Mathematical Logic 54 (7-8):899-914.
Separating Principles Below WKL0.Stephen Flood & Henry Towsner - 2016 - Mathematical Logic Quarterly 62 (6):507-529.
The Strength of the Tree Theorem for Pairs in Reverse Mathematics.Ludovic Patey - 2016 - Journal of Symbolic Logic 81 (4):1481-1499.

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
A Cohesive Set Which is Not High.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.

Add more references