Relations between table-type degrees (Q790106): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2073082088 / rank | |||
Normal rank |
Latest revision as of 09:33, 30 July 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