2014 seminar talk: Definability, complexity and index sets of classes of computable models

Talk held by Sergey Goncharov (Novosibirsk State University, Russia, and Russian Academy of Sciences) at the KGRC seminar on 2014-12-11.


We will discuss some problem about definability and complexity of these descriptions for classes of computable modes. The main topic will connect with decidable models and characterizations of these classes. We will present the results about complexity of description of autostable relative to strong constructivizations computable models with finite signatures. We will discuss some related problems.

Bottom menu

Kurt Gödel Research Center for Mathematical Logic. Währinger Straße 25, 1090 Wien, Austria. Phone +43-1-4277-50501. Last updated: 2010-12-16, 04:37.