A limit on relative genericity in the recursively enumerable sets (Q3476801): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2274854 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083502326 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The recursively enumerable degrees are dense / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the degrees less than 0' / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:35, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A limit on relative genericity in the recursively enumerable sets |
scientific article |
Statements
A limit on relative genericity in the recursively enumerable sets (English)
0 references
1989
0 references
low set
0 references
jump approximation
0 references
recursively enumerable sets
0 references
Turing degrees
0 references
Turing jump
0 references
deep degrees
0 references
Turing functionals
0 references
low degree
0 references
