Borel separability of the coanalytic Ramsey sets

Annals of Pure and Applied Logic 144 (1-3):130-132 (2006)
  Copy   BIBTEX

Abstract

Let AC and AI denote the collections of graphs with vertex set ω and which have, respectively, no infinite independent subgraph, and no infinite complete subgraph. Both AC and AI are coanalytic sets of reals that are not analytic, and they are disjoint by Ramsey’s theorem. We prove that there exists a Borel set separating AC and AI, and we discuss the sense in which this is an infinite analogue of a weak version of

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

The independence of Ramsey's theorem.E. M. Kleinberg - 1969 - Journal of Symbolic Logic 34 (2):205-206.
Infinite lotteries, large and small sets.Luc Lauwers - 2017 - Synthese 194 (6):2203-2209.
On some sets of dictionaries whose ω ‐powers have a given.Olivier Finkel - 2010 - Mathematical Logic Quarterly 56 (5):452-460.
A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
On Borel ideals.Fons van Engelen - 1994 - Annals of Pure and Applied Logic 70 (2):177-203.
Some Ramsey theory in Boolean algebra for complexity classes.Gregory L. McColm - 1992 - Mathematical Logic Quarterly 38 (1):293-298.

Analytics

Added to PP
2013-12-31

Downloads
37 (#118,170)

6 months
17 (#859,272)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references