×

Elementary theory of \({\mathfrak D}\)-degrees. (English. Russian original) Zbl 0602.03006

Algebra Logic 23, 358-363 (1984); translation from Algebra Logika 23, No. 5, 530-537 (1984).
The author first adapts his characterization of \(\kappa\)-saturated Boolean algebras [Sib. Mat. Zh. 15, 1414-1415 (1974; Zbl 0311.02059)], in terms of \(\kappa\)-separation and \(\kappa\)-compactness, to Boolean lattices. (A Boolean lattice is to a Boolean algebra what a ring of sets is to a field of sets.) He then turns to [\({\mathfrak D}]{\mathfrak M}\) (the ”\({\mathfrak D}\)-degree of \({\mathfrak M}\)” of the translator), where \({\mathfrak D}\) is a Boolean lattice and \({\mathfrak M}\) is an algebraic structure (with a one-element subalgebra). This notion was introduced by Yu. L. Ershov [Algebra Logika 18, 680-722 (1979; Zbl 0451.06013)]; [\({\mathfrak D}]{\mathfrak M}\) is a direct limit of certain direct powers of \({\mathfrak M}\). The author shows: (1) The elementary theory of \([{\mathfrak D}]{\mathfrak M}\) only depends on the elementary theory of \({\mathfrak D}\) and the elementary theory of \({\mathfrak M}\). (2) If \({\mathfrak M}\) is finite and \({\mathfrak D}\) is \(\kappa\)-saturated, then [\({\mathfrak D}]{\mathfrak M}\) is \(\kappa\)-saturated. Finally, the author extends his algebra of elementary types of Boolean algebras [Algebra Logika 12, 74-82 (1973; Zbl 0286.02055)] to the elementary types of Boolean lattices. (Let \(\epsilon({\mathfrak D})\) be the elementary type of the Boolean lattice \({\mathfrak D}\). Then: \(\epsilon ({\mathfrak D}')+\epsilon ({\mathfrak D}'')=\epsilon ({\mathfrak D}'\times {\mathfrak D}'')\) and \(\epsilon ({\mathfrak D}')\times \epsilon ({\mathfrak D}'')=\epsilon ([{\mathfrak D}']{\mathfrak D}'').)\)

MSC:

03C20 Ultraproducts and related constructions
03G10 Logical aspects of lattices and related structures
06D99 Distributive lattices

References:

[1] Yu. L. Ershov, ”On elementary theories of Post manifolds,” Algebra Logika,6, No. 5, 7–16 (1967). · Zbl 0211.33303 · doi:10.1016/0021-8693(67)90010-5
[2] Yu. L. Ershov, ”Distributive lattices with relative complements,” Algebra Logika,18, No. 6, 680–722 (1979).
[3] Yu. L. Ershov, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
[4] J. T. Baldwin and R. N. Kerrie, ”Counting models in universal Horn classes,” Algebra Univ.,15, No. 3, 359–384 (1982). · Zbl 0525.03028 · doi:10.1007/BF02483731
[5] A. L. Fosker, ”Generalized ’Boolean’ theory of universal algebras. I, II,” Math. Z.,58, 191–199 (1953).
[6] S. Burris, ”Boolean powers,” Algebra Univ.,5, No. 3, 341–360 (1975). · Zbl 0328.08003 · doi:10.1007/BF02485268
[7] H. Werner, ”Sheaf constructions in universal algebra and model theory,” Universal Algebra and Applications (1982). · Zbl 0515.03017
[8] A. I. Omarov, ”Saturation of Boolean algebras,” Sib. Mat. Zh.,15, No. 6, 1414–1415 (1974).
[9] A. I. Omarov, ”On the D-degrees of algebraic systems,” in: Studies on Constructive Models [in Russian], Alma-Ata (1982), pp. 54–56.
[10] A. I. Omarov, ”On subsystems of reduced degrees,” Algebra Logika,12, No. 1, 74–82 (1973).
[11] B. Weglors, ”Substructures of reduced power,” Fund. Math.,89, No. 3, 191–197 (1975).
[12] J. Keisler and C. Chan, Model Theory [Russian translation], Mir, Moscow (1977).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.