Computability and autostability

Sergey Goncharov (gonchar@math.nsc.ru)
Novosibirsk State University (Russia)

We intend to talk about the autostability problem of computable models and definable relations on computable models. The classification problem of computable models has deep interrelations with the problem of complexity of definable relations. This approach is closely connected with a choice of a language in which a suitable description of computable numberings is considered. We will also discuss some open questions on complexity of the theories with recursive models.