## A strong law of computationally weak subsets

- Bjørn Kjos-Hanssen
- Electronic Colloquium on Computational Complexity
- 2010

The stable Ramsey’s theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for non-null… (More)

Sorry, we couldn't extract any figures or tables for this paper.

Showing 1-10 of 31 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential