The Degrees of Hyperimmune Sets

DOI10.1002/malq.19680140704zbMath0216.29102OpenAlexW2005432166MaRDI QIDQ5619821

Webb Miller, Donald A. Martin

Publication date: 1968

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19680140704

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Lowness for genericity, On \(p \)-universal and \(p \)-minimal numberings, Demuth’s Path to Randomness, The degrees of hyperhyperimmune sets, Degrees that are not degrees of categoricity, Asymptotic density, computable traceability, and 1-randomness, CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS, Covering the Recursive Sets, Randomness and universal machines, STRONG JUMP-TRACEABILITY, Natural factors of the Muchnik lattice capturing IPC, The degrees of bi-hyperhyperimmune sets, Upward closure and cohesive degrees, Minimal generalized computable numberings and families of positive preorders, Extremal numberings and fixed point theorems, Relationships Between Reducibilities, Lowness, Randomness, and Computable Analysis, Semirecursive Sets and Positive Reducibility, Minimal degrees and the jump operator, Schnorr trivial reals: a construction, Unnamed Item, ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS, The weakness of being cohesive, thin or free in reverse mathematics, The Rogers semilattices of generalized computable enumerations, Covering the recursive sets, On the structures inside truth-table degrees, Ramsey's theorem for computably enumerable colorings, Schnorr trivial sets and truth-table reducibility, Computational randomness and lowness, Schnorr Trivial Reals: A construction, Countable thin \(\Pi^0_1\) classes, Weakly semirecursive sets and r.e. orderings, Lowness Properties of Reals and Hyper-Immunity, Notions of weak genericity, The complexity of ODD_n^A, Local Initial Segments of The Turing Degrees, Recursively enumerable sets and degrees, On the ranked points of a Π₁⁰ set, Calibrating Randomness, Inherent enumerability of strong jump-traceability, Degrees joining to 0′, Lowness properties and randomness, Strong reducibilities, On trees without hyperimmune branches, Low Level Nondelegability Results: Domination and Recursive Enumeration