Canonical immunity and genericity

DOI10.4064/FM11-2-2021MaRDI QIDQ5162576zbMATH OpenOpenAlexFDO

Authors Achilles A. Beros, Konstantinos A. Beros

Publication date 3 November 2021

Published in Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

\(n\)-genericcanonical immunitycomputable Mathias forcingSchnorr randomness

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On Mathias generic sets
• Generics for computable Mathias forcing
• A hierarchy of immunity and density for sets of reals
• Hyperimmunity in \(2^{\mathbb N}\)
• Immunity for closed sets

Cites work

• Algorithmic randomness and complexity.
• Effective bi-immunity and randomness
• Generics for computable Mathias forcing
• Happy families
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Notions of weak genericity
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Randomness, relativization and Turing degrees

This page was built for publication: Canonical immunity and genericity

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