Elementary theories and structural properties of d-c.e. and n-c.e. degrees and
enumeration degrees of n-c.e.
sets. Questions on the structural properties of these semilattices, and some
Spectra of algebraic fields and subfields of F in both cases, as a structure and as a relation on F, and characterize the
sets of Turing degrees
The enumeration spectrum hierarchy of n-families© 2016 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimWe introduce a hierarchy of
sets which can
Q-degrees of n-C.E. setsIn this paper we study Q-degrees of n-
computably enumerable (n-c.e.)
sets. It is proved that n
Classifying equivalence relations in the Ershov hierarchy© 2020, The Author(s).
Computably enumerable equivalence relations (ceers) received a lot
Spectra of algebraic fields and subfields of F in both cases, as a structure and as a relation on F, and characterize the
sets of Turing degrees
Irreducible, Singular, and Contiguous Degrees not settled for these. A
computably enumerable Q-degree which consists of one
computably enumerable m
Khutoretskii’s Theorem for Generalized Computable Families. This implies limitedness of universal Σα0−
computable numberings for
2 ≤α<ω1CK.