We prove some results about existence of NP-complete and NP-hard (for Turing reductions) sparse sets on different settings over the real numbers.
Turing cones and set theory of the reals
✍ Scribed by Benedikt Löwe
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 99 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider the possible complexity of the set of reals belonging to an inner model M of set theory. We show that if this set is analytic then either l-2, M is countable or else all reals are in M. We also show that if an inner model contains a superperfect set of reals as a subset then it contains
Let a finite partition F of the real interval (0, 1) be given. We show that if every member of F is measurable or if every member of F is a Baire set, then one member of F must contain a sequence with all of its finite sums and products (and, in the measurable case, all of its infinite sums as well)