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.
Definability, complexity and index sets of classes of computable model
11.12.2014 15:00 - 16:30
Organiser:
KGRC
Location:
SR 101, 2. St., Währinger Str. 25