scientific article; zbMATH DE number 1752644
Let us consider the semilattices: \(D^n_e\) of all \(n\)-recursively enumerable \(e\)-degrees and \(D^n_T\) of all \(n\)-recursively enumerable Turing degrees. The main result of this paper asserts that an elementary equivalence of semilattices \(D^n_e\) and \(D^m_T\) is possible only if \(n=2, m=1\). With this aim the following theorem is proved: For every \(n\)-recursively enumerable set \(A\) which is not enumerable, there exist \(3\)-recursively enumerable sets \(B_0,B_1 \leq_e A\) (which also are not enumerable) such that the intersection of the \(e\)-degree of \(B_0\) and the \(e\)-degree of \(B_1\) is equal to \(0_e\).
- On multiple positive reducibility
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees
- Relations between reducibilities of table type
- Upper semilattice of recursively enumerable Q-degrees
- On elementary theories of semilattices of partial orders on sets
- On cardinality of semilattices of enumerations of nondiscrete families
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees
- The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
- A survey of results on the d-c.e. and n-c.e. degrees
- Splitting properties of n-c.e. enumeration degrees
- scientific article; zbMATH DE number 24993 (Why is no real title available?)
- On the definition of a Lachlan semilattice
- A semilattice generated by superlow computably enumerable degrees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533283)
