Density, forcing, and the covering problem
From MaRDI portal
Publication:2355765
Abstract: We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L"of random set X such that X does not compute 0' and X computes every K-trivial set.
Recommendations
- On the Erdős covering problem: the density of the uncovered set
- On packings and coverings of unit density
- scientific article; zbMATH DE number 1163714
- On the density of finite packings
- On a relation between packing and covering densities of convex bodies
- scientific article; zbMATH DE number 3971633
- scientific article; zbMATH DE number 1229732
- scientific article; zbMATH DE number 4025460
- Density Problems for p (n )
Cited in
(17)- Strong jump-traceability
- Lowness, Randomness, and Computable Analysis
- Randomness notions and reverse mathematics
- A computational approach to the Borwein-Ditor theorem
- Extracting randomness within a subset is hard
- Coherent randomness tests and computing the \(K\)-trivial sets
- Calculus of cost functions
- A covering theorem and the random-indestructibility of the density zero ideal
- Computing from projections of random points
- Using almost-everywhere theorems from analysis to study randomness
- Lebesgue density and \(\Pi _1^0\) classes
- Nullifying randomness and genericity using symmetric difference
- Deep \(\Pi_1^0\) classes
- Lightface \(\varPi ^0_3\)-completeness of density sets under effective Wadge reducibility
- Covering the recursive sets
- Continuous higher randomness
- Martin-Löf reducibility and cost functions
This page was built for publication: Density, forcing, and the covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355765)
