Degrees of recursively enumerable sets which have no maximal supersets (Q5593823): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2270328 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150311525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank | |||
Normal rank | |||
Latest revision as of 00:46, 12 June 2024
scientific article; zbMATH DE number 3313436
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degrees of recursively enumerable sets which have no maximal supersets |
scientific article; zbMATH DE number 3313436 |
Statements
Degrees of recursively enumerable sets which have no maximal supersets (English)
0 references
1968
0 references
recursion theory, constructive mathematics
0 references
