Publications

Surveys

Automatic structures

Theory of numberings

Equivalence relations and computably enumerable structures

Computable embeddings for classes of structures

  • Effective embeddings for pairs of structures, in Proceedings of CiE-2019 (Lect. Notes Comput. Sci., 11558), 84-95. With Hristo Ganchev and Stefan Vatev.
  • Turing computable embeddings, computable infinitary equivalence, and linear orders [pdf download], in Proceedings of CiE-2017 (Lect. Notes Comput. Sci., 10307), 141-151. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-58741-7_15

Computable groups

HKSS-Universal classes of structures

Effective categoricity

Effective categoricity for decidable structures (autostability relative to strong constructivizations)

The theory of lists

Boolean algebras with distinguished endomorphisms

Last updated: November 8, 2019.