Relations between reducibilities of table type
From MaRDI portal
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\).
Recommendations
Cites work
- A note on universal sets
- btt-reducibility
- scientific article; zbMATH DE number 3689373 (Why is no real title available?)
- scientific article; zbMATH DE number 3792148 (Why is no real title available?)
- ON RECURSIVELY ENUMERABLE MINIMAL BTT-DEGREES
- Recursively Enumerable Sets and Retracing Functions
- Relations between reducibilities of table type
Cited in
(8)- Comparison of linear reducibility with other reducibilities of tabular type
- Degrees of denumerability reducibilities
- On distributivity of the upper semilattices of the degrees below 0'
- scientific article; zbMATH DE number 1232433 (Why is no real title available?)
- scientific article; zbMATH DE number 1752644 (Why is no real title available?)
- scientific article; zbMATH DE number 4116518 (Why is no real title available?)
- Relations between table-type degrees
- Relations between reducibilities of table type
This page was built for publication: Relations between reducibilities of table type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796521)
