For β an ordinal, let PEAβ (SetPEAβ) denote the class of polyadic equality (set) algebras of dimension β. We show that for any infinite ordinal α, if is atomic, then for any n < ω, the n-neat reduct of , in symbols , is a completely representable PEAn (regardless of the representability of ). That is to say, for all non-zero , there is a and a homomorphism such that fa(a) ≠ 0 and for any for which exists. We give new proofs that various classes consisting solely of completely representable algebras of relations are not elementary; we further show that the class of completely representable relation algebras is not closed under ≡∞,ω. Various notions of representability (such as ‘satisfying the Lyndon conditions’, weak and strong) are lifted from the level of atom structures to that of atomic algebras and are further characterized via special neat embeddings. As a sample, we show that the class of atomic CAns satisfying the Lyndon conditions coincides with the class of atomic algebras in ElScNrnCAω, where El denotes ‘elementary closure’ and Sc is the operation of forming complete subalgebras.
Let α be an infinite ordinal. Let RCAα denote the variety of representable cylindric algebras of dimension α. Modifying Andréka’s methods of splitting, we show that the variety RQEAα of representable quasi-polyadic equality algebras of dimension α is not axiomatized by a set of universal formulas containing only finitely many variables over the variety RQAα of representable quasi-polyadic algebras of dimension α. This strengthens a seminal result due to Sain and Thompson, answers a question posed by Andréka, and lifts to the transfinite a result of hers proved for finite dimensions > 2. Using the modified method of splitting, we show that all known complexity results on universal axiomatizations of RCAα (proved by Andréka) transfer to universal axiomatizations of RQEAα. From such results it can be inferred that any algebraizable extension of Lω,ω is severely incomplete if we insist on Tarskian square semantics. Ways of circumventing the strong non-negative axiomatizability results hitherto obtained in the first part of the paper, such as guarding semantics, and /or expanding the signature of RQEAω by substitutions indexed by transformations coming from a finitely presented subsemigroup of (ωω, ○) containing all transpositions and replacements, are surveyed, discussed, and elaborated upon.
Fix 2 < n < ω and let CAn denote the class of cyindric algebras of dimension n. Roughly CAn is the algebraic counterpart of the proof theory of first order logic restricted to the first n variables which we denote by Ln. The variety RCAn of representable CAns reflects algebraically the semantics of Ln. Members of RCAn are concrete algebras consisting of genuine n-ary relations, with set theoretic operations induced by the nature of relations, such as projections referred to as cylindrifications. Although CAn has a finite equational axiomatization, RCAn is not finitely axiomatizable, and it generally exhibits wild, often unpredictable and unruly behavior. This makes the theory of CAn substantially richer than that of Boolean algebras, just as much as Lω,ω is richer than propositional logic. We show using a so-called blow up and blur construction that several varieties (in fact infinitely many) containing and including the variety RCAn are not atom-canonical. A variety V of Boolean algebras with operators is atom canonical, if whenever ∈ V is atomic, then its Dedekind-MacNeille completion, sometimes referred to as its minimal completion, is also in V. From our hitherto obtained algebraic results we show, employing the powerful machinery of algebraic logic, that the celebrated Henkin-Orey omitting types theorem, which is one of the classical first (historically) cornerstones of model theory of Lω,ω, fails dramatically for Ln even if we allow certain generalized models that are only locallly classical. It is also shown that any class K such that NrnCAω ∩ CRCAn K ScNrnCAn+3, where CRCAn is the class of completely representable CAns, and Sc denotes the operation of forming dense (complete) subalgebras, is not elementary. Finally, we show that any class K such that SdRaCAω K ScRaCA5 is not elementary, where Sd denotes the operation of forming dense subalgebra.
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi-dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach is algebraic addressing varieties generated by complex algebras of Kripke semantics for such logics. The algebras dealt with are common cylindrification free reducts of cylindric and polyadic algebras. For finite dimensions, we show that such varieties are finitely axiomatizable, have the super amalgamation property, and that the subclasses consisting of only completely representable algebras are elementary, and are also finitely axiomatizable in first order logic. Also their modal logics have an N P complete satisfiability problem. Analogous results are obtained for infinite dimensions by replacing finite axiomatizability by finite schema axiomatizability.