Relations between reducibilities of table type (Q796521)
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 3865258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relations between reducibilities of table type |
scientific article; zbMATH DE number 3865258 |
Statements
Relations between reducibilities of table type (English)
0 references
1983
0 references
It is proved that the elementary theories of the upper semilattices of the recursively enumerable p- and d-degrees are not equal. Let \(P_ r\) be a family of r-complete sets. It is noticed that \((i) (P_{btt}\cap P_ l\cap P_ c)\backslash P_{bl}\neq \text{ø}\); (ii) \((P{}_{btt}\cap P_ l)\backslash(P_ c\cup P_{bl})\neq \emptyset\).
0 references
recursively enumerable degrees
0 references
reducibilities of table type
0 references
elementary theories
0 references
upper semilattices
0 references
0.9187764525413512
0 references
0.8410744071006775
0 references
0.8389741778373718
0 references
0.8339771628379822
0 references
0.8274551630020142
0 references
