Immunity for Closed Sets

DOI10.1007/978-3-642-03073-4_12zbMath1268.03049MaRDI QIDQ3576043

Guohua Wu, Douglas Cenzer, Rebecca Weber

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_12

zbMATH Keywords

computability; \(\Pi^0_1\) classes

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Countable thin \(\Pi^0_1\) classes
• Effectively closed sets and graphs of computable real functions.
• Hyperimmunity in \(2^{\mathbb N}\)
• Small \(\Pi^{0}_{1}\) classes
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
• Algorithmic Randomness and Complexity
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Mass Problems and Randomness
• Initial segments of the lattice of Π₁⁰ classes
• A splitting theorem for the Medvedev and Muchnik lattices
• Π₁⁰ classes and Boolean combinations of recursively enumerable sets
• An extension of the recursively enumerable Turing degrees
• Algorithmic Randomness of Closed Sets
• ∏ 0 1 Classes and Degrees of Theories
• Logical Approaches to Computational Barriers