Relations between table-type degrees (Q790106): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relations between table-type degrees |
scientific article |
Statements
Relations between table-type degrees (English)
0 references
1983
0 references
If r is a reducibility, let \(Th(L_ r)\) be the elementary theory of the upper semilattice of the recursively enumerable r-degrees \(L_ r\). It is proved that \((i)\quad Th(L_{tt})\neq Th(L_ p); (ii)\quad Th(L_ l)\neq Th(L_ r)\) for \(r\in \{btt,tt,p,d\}\). An example of a non-recursive btt- degree which contains only one m-degree is also constructed.
0 references
table-type reducibilities
0 references
r-degrees
0 references
