Limits to joining with generics and randoms
From MaRDI portal
Publication:5737985
DOI10.1142/9789814449274_0004zbMATH Open1364.03057arXiv1209.3282OpenAlexW2326799362MaRDI QIDQ5737985FDOQ5737985
Authors: Adam R. Day, Damir D. Dzhafarov
Publication date: 31 May 2017
Published in: Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)
Abstract: Posner and Robinson (1981) proved that if is non-computable, then there exists a such that . Shore and Slaman (1999) extended this result to all , by showing that if then there exists a such that . Their argument employs Kumabe-Slaman forcing, and so the set they obtain, unlike that of the Posner-Robinson theorem, is not generic for Cohen forcing in any way. We answer the question of whether this is a necessary complication by showing that for all , the set of the Shore-Slaman theorem cannot be chosen to be even weakly 2-generic. Our result applies to several other effective forcing notions commonly used in computability theory, and we also prove that the set cannot be chosen to be 2-random.
Full work available at URL: https://arxiv.org/abs/1209.3282
Recommendations
Other Turing degree structures (03D28) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)
Cited In (4)
This page was built for publication: Limits to joining with generics and randoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737985)