1968
DOI: 10.1002/malq.19680140704
|View full text |Cite
|
Sign up to set email alerts
|

The Degrees of Hyperimmune Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
52
1

Year Published

1969
1969
2022
2022

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 77 publications
(53 citation statements)
references
References 6 publications
(4 reference statements)
0
52
1
Order By: Relevance
“…On the other hand, Bedregal and Nies [3] have shown that if A is Low(CR) then A has hyperimmune-free degree (also see [13]). The only 0 2 sets of hyperimmune-free degree are the computable ones, by Miller and Martin [18].…”
Section: Theorem 57 Each Low(cr) Set Is Computablementioning
confidence: 99%
“…On the other hand, Bedregal and Nies [3] have shown that if A is Low(CR) then A has hyperimmune-free degree (also see [13]). The only 0 2 sets of hyperimmune-free degree are the computable ones, by Miller and Martin [18].…”
Section: Theorem 57 Each Low(cr) Set Is Computablementioning
confidence: 99%
“…Hyperimmune-Free Degrees Martin and Miller in [Miller and Martin 1968] extended the definition of hyperimmune from a single set to an entire degree.…”
Section: 6mentioning
confidence: 99%
“…Following Miller and Martin [73], we say that A is hyperimmune-free iff for all functions f ≤ T A, there is a computable function g such that for all x, f (x) ≤ g(x).…”
Section: Theorem 336 (Nies Stephan and Terwijn [78]) Suppose That mentioning
confidence: 99%