A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM

Kazuyuki Tanaka

doi:10.1002/malq.19920380127

A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM

Kazuyuki Tanaka

SCI - Mathematics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of ω is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.

Original language	English
Pages (from-to)	301-304
Number of pages	4
Journal	Mathematical Logic Quarterly
Volume	38
Issue number	1
DOIs	https://doi.org/10.1002/malq.19920380127
Publication status	Published - 1992

Keywords

Analytic Ramsey theorem
determinacy of infinite games

ASJC Scopus subject areas

Logic

Access to Document

10.1002/malq.19920380127

Cite this

@article{f902a610eb2c4ef8908becb9a04cea6b,

title = "A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM",

abstract = "We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of ω is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.",

keywords = "Analytic Ramsey theorem, determinacy of infinite games",

author = "Kazuyuki Tanaka",

year = "1992",

doi = "10.1002/malq.19920380127",

language = "English",

volume = "38",

pages = "301--304",

journal = "Mathematical Logic Quarterly",

issn = "0942-5616",

publisher = "Wiley-VCH Verlag",

number = "1",

}

TY - JOUR

T1 - A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM

AU - Tanaka, Kazuyuki

PY - 1992

Y1 - 1992

N2 - We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of ω is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.

AB - We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set P of subsets of ω is called Ramsey if there exists an infinite set H such that either all infinite subsets of H are in P or all out of P. Our proof clarifies a strong connection between the Ramsey property of partitions and the determinacy of infinite games.

KW - Analytic Ramsey theorem

KW - determinacy of infinite games

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

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

U2 - 10.1002/malq.19920380127

DO - 10.1002/malq.19920380127

M3 - Article

AN - SCOPUS:84981379418

VL - 38

SP - 301

EP - 304

JO - Mathematical Logic Quarterly

JF - Mathematical Logic Quarterly

SN - 0942-5616

IS - 1

ER -

A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this