Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-16T16:59:46.901Z Has data issue: false hasContentIssue false

Logic of reduced power structures

Published online by Cambridge University Press:  12 March 2014

G.C. Nelson*
Affiliation:
University of Iowa, Iowa City, Iowa 52242

Extract

We start with the framework upon which this paper is based. The most useful reference for these notions is [2]. For any nonempty index set I and any proper filter D on S(I) (the power set of I), we denote by I/D the reduced power of modulo D as defined in [2, pp. 167–169]. The first-order language associated with I/D will always be the same language as associated with . We denote the 2-element Boolean algebra 〈{0, 1}, ⋂, ⋃, c, 0, 1〉 by 2 and 2I/D denotes the reduced power of it modulo D. We point out the intimate connection between the structures I/D and 2I/D given in [2, pp. 341–345]. Moreover, we assume as known the definition of Horn formula and Horn sentence as given in [2, p. 328] along with the fundamental theorem that φ is a reduced product sentence iff φ is provably equivalent to a Horn sentence [2, Theorem 6.2.5/ (iff φ is a 2-direct product sentence and a reduced power sentence [2, Proposition 6.2.6(ii)]). For a theory T(any set of sentences), T denotes that is a model of T.

In addition to the above we assume as known the elementary characteristics (due to Tarski) associated with a complete theory of a Boolean algebra, and we adopt the notation 〈n, p, q〉 of [3], [10], or [6] to denote such an elementary characteristic or the corresponding complete theory. We frequently will use Ershov's theorem which asserts that for each 〈n, p, q〉 there exist an index set I and filter D such that 2I/D ⊨ 〈n, p, q〉 [3] or [2, Lemma 6.3.21].

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

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]Burris, S., Boolean powers, Algebra Universalis, vol. 5 (1975), pp. 340360.CrossRefGoogle Scholar
[2]Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[3]Ershov, Yu. L., Decidability of the elementary theory of relatively complemented lattices and the theory of filters, Algebra i Logika, vol. 17 (1964), pp. 1738. (Russian)Google Scholar
[4]Galvin, F., Horn sentences, Annals of Mathematical Logic, vol. 1 (1969), pp. 389442.CrossRefGoogle Scholar
[5]Feferman, S. and Vaught, R. L., The first order properties of algebraic systems, Fundamenta Mathematicae, vol. 47 (1959), pp. 57103.CrossRefGoogle Scholar
[6]Mead, J. and Nelson, G. C., Model companions and k-model completeness for the complete theories of Boolean algebras, this Journal, vol. 45 (1980), pp. 4755.Google Scholar
[7]Nelson, G. C., The periodic power of and complete Horn theories, Algebra Universalis (to appear).Google Scholar
[8]Nelson, G. C., Boolen powers, recursive models, and the Horn theory of a structure (submitted).Google Scholar
[9]Omarov, A. I., On subsystems of reduced powers, Algebra i Logika, vol. 12 (1973), pp. 4246. (English translation)CrossRefGoogle Scholar
[10]Waszkiewicz, J., n-theories of Boolean algebras, Colloquium Mathematicum, vol. 30 (1974), pp. 171175.CrossRefGoogle Scholar
[11]Weglorz, B., Substructures of reduced powers, Fundamenta Mathematicae, vol. 89 (1975), pp. 191197.CrossRefGoogle Scholar
[12]Weinstein, J. M., First order properties preserved by direct product, Ph.D. Thesis, University of Wisconsin, Madison, Wisconsin, 1965.Google Scholar