A minimal pair of recursively enumerable degrees (Q5519131): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2269807 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051601785 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The recursively enumerable degrees are dense / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degrees of Unsolvability. (AM-55) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:55, 11 June 2024
scientific article; zbMATH DE number 3231080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimal pair of recursively enumerable degrees |
scientific article; zbMATH DE number 3231080 |
Statements
A minimal pair of recursively enumerable degrees (English)
0 references
1966
0 references
mathematical logic
0 references
0 references
