Automatic and polynomial-time structures, punctual computability

Algorithmic learning

Theory of numberings

Equivalence relations and computably enumerable structures

Computable embeddings for classes of structures

Computable groups

HKSS-Universal classes of structures

Bi-embeddable structures

Effective categoricity

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

The theory of lists

Boolean algebras with distinguished endomorphisms

Last updated: January 30, 2021.