Finitely axiomatizable ω-categorical theories and the Mazoyer hypothesis
Lippel, David
J. Symbolic Logic, Tome 70 (2005) no. 1, p. 460-472 / Harvested from Project Euclid
Let ℱ be the class of complete, finitely axiomatizable ω-categorical theories. It is not known whether there are simple theories in ℱ. We prove three results of the form: if T∈ ℱ has a sufficently well-behaved definable set J, then T is not simple. (In one case, we actually prove that T has the strict order property.) All of our arguments assume that the definable set J satisfies the Mazoyer hypothesis, which controls how an element of J can be algebraic over a subset of the model. For every known example in ℱ, there is a definable set satisfying the Mazoyer hypothesis.
Publié le : 2005-06-14
Classification: 
@article{1120224723,
     author = {Lippel, David},
     title = {Finitely axiomatizable $\omega$-categorical theories and the Mazoyer hypothesis},
     journal = {J. Symbolic Logic},
     volume = {70},
     number = {1},
     year = {2005},
     pages = { 460-472},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1120224723}
}
Lippel, David. Finitely axiomatizable ω-categorical theories and the Mazoyer hypothesis. J. Symbolic Logic, Tome 70 (2005) no. 1, pp.  460-472. http://gdmltest.u-ga.fr/item/1120224723/