Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Properly Σ2 Enumeration Degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Enumeration reducibility and partial degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On minimal pairs of enumeration degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3329452 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility and Completeness for Sets of Integers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Latest revision as of 11:10, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> |
scientific article |
Statements
Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (English)
0 references
23 April 1997
0 references
enumeration degree
0 references
noncappable degree
0 references
0 references
