Title of article
Borel separability of the coanalytic Ramsey sets
Author/Authors
Taylor، نويسنده , , Alan D.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
130
To page
132
Abstract
Let AC (“almost complete”) and AI (“almost independent”) 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 P = NP .
Keywords
P = NP , Analytic set , Ramsey’s theorem
Journal title
Annals of Pure and Applied Logic
Serial Year
2006
Journal title
Annals of Pure and Applied Logic
Record number
1443861
Link To Document