Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-16T11:58:24.186Z Has data issue: false hasContentIssue false

The model-theoretic significance of complemented existential formulas

Published online by Cambridge University Press:  12 March 2014

Volker Weispfenning*
Affiliation:
University of Heidelberg, 69 Heidelberg, Federal Republic of Germany

Extract

Let T be an inductive, first-order theory in a language L, let E(L) denote the set of existential L-formulas, and let E(T) denote the distributive lattice of equivalence-classes φT of formulas φE(L) with respect to equivalence in T. We consider three types of ‘complements’ in E(T): Let φT, ψTE(T) and suppose φT ∏ ψT = 0. Then ψT is a complement of φT, if φT ∐ ψT = 1; ψT is a pseudo-complement of φT, if for all μTE(T), (φT ∐ ψT) = 0 implies μT ≤ ψT; ψT is a “weak complement of φT, if for all μTE(T), (φT ⋰ ψT) ∐ μT = 0 implies μT = 0. The following facts are obvious: A complement of φT is also a pseudo-complement of φT and a pseudo-complement of φT is also a weak complement of φT. Any φT has at most one pseudo-complement; it is denoted by φT*. The relations ‘ψT is the complement of φT’ and ‘ψT is a weak complement of φT’ are symmetrical. We call φT (weakly, pseudo-) complemented if φT has a (weak, pseudo-) complement, and we call E(T) (weakly, pseudo-) complemented if every φT is (weakly, pseudo-) complemented.

The object of this note is to characterize (weakly, pseudo-) complemented existential formulas in model-theoretic terms, and conversely to characterize some classical notions of Robinson style model theory in terms of these formulas. The following theorems illustrate the second approach.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1981

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]Bacsich, P. and Hughes, D.R., Syntactic characterisations of amalgamation, convexity and related properties, this Journal, vol. 39 (1974), pp. 433451.Google Scholar
[2]Barwise, J. and Robinson, A., Completing theories by forcing, Annals of Mathematical Logic, vol. 2 (1970), pp. 119142.CrossRefGoogle Scholar
[3]Cherlin, G., The model-companion of a class of structures, this Journal, vol. 37 (1972), pp. 546556.Google Scholar
[4]Cherlin, G., Lindenbaum algebras and model companions, Rutgers University, 1976 (preprint).Google Scholar
[5]Grátzer, G., Lattice theory, Freeman, San Francisco, 1971.Google Scholar
[6]Hirschfeld, J., Finite forcing, existential types and complete types, this Journal, vol. 45 (1980), pp. 93101.Google Scholar
[7]Macintyre, A., Model-completeness for sheaves of structures, Fundamenta Mathematicae, vol. 81 (1973), pp. 7389.CrossRefGoogle Scholar
[8]Robinson, A., A decision method for algebra and geometry—revisited, Proceedings of the Tarski Symposium, Proceedings of Symposia in Pure Mathematics, vol. 25, American Mathematical Society, Providence, R. I., 1974, pp. 139152.Google Scholar
[9]Weispfenning, V., Negative-existentially complete structures and definability in free extensions, this Journal, vol. 41 (1976), pp. 95108.Google Scholar
[10]Weispfenning, V., A note on ℵ0-categorical model-companions, Archiv für Mathematische Logik und Grundlagenforschung, vol. 19 (1978), pp. 2329.CrossRefGoogle Scholar