A journey to computably enumerable structures (tutorial lectures)

DOI10.1007/978-3-319-94418-0_1OpenAlexW2810996038MaRDI QIDQ1670712

Bakh Khoussainov

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_1

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57)

Related Items (5)

Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ Word problems and ceers ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Well-orders realized by C.E. equivalence relations

This page was built for publication: A journey to computably enumerable structures (tutorial lectures)