Density, forcing, and the covering problem

DOI10.4310/MRL.2015.V22.N3.A5zbMath1326.03050arXiv1304.2789MaRDI QIDQ2355765

Adam R. Day, Joseph S. Miller

Publication date: 28 July 2015

Published in: Mathematical Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.2789

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items (10)

A Computational Approach to the Borwein-Ditor Theorem ⋮ Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility ⋮ STRONG JUMP-TRACEABILITY ⋮ DEEP CLASSES ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Computing from projections of random points ⋮ Lowness, Randomness, and Computable Analysis ⋮ LEBESGUE DENSITY AND CLASSES ⋮ Continuous higher randomness

This page was built for publication: Density, forcing, and the covering problem