Computability in Europe 2008
Logic and Theory of Algorithms
|Slot:||Wed, 17:10-17:30, Amphitheater B (col. 2)|
In the paper there are several new examples of computable models spectras of theories with few models. Also there is a result about difference between arithmetical complexity among models from the same class up to Sudoplatov classification of types of isomorphism of Ehrenfeucht theories.
|websites: Arnold Beckmann||2008-05-19|