Homogeneous models and almost decidability
1989 ◽
Vol 46
(3)
◽
pp. 343-355
◽
Keyword(s):
AbstractCountable homogeneous models are ‘simple’ objects from a model theoretic point of view. From a recursion theoretic point of view they can be complex. For instance the elementary theory of such a model might be undecidable, or the set of complete types might be recursively complex. Unfortunately even if neither of these conditions holds, such a model still can be undecidable. This paper investigates countable homogeneous models with respect to a weaker notion of decidability called almost decidable. It is shown that for theories that have only countably many type spectra, any countable homogeneous model of such a theory that has a Σ2 type spectrum is almost decidable.
Keyword(s):
2015 ◽
Vol 58
(3)
◽
pp. 449-458
◽
Keyword(s):
2013 ◽
Vol 15
(03)
◽
pp. 1340019
◽
Keyword(s):
Keyword(s):
2005 ◽
Vol 08
(07)
◽
pp. 947-958
◽
Keyword(s):
2000 ◽
Vol 43
(2)
◽
pp. 379-393
◽