The undecidability of the recursively enumerable degrees (Q3666835): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1066893 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Leo Harrington / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank | |||
Normal rank | |||
Latest revision as of 09:58, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undecidability of the recursively enumerable degrees |
scientific article |
Statements
The undecidability of the recursively enumerable degrees (English)
0 references
1982
0 references
recursively enumerable degrees
0 references
undecidability
0 references
partial ordering
0 references
priority argument
0 references
