We consider sets of reals that are "adequate" in various senses, for example dominating or unbounded or splitting or non-meager. Call a real x "needed" (in any of these senses) if every adequate set contains a real in which x is recursive. We characterize the needed reals for numerous senses of "ade
Regular reals
β Scribed by Guohua Wu
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 180 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Say that Ξ± is an n-strongly c. e. (n-strongly computably enumerable) real if Ξ± is a sum of n many strongly c. e. reals, and that Ξ± is regular if Ξ± is n-strongly c. e. for some n. Let S n be the set of all n-strongly c. e. reals, Reg be the set of regular reals and CE be the set of c. e. reals. Then we have:
This gives a hierarchy of the c. e. reals. We also study the regularity of the d. c. e. reals.
π SIMILAR VOLUMES
Solovay showed that there are noncomputable reals Ξ± such that , where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an H-trivial real. We also analyze
Suppose that G is a finite group. We show that every 2-block of G has a defect class which is real. As a partial converse, we show that if G has a real 2-regular Ε½ . class with defect group D and if N D rD has no dihedral subgroup of order 8, then G has a real 2-block with defect group D. More gener