Automatic and polynomial-time structures, punctual computability

Algorithmic learning

Equivalence relations and computably enumerable structures

Theory of numberings

Computable groups

HKSS-Universal classes of structures

Computable embeddings for classes of structures

Bi-embeddable structures

Effective categoricity

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

Other works on computability theory

The theory of lists

Boolean algebras with distinguished endomorphisms

Publications listed in the reverse chronological order [pdf].

Last updated: October 5, 2021.