The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 150234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The theory of the recursively enumerable weak truth-table degrees is undecidable |
scientific article; zbMATH DE number 150234 |
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
0.8704715967178345
0 references
0.8434921503067017
0 references
The main result of this paper is the following theorem. Theorem 7. The partial order \({\mathcal E}^ 3\) of \(\Sigma^ 0_ 3\)-sets under inclusion is elementary definable with parameters in the semilattice of r.e. wtt- degrees. Using a result of E. Herrmann, it follows from this theorem that the elementary theory of r.e. wtt-degrees is undecidable. This is the solution of an open problem due to P. Odifreddi.
0 references