Comparison of linear reducibility with other reducibilities of tabular type (Q1062049)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of linear reducibility with other reducibilities of tabular type |
scientific article; zbMATH DE number 3912363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of linear reducibility with other reducibilities of tabular type |
scientific article; zbMATH DE number 3912363 |
Statements
Comparison of linear reducibility with other reducibilities of tabular type (English)
0 references
1983
0 references
It is proved that \(Th(L_{\ell})\neq Th(L_ r)\), where \(r\in \{tt,p,d\}\) and \(L_{\ell}\) \((L_ r)\) is the semilattice of r.e. \(\ell\)-degrees (r- degrees). Some facts about connections between c-, bd-, \(\ell\)-, d- completeness are given.
0 references
semilattice
0 references
degrees
0 references
0.8718547821044922
0 references
0.8582266569137573
0 references
0.8339771628379822
0 references
0.8163111805915833
0 references
0.7741793394088745
0 references