How enumeration reductibility yields extended Harrington non-splitting (Q3503759): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the degrees less than 0' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degrees joining to <b>0</b>′ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic year 1979--80, The University of Connecticut, USA / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The \(n\)-rea enumeration degrees are dense / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounding and nonbounding minimal pairs in the enumeration degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4417312 / rank | |||
Normal rank |
Latest revision as of 11:29, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How enumeration reductibility yields extended Harrington non-splitting |
scientific article |
Statements
How enumeration reductibility yields extended Harrington non-splitting (English)
0 references
9 June 2008
0 references
nonsplitting
0 references
noncupping
0 references
enumeration degree
0 references
c.e. degree
0 references