Ramsey’s theorem for singletons and strong computable reducibility

Damir D. Dzhafarov, Ludovic Patey, Reed Solomon, Linda Brown Westrick

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > ℓ Ramsey’s theorem for singletons and k-colorings, RT1/k, is not strongly computably reducible to the stable Ramsey’s theorem for _-colorings, SRT2/ ℓ Our proof actually establishes the following considerably stronger fact: given k > ℓ there is a coloring c: ω → ℓ such that for every stable coloring d: [ω]2 → ℓ (computable from c or not), there is an infinite homogeneous set H for d that computes no infinite homogeneous set for c. This also answers a separate question of Dzhafarov, as it follows that the cohesive principle, COH, is not strongly computably reducible to the stable Ramsey’s theorem for all colorings, SRT2<. The latter is the strongest partial result to date in the direction of giving a negative answer to the longstanding open question of whether COH is implied by the stable Ramsey’s theorem in ω-models of RCA0.

Original languageEnglish (US)
Pages (from-to)1343-1355
Number of pages13
JournalProceedings of the American Mathematical Society
Volume145
Issue number3
DOIs
StatePublished - Jan 1 2017

Fingerprint

Reducibility
Coloring
Colouring
Theorem
Partial

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Cite this

Dzhafarov, Damir D. ; Patey, Ludovic ; Solomon, Reed ; Westrick, Linda Brown. / Ramsey’s theorem for singletons and strong computable reducibility. In: Proceedings of the American Mathematical Society. 2017 ; Vol. 145, No. 3. pp. 1343-1355.
@article{2db098f37e2d416a84f2abbabcac6e14,
title = "Ramsey’s theorem for singletons and strong computable reducibility",
abstract = "We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > ℓ Ramsey’s theorem for singletons and k-colorings, RT1/k, is not strongly computably reducible to the stable Ramsey’s theorem for _-colorings, SRT2/ ℓ Our proof actually establishes the following considerably stronger fact: given k > ℓ there is a coloring c: ω → ℓ such that for every stable coloring d: [ω]2 → ℓ (computable from c or not), there is an infinite homogeneous set H for d that computes no infinite homogeneous set for c. This also answers a separate question of Dzhafarov, as it follows that the cohesive principle, COH, is not strongly computably reducible to the stable Ramsey’s theorem for all colorings, SRT2<∞. The latter is the strongest partial result to date in the direction of giving a negative answer to the longstanding open question of whether COH is implied by the stable Ramsey’s theorem in ω-models of RCA0.",
author = "Dzhafarov, {Damir D.} and Ludovic Patey and Reed Solomon and Westrick, {Linda Brown}",
year = "2017",
month = "1",
day = "1",
doi = "10.1090/proc/13315",
language = "English (US)",
volume = "145",
pages = "1343--1355",
journal = "Proceedings of the American Mathematical Society",
issn = "0002-9939",
publisher = "American Mathematical Society",
number = "3",

}

Ramsey’s theorem for singletons and strong computable reducibility. / Dzhafarov, Damir D.; Patey, Ludovic; Solomon, Reed; Westrick, Linda Brown.

In: Proceedings of the American Mathematical Society, Vol. 145, No. 3, 01.01.2017, p. 1343-1355.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ramsey’s theorem for singletons and strong computable reducibility

AU - Dzhafarov, Damir D.

AU - Patey, Ludovic

AU - Solomon, Reed

AU - Westrick, Linda Brown

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > ℓ Ramsey’s theorem for singletons and k-colorings, RT1/k, is not strongly computably reducible to the stable Ramsey’s theorem for _-colorings, SRT2/ ℓ Our proof actually establishes the following considerably stronger fact: given k > ℓ there is a coloring c: ω → ℓ such that for every stable coloring d: [ω]2 → ℓ (computable from c or not), there is an infinite homogeneous set H for d that computes no infinite homogeneous set for c. This also answers a separate question of Dzhafarov, as it follows that the cohesive principle, COH, is not strongly computably reducible to the stable Ramsey’s theorem for all colorings, SRT2<∞. The latter is the strongest partial result to date in the direction of giving a negative answer to the longstanding open question of whether COH is implied by the stable Ramsey’s theorem in ω-models of RCA0.

AB - We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > ℓ Ramsey’s theorem for singletons and k-colorings, RT1/k, is not strongly computably reducible to the stable Ramsey’s theorem for _-colorings, SRT2/ ℓ Our proof actually establishes the following considerably stronger fact: given k > ℓ there is a coloring c: ω → ℓ such that for every stable coloring d: [ω]2 → ℓ (computable from c or not), there is an infinite homogeneous set H for d that computes no infinite homogeneous set for c. This also answers a separate question of Dzhafarov, as it follows that the cohesive principle, COH, is not strongly computably reducible to the stable Ramsey’s theorem for all colorings, SRT2<∞. The latter is the strongest partial result to date in the direction of giving a negative answer to the longstanding open question of whether COH is implied by the stable Ramsey’s theorem in ω-models of RCA0.

UR - http://www.scopus.com/inward/record.url?scp=85007282887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85007282887&partnerID=8YFLogxK

U2 - 10.1090/proc/13315

DO - 10.1090/proc/13315

M3 - Article

AN - SCOPUS:85007282887

VL - 145

SP - 1343

EP - 1355

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 3

ER -