Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-19T09:36:03.902Z Has data issue: false hasContentIssue false

On first-order sentences without finite models

Published online by Cambridge University Press:  12 March 2014

Marko Djordjević*
Affiliation:
Department of Mathematics, University of Uppsala, Box 480, 75106 Uppsala, Sweden, E-mail: [email protected]

Extract

We will mainly be concerned with a result which refutes a stronger variant of a conjecture of Macpherson about finitely axiomatizable ω-categorical theories. Then we prove a result which implies that the ω-categorical stable pseudoplanes of Hrushovski do not have the finite submodel property.

Let's call a consistent first-order sentence without finite models an axiom of infinity. Can we somehow describe the axioms of infinity? Two standard examples are:

ϕ1: A first-order sentence which expresses that a binary relation < on a nonempty universe is transitive and irreflexive and that for every x there is y such that x < y.

ϕ2: A first-order sentence which expresses that there is a unique x such that, (0) for every y, s(y)x (where s is a unary function symbol),

and, for every x, if x does not satisfy (0) then there is a unique y such that s(y) = x.

Every complete theory T such that ϕ1 ϵ T has the strict order property (as defined in [10]), since the formula x < y will have the strict order property for T. Let's say that if Ψ is an axiom of infinity and every complete theory T with Ψ ϵ T has the strict order property, then Ψ has the strict order property.

Every complete theory T such that ϕ2 ϵ T is not ω-categorical. This is the case because a complete theory T without finite models is ω-categorical if and only if, for every 0 < n < ω, there are only finitely many formulas in the variables x1,…,xn, up to equivalence, in any model of T.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baldwin, J. T. and Shelah, S., Randomness and semigenericity, Transactions of the American Mathematical Society, vol. 349 (1997), no. 4, pp. 13591376.CrossRefGoogle Scholar
[2]Cherlin, G., Harrington, L., and Lachlan, A. H., 0-categorical, ℵ0-stable structures, Annals of Pure and Applied Logic, vol. 28 (1985), pp. 103135.CrossRefGoogle Scholar
[3]Evans, D. M., 0-categorical structures with a predimension, Annals of Pure and Applied Logic, vol. 116 (2002), pp. 157186.CrossRefGoogle Scholar
[4]Herwig, B., Weight ω in stable theories with few types, this Journal, vol. 60 (1995), no. 2, pp. 353373.Google Scholar
[5]Hodges, W., Model Theory, Cambridge University Press, 1993.CrossRefGoogle Scholar
[6]Ivanov, A. A., Countahly categorical structures with a distributive lattice of algebraically closed subsets, Logic Colloquium '92 (Vezprem, 1992) (Csirmaz, L., Gabbay, D. M., and Rijke, M. de, editors), CSLI Publications, Stanford, 1995.Google Scholar
[7]Kantor, W. M., Liebeck, M. W., and Macpherson, H. D., 0-categorical structures smoothly approximated by finite structures, Proceedings of the London Mathematical Society, vol. 59 (1989), pp. 439463.CrossRefGoogle Scholar
[8]Lippel, D., Finitely axiomatizable ω-categorical theories and the Mazoyer hypothesis, preprint.Google Scholar
[9]Macpherson, D., Finite axiomatizability and theories with trivial algebraic closure, Notre Dame Journal of Formal Logic, vol. 32 (1991), no. 2, pp. 188192.CrossRefGoogle Scholar
[10]Shelah, S., Classification theory and the number of non-isomorphic models, North-Holland, Amsterdam, 1978.Google Scholar
[11]Wagner, F. O., Relational structures and dimensions, Automorphisms of First-Order Structures (Kaye, R. and Macpherson, D., editors), Oxford University Press, Oxford, 1994.Google Scholar
[12]Wagner, F. O., Simple Theories, Kluwer Academic Publishers, 2000.CrossRefGoogle Scholar