Notions of weak genericity
From MaRDI portal
Publication:3342559
DOI10.2307/2273469zbMath0549.03042MaRDI QIDQ3342559
Publication date: 1983
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273469
degree of unsolvability; forcing in arithmetic; n-generic set; hyperimmune degree; n-forcing set; n-generic degree
03D30: Other degrees and reducibilities in computability and recursion theory
03E40: Other aspects of forcing and Boolean-valued models
Related Items
Strong self-reducibility precludes strong immunity, On Kurtz randomness, Degree spectra and immunity properties
Cites Work