Canonical immunity and genericity

DOI10.4064/fm11-2-2021OpenAlexW3154120872MaRDI QIDQ5162576

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

Schnorr randomnesscomputable Mathias forcing\(n\)-genericcanonical immunity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Generics for computable Mathias forcing
• Effective Bi-immunity and Randomness
• Algorithmic Randomness and Complexity
• Notions of weak genericity
• Happy families
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Randomness, relativization and Turing degrees