Notions of weak genericity

DOI10.2307/2273469MaRDI QIDQ3342559zbMATH OpenOpenAlexFDO

Authors 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 arithmetichyperimmune degreen-forcing setn-generic degreen-generic set

Mathematics Subject Classification ID

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

Recommendations

• Relative definability of n-generics
• Generics for computable Mathias forcing
• Relative recursive enumerability of generic degrees
• Every n-generic degree is a minimal cover of an n-generic degree
• Generic degrees are complemented

Cites work

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

Cited in

(32)

• Algorithmically random series and Brownian motion
• On Kurtz randomness
• Computable analogs of cardinal characteristics: prediction and rearrangement
• Asymptotic density and computability
• Multiple genericity: a new transfinite hierarchy of genericity notions
• Separating weak -change and -change genericity
• Generics for computable Mathias forcing
• On genericity and Ershov's hierarchy
• Asymptotic density and the coarse computability bound
• Demuth's path to randomness
• On Mathias generic sets
• Genericity and UD-random reals
• Asymptotic density and the theory of computability: a partial survey
• Weakly Definable Types
• Generalised weak presentations
• Asymptotic density, computable traceability, and 1-randomness
• Hierarchy of Computably Enumerable Degrees II
• Degree spectra and immunity properties
• Weak generic types and coverings of groups I
• Reals n-generic relative to some perfect tree
• The degrees of bi-hyperhyperimmune sets
• Almost weakly 2-generic sets
• Higher randomness and genericity
• The information content of typical reals
• Relative definability of n-generics
• Strong self-reducibility precludes strong immunity
• Degrees of randomized computability
• On unstable and unoptimal prediction
• Canonical immunity and genericity
• Genericity and randomness with ITTMs
• STRUCTURAL HIGHNESS NOTIONS
• Generic degrees are complemented

This page was built for publication: Notions of weak genericity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342559)