The Degrees of Hyperimmune Sets

DOI10.1002/MALQ.19680140704MaRDI QIDQ5619821zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(45)

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

This page was built for publication: The Degrees of Hyperimmune Sets

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