Notions of weak genericity

DOI10.2307/2273469zbMath0549.03042OpenAlexW2168616714MaRDI QIDQ3342559

Stuart A. Kurtz

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

zbMATH Keywords

degree of unsolvabilityforcing in arithmeticn-generic sethyperimmune degreen-forcing setn-generic degree

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40)

Related Items

Demuth’s Path to Randomness, On Kurtz randomness, Asymptotic density, computable traceability, and 1-randomness, DEGREES OF RANDOMIZED COMPUTABILITY, Genericity and UD-random reals, The degrees of bi-hyperhyperimmune sets, On unstable and unoptimal prediction, STRUCTURAL HIGHNESS NOTIONS, HIGHER RANDOMNESS AND GENERICITY, Asymptotic Density and the Theory of Computability: A Partial Survey, Generics for computable Mathias forcing, Strong self-reducibility precludes strong immunity, The Information Content of Typical Reals, Canonical immunity and genericity, Computable analogs of cardinal characteristics: prediction and rearrangement, Algorithmically random series and Brownian motion, Asymptotic density and the coarse computability bound, GENERICITY AND RANDOMNESS WITH ITTMS, Hierarchy of Computably Enumerable Degrees II, Asymptotic density and computability, Degree spectra and immunity properties, Multiple genericity: a new transfinite hierarchy of genericity notions

Cites Work

• Retraceable Sets
• The degrees of bi‐immune sets
• Some applications of forcing to hierarchy problems in arithmetic
• The Degrees of Hyperimmune Sets