Some more independence results in complexity theory
β Scribed by Philip W. Grant
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 712 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract It is known that for two given countable sets of unary relations __A__ and __B__ on Ο there exists an infinite set __H__ β« Ο on which __A__ and __B__ are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result.
## Abstract For a graph __G__, the cochromatic number of __G__, denoted __z__(__G__), is the least __m__ for which there is a partition of the vertex set of __G__ having order __m__. where each part induces a complete or empty graph. We show that if {__G__~__n__~} is a family of graphs where __G__