The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867): Difference between revisions
From MaRDI portal
Set profile property. |
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/2275436 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048614185 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The recursively enumerable degrees have infinitely many one-types / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively enumerable sets and degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong reducibilities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The weak truth table degrees of recursively enumerable sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Conference in mathematical logic, London 1970 / rank | |||
Normal rank | |||
Latest revision as of 15:46, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The theory of the recursively enumerable weak truth-table degrees is undecidable |
scientific article |
Statements
The theory of the recursively enumerable weak truth-table degrees is undecidable (English)
0 references
1 April 1993
0 references
semilattice
0 references
r.e. wtt-degrees
0 references
elementary theory
0 references
