There is no low maximal d. c. e. degree - CorrigendumWe give a corrected proof of an extension of the Robinson Splitting Theorem for the
d.
c.
e There is no low maximal d. c. e. degree ⊗ L is n-
c.
e. and hence there is no low
maximal n-
c.
e.
degree.
There is no low maximal d. c. e. degree ⊗ L is n-
c.
e. and hence there is no low
maximal n-
c.
e.
degree.
There is no low maximal d. c. e. degree - CorrigendumWe give a corrected proof of an extension of the Robinson Splitting Theorem for the
d.
c.
e A survey of results on the d-c.e. and n-c.e. degrees of Turing and enumeration
degrees of n-
c.e. sets. Questions on the structural properties
Degrees of categoricity of rigid structures© Springer International Publishing AG 2017. We prove that there exists a properly 2-
c.e. Turing