Notions of representability for cylindric algebras: some algebras are more representable than others

The theory of cylindric algebras was introduced by Tarski in the fifties of the twentieth century, and its intensive study was further pursued by pioneers such as Henkin and Monk and, by the Hungarian mathematicians Andréka, Németi and Sain, and many of their students; to name only a few: Madarász, Marx, Kurucz, Simon, Mikulás, and Sági and many others outside Hungary including the author of this paper. Here we introduce and investigate new notions of representability for cylindric algebras and investigate various connections between such notions. Let 2<n≤l<m≤ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2<n\le l<m\le \omega $$\end{document}. Let CAn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {CA}_n$$\end{document} denote the variety of cylindric algebras of dimension n and let RCAn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {RCA}_n$$\end{document} denote the variety of representable CAn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {CA}_n$$\end{document}s. We say that an atomic algebra A∈CAn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}\in \textsf {CA}_n$$\end{document} has the complex neat embedding property up to l and m if A∈RCAn∩NrnCAl\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}\in \textsf {RCA}_n\cap \textsf {Nr}_n\textsf {CA}_l$$\end{document} and CmAtA∈SNrnCAm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{{\mathfrak {C}}}{{\mathfrak {m}}}}\textsf {At}{{\mathfrak {A}}}\in \mathbf {S}\textsf {Nr}_n\textsf {CA}_m$$\end{document}. Fixing the prarameters l at the value n, this is a measure of how much the algebra is representable. The yardstick is how far can its Dedekind–MacNeille completion be dilated, that is to say, counting the number of more extra dimensions its Dedekind–MacNeille completion neatly embeds into. If A,B∈RCAn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}, {{\mathfrak {B}}}\in \textsf {RCA}_n$$\end{document} are atomic, CmAtB∈SNrnCAl\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{{\mathfrak {C}}}{{\mathfrak {m}}}}\textsf {At}{{\mathfrak {B}}}\in S\textsf {Nr}_n\textsf {CA}_l$$\end{document} and CmAtA∈SNrnCAm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{{\mathfrak {C}}}{{\mathfrak {m}}}}\textsf {At}{{\mathfrak {A}}}\in S\textsf {Nr}_n\textsf {CA}_m$$\end{document}, then we say that A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}$$\end{document} is more representable than B\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {B}}}$$\end{document}. When m=ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=\omega $$\end{document}, we say that A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}$$\end{document} is strongly representable; this is the maximum degree of representability; the algebra in question cannot be ‘more representable’ than that. In this case the atom structure of A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathfrak {A}}}$$\end{document}, namely AtA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {At}{{\mathfrak {A}}}$$\end{document}, is strongly representable in the sense of Hirsch and Hodkinson. This notion gives an infinite potential spectrum of ‘degrees’ of representability. In this connection, we exhibit various atomic algebras in RCAn∩NrnCAl\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {RCA}_n\cap \textsf {Nr}_n\textsf {CA}_l$$\end{document} that do no not have the complex neat embedding property for infinitely many values of l and m. It is known that the class of Kripke frames Str(RCAn)={F:CmF∈RCAn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {Str}(\textsf {RCA}_n)=\{{{\mathfrak {F}}}: {{{\mathfrak {C}}}{{\mathfrak {m}}}}{{\mathfrak {F}}}\in \textsf {RCA}_n\}$$\end{document} is not elementary. From this it follows that there is some n<m<ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n<m<\omega $$\end{document} such that Str(SNrnCAm)={F:CmF∈SNrnCAm}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {Str}(\mathbf {S}\textsf {Nr}_n\textsf {CA}_m)=\{{{\mathfrak {F}}}: {{{\mathfrak {C}}}{{\mathfrak {m}}}}{{\mathfrak {F}}}\in \mathbf {S}\textsf {Nr}_n\textsf {CA}_m\}$$\end{document} is not elementary. Replacing S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {S}$$\end{document} by Sc\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {S}_c$$\end{document} (forming complete subalgebras), Sd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {S}_d$$\end{document} (forming dense subalgebras) and I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {I}$$\end{document} (forming isomorphic copies), respectively, we show that for any O∈{Sc,Sd,I}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {O}\in \{\mathbf {S}_c, \mathbf {S}_d, \mathbf {I}\}$$\end{document}, the class of frames Str(ONrnCAn+3)={F:CmF∈ONrnCAn+3}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {Str}(\mathbf {O}\textsf {Nr}_n\textsf {CA}_{n+3})=\{{{\mathfrak {F}}}: {{{\mathfrak {C}}}{{\mathfrak {m}}}}{{\mathfrak {F}}}\in \mathbf {O}\textsf {Nr}_n\textsf {CA}_{n+3}\}$$\end{document} is not elementary. Metalogical applications are given to n-variable fragments of first-order logic endowed with so-called clique guarded semantics. The last semantics capture the new notions of representations introduced and studied in this paper.


Introduction
It is well known that every Boolean algebra (satisfying a finite set of equations) is isomorphic to a field of sets, that is to say, every Boolean algebra is representable in some concrete sense, where the Boolean meets and joins are intepreted respectively as set-theoretic intersections and unions. This result, better known in the literature as Stone's Theorem, is equivalent (in ZFC) to the completeness of propositional logic. But in the case of cylindric and polyadic algebras of various dimensions the 'representation problem' is somewhat more involved. For example not every cylindric algebra of dimension greater than 1 is representable as a genuine field of sets with cylindrifications interpreted as forming cylinders, and in fact, the class of representable cylindric algebras of dimension greater than 2, though a variety, cannot be axiomatized by a finite schema of equations. Nevertheless, Tarski proved that in certain significant cases the finitely many cylindric algebra axioms may be adequate and strong enough to enforce representability.
In this connection, Tarski proved that every locally finite-dimensional cylindric algebra of infinite dimension is representable, and this, in turn, is equivalent to the completeness theorem of first-order logic proved earlier by Malcev and Henkin (who generalized Gödel's original completeness proof for only countable first-order languages using the technique of Skolem functions). Here the condition of 'locally finite-dimensional' is an algebraic condition reflecting the fact that the formulas considered have finite length. The condition of being locally finite-dimensional is not a first-order one, nor can it indeed be replaced equivalently by a condition that is first-order definable, because it can be quite easily shown that the ultraproduct of locally finite-dimensional cylindric algebras (of infinite dimension) may not be locally finite-dimensional.
In the realm of representable algebras, there are several types of representations. Ordinary representations are just isomorphisms from Boolean algebras of operators to a more concrete structure (having the same signature) whose elements are sets endowed with settheoretic operations like intersection and complementation and forming cylinders. Complete representations, on the other hand, are representations that preserve arbitrary conjunctions whenever defined. More generally, consider the following question: Given an algebra and a set of meets, is there a representation that carries this set of meets to set-theoretic intersections? A complete representation would thus be one that preserves all existing meets (finite of course and infinite). Here we are assuming that our semantics is specified by set algebras, with the concrete Boolean operation of intersection among its basic operations.
When the algebra in question is countable, and we have only countably many meets; this is an algebraic version of an omitting types theorem; the representation omits the given set meets or non-principal types. When the algebra in question is atomic, then a representation omitting the non-principal type consisting of co-atoms turns out to be a complete representation. This follows from the following result due to Hirsch and Hodkinson: A Boolean algebra A has a complete representation f : A → ℘ (X ), ∪, ∩, ∼, ∅, X ( f is a 1-1 homomorphism and X a set) if and only if A is atomic and x∈AtA f (x) = X , where AtA is the set of atoms of A. The notion of complete representations has been linked to the algebraic notion of atomcanonicity (a well-known persistence property in modal logic) and to the metalogical notions of Martin's axiom, omitting types theorems and the existence of atomic models for atomic theories in various fragments and extensions of first-order logic [14,16].
On the face of it, the notion of complete representations seems to be strikingly a secondorder one. This intuition is confirmed in [5], where it is proved that the classes of completely representable cylindric algebras of dimension at least three and that of relation algebras are not elementary. These results were proved by Hirsch and Hodkinson using so-called rainbow algebras [5]; in this paper we present entirely different proofs for all such results and some more closely related ones using so-called Monk-like algebras. Our proof depends essentially on some form of an infinite combinatorial version of Ramsey's Theorem. But running to such conclusions concerning (non-)first-order definability can be reckless and far too hasty, for in other non-trivial cases the notion of complete representations turns out not to be a genuinely second-order one; it is definable in first-order logic.
The class of completely representable Boolean algebras is elementary; it simply coincides with the atomic ones. A far less trivial example is the class of completely representable infinite-dimensional polyadic algebras; it coincides with the class of atomic, completely additive algebras. It is not hard to show that, like atomicity, complete additivity for atomic algebras can indeed be defined in first-order logic as is explained in detail in [15]. Complete additivity of extra Boolean operations defined on atomic algebras is a notion that can be captured in first-order logic; and surprisingly quite simply [15]. It is commonly accepted that the cylindric paradigm and polyadic paradigm belong to different worlds, often exhibiting conflicting behaviour, with the last highlighted by the presence of the operations of substitutions [11] that occur in polyadic jargon under the name of transformation systems.
The elementary closure of the class of completely representable relation and cylindric algebras of dimension greater than 2 has been studied in some depth by Hirsch and Hodkinson. This class is characterized by the so-called Lyndon conditions. For each k, there is a kth Lyndon condition, ρ k , which is a first-order sentence coding a winning strategy in a zero-sum k-rounded Ehrenfeucht-Fraïssé game between two players ∃ and ∀; the ρ k s taken together axiomatize this class. All of the ρ k s are needed for the axiomatization of this class, for it is not finitely axiomatizable.
Fix a finite n > 2. Let CRCA n denote the class of completely representable CA n s and LCA n = ElCRCA n be the class of algebras satisfying the Lyndon conditions. For a class K of Boolean algebras of operators, let K ∩ At denote the class of atomic algebras in K. By modifying the games coding the Lyndon conditions allowing ∀ to reuse the pebble pairs on the board, we will show that LCA n = ElCRCA n = ElS c Nr n CA ω ∩ At. Define A ∈ CA n to be strongly representable if A is atomic and the complex algebra of its atom structure, equivalently its Dedekind-MacNeille completion, in symbols CmAtA is in RCA n . This is a strong form of representability; of course A itself will be in RCA n , because A embeds into CmAtA and RCA n is a variety, a fortiori closed under forming subalgebras. We denote the class of strongly representable atomic algebras of dimension n by SRCA n . Nevertheless, there are atomic simple countable algebras that are representable, but not strongly representable. In fact, we shall see that there is a countable simple atomic algebra in RCA n such that CmAtA / ∈ SNr n CA n+3 (⊃ RCA n ). So in a way some algebras are more representable than others. In fact, the following inclusions are known to hold: CRCA n LCA n SRCA n RCA n ∩ At.
In this paper we delve into a new notion, that of degrees of representability. Not all algebras are representable in the same way or strength. If C ⊆ Nr n D, with D ∈ CA m for some ordinal (possibly infinite) m, we say that D is an m-dilation of C or simply a dilation if m is clear from context. Using this jargon of 'dilating algebras' we say that A ∈ RCA n is strongly representable up to m > n if CmAtA ∈ SNr n CA m . This means that, though A itself is in RCA n , the Dedekind-MacNeille completion of A is not representable, but nevertheless it has some neat embedding property; it is 'close' to being representable. Using this jargon, A admits a dilation of a bigger dimension. The bigger the dimension of the dilation of the representable algebra the more representable the algebra is, the closer it is to being strongly representable. Later in this paper, we will investigate and make precise the notion of an algebra being more representable than another. It is known that LCA n is an elementary class, but SRCA n is not. We shall prove below that Str(ONr n CA n+3 = {F : CmF ∈ ONr n CA n+3 } is not elementary with O ∈ S c , S d , I as defined in the abstract. Layout: After the preliminaries, we show that there exists an atomic, countable and simple A ∈ RCA n , such that its Dedekind-MacNeille completion, namely, the complex algebra of its atom structure, briefly CmAtA, is outside the variety SNr n CA n+3 , cf. Theorem 3.2. For any 2 < n < l < ω, we show there exists an atomic algebra B ∈ Nr n CA l ∩ RCA n , such that its Dedekind-MacNeille completion CmAtB is not representable, cf. Theorem 3.5. We show that there is an atomic algebra E ∈ RCA n such that its Dedekind-MacNeille completion CmAtE is in Nr n CA ω , but the algebra E itself is not even in Nr n CA n+1 , cf. Theorem 3.6. We show that for 2 < n < ω a version of the omitting types fails for L n 'almost everywhere'a notion to be made precise. We show that, for any O ∈ {S c , S d , I}, the class of frames Str(ONr n CA n+3 ) = {F : CmF ∈ ONr n CA n+3 } is not elementary, cf. Theorem 5.5. Our proof constructs a completely representable algebra B and an atomic representable algebra C such that AtB ∈ AtNr n CA ω , CmAtB ∈ Nr n CA ω , B ≡ C and C / ∈ S c Nr n CA n+3 , cf. Theorem 5.4. We relate notions of representablity formulated for atomic algebras such as complete, strong, weak, and satisfying the Lyndon condition, to atomic algebras having special neat embedding properties, cf. Theorems 6.1, 6.3, 6.4.

Preliminaries
We follow the notation of [1] which is in conformity with the notation in the monograph [4]. In particular, for any pair of ordinals α < β, Nr α CA β (⊆ CA α ) denotes the class of α-neat reducts of CA β s. The last class is studied extensively in the chapter [13] of [1] as a key notion in the representation theory of cylindric algebras. Definition 2.1 Assume that α < β are ordinals and B ∈ CA β . Then the α-neat reduct of B, in symbols Nr α B, is the algebra obtained from B by discarding cylindrifiers and diagonal elements whose indices are in β \ α, and restricting the universe to the set It is straightforward to check that Nr α B ∈ CA α . Let α < β be ordinals. If A ∈ CA α and A ⊆ Nr α B, with B ∈ CA β , then we say that A neatly embeds in B, and that B is a β-dilation of A, or simply a dilation of A if β is clear from the context. For K ⊆ CA β , we write Nr α K for the class {Nr α B : B ∈ K}.
Let 2 < n < ω. Following [4], Cs n denotes the class of cylindric set algebras of dimension n, and Gs n denotes the class of generalized cylindric set algebra of dimension n; C ∈ Gs n , if C has a top element V which is a disjoint union of cartesian squares, that is, V = i∈I n U i , I is a non-empty indexing set, U i = ∅ and U i ∩ U j = ∅ for all i = j. The operations of C are defined like in cylindric set algebras of dimension n relativized to V . It is known that IGs n = RCA n = SNr n CA ω = k∈ω SNr n CA n+k . We often identify set algebras with their domain referring to an injection f : A → ℘ (V ) (A ∈ CA n ) as a complete representation of A (via f ) where V is a Gs n unit.

Definition 2.2
An algebra A ∈ CA n is completely representable if there exists C ∈ Gs n , and an isomorphism f : A → C such that, for all X ⊆ A, f ( X ) = x∈X f (x), whenever X exists in A. In this case, we say that A is completely representable via f .
It is known that A is completely representable via f : A → C, where C ∈ Gs n has a top element V if A is atomic and f is atomic in the sense that f ( AtA) = x∈AtA f (x) = V [5]. We denote the class of completely representable CA n s by CRCA n . To define certain deterministic games to be used in the sequel, we recall the notions of atomic networks and atomic games [6,7]. Let i < n. For n-ary sequencesx andȳ if and only ifȳ( j) =x( j) for all j = i.
3 Fix a finite n > 2 and assume that A ∈ CA n is atomic.
(1) An n-dimensional atomic network on A is a map N : n → AtA, where is a non-empty set of nodes, denoted by nodes(N ), satisfying the following consistency conditions for all i < j < n: For n-dimensional atomic networks M and N , , or simply G m k , is the game played on atomic networks of A using m nodes and having k rounds [7, Definition 3.3.2], where ∀ is offered only one move, namely, a cylindrifier move: Suppose that we are at round t > 0. Then ∀ picks a previously played network N t (nodes(N t ) ⊆ m), i < n, a ∈ AtA, x ∈ n nodes(N t ), such that N t (x) ≤ c i a. For her response, ∃ has to deliver a network M such that nodes(M) ⊆ m, M ≡ i N , and there isȳ ∈ n nodes(M) that satisfiesȳ ≡ ix and M(ȳ) = a. We write G k (AtA), or simply G k , for G m The ω-rounded game G m (AtA) or simply G m is like the game G m ω (AtA) except that ∀ has the option to reuse the m nodes in play.
Let 2 < n < m ≤ ω. The notion of an algebra A having signature CA n possessing an m-square representation is defined in detail in [16]. An m-square representation is only locally classic. Given 2 < l < m ≤ ω, an m-square representation is l-square but the converse may fail dramatically. An ω-square representation-the limiting case-is an ordinary representation; such a representation is m-square for each finite m. Roughly, if we zoom in by a movable window to an m-square representation, there will come a point determined by the parameter m, were we mistake this locally classic representation for a genuine ordinary Tarskian one. However, when we zoom out, 'contradictions' reappear. We will return to such issues in some detail in a moment. The following lemma is proved in [17,Lemma 4.6] and [16,Lemma 5.8].
1. If A ∈ CA n is finite and A has an m-square representation, then ∃ has a winning strategy in G m (AtA).

If
A ∈ S c Nr n CA m , then ∀ has a winning strategy in G m (AtA).
In our proof we use a variation on a rainbow construction; in this we follow [5,7]. Fix 2 < n < ω. Given relational structures G (the greens) and R (the reds) the rainbow atom structure of a CA n consists of equivalence classes of surjective maps a : n → , where is a coloured graph. A coloured graph is a complete graph labelled by the rainbow colours, the greens g ∈ G, reds r ∈ R, and whites; and some n − 1 tuples are labelled by 'shades of yellow'. In coloured graphs certain triangles are not allowed, for example, all green triangles are forbidden. A red triple (r i j , r j k , r i * k * ) i, j, j , k , i * , k * ∈ R is not allowed, unless i = i * , j = j and k = k * , in which case we say that the red indices match, cf. [5, 4.3.3]. The equivalence relation relates two such maps if and only if they essentially define the same graph [5, 4.3.4]. We let [a] denote the equivalence class containing a. For 2 < n < ω, we use the graph version of the usual atomic ω-rounded game G m ω (α) with m nodes played on atomic networks of the CA n atom structure α. The game G m (β) where β is a CA n atom structure is like G m ω (AtA) except that ∀ has the option to reuse the m nodes in play. We use the 'graph versions' of these games as defined in [5, 4.3.3]. The (complex) rainbow algebra based on G and R is denoted by A G, R . The dimension n will always be clear from the context.

Degrees of representability
.
Recall that S c denotes the operation of forming complete subalgebras and S d is the operation of forming dense subalgebras. We let I denote the operation of forming isomorphic images. For any class K of BAOs, it is easy to check that IK ⊆ S d K ⊆ S c K. (It is not hard to show that if K is the class of Boolean algebras, that is to say, without extra operations, then the above two inclusions are proper.) (1) An algebra A ∈ CA n has the O neat embedding property up to m if A ∈ ONr n CA m . If m = ω and O = S, we say that A has the neat embedding property. Observe that the last condition is equivalent to A ∈ RCA n . (2) An atomic A ∈ CA n has the complex O neat embedding property up to m if CmAtA ∈ ONr n CA m . The word 'complex' in the present context refers to involving the Dedekind-MacNeille completion obtained by forming the complex algebra of the atom structure in the definition at hand. (3) An atomic algebra A ∈ RCA n is strongly representable up l and m if A ∈ RCA n ∩ Nr n CA l and CmAtA ∈ SNr n CA m . If l = n and m = ω, we say that A is strongly representable.
In our first two main theorems, cf. Theorems 3.2, 3.5, we use a so-called blow up and blur construction. We find it useful to give the gist of the idea to make it easier for the reader, for the idea in essence is really simple and subtle, but may be overshadowed by the details of the specific, otherwise possibly complicated, construction at hand.
The General Idea: The idea of a blow up and blur construction in (more than in) a nutshell is the following. Let 2 < n < ω.
• Assume RCA n ⊆ K ⊆ CA n , and SK = K, that is, K is closed under forming subalgebras.
The purpose is to show that K is not closed under Dedekind-MacNeille completions also known as Monk-minimal completions. • One starts with an atomic algebra C ∈ CA n (usually finite) outside K. Then one blows up and blur C, by splitting some of its atoms each to infinitely many, getting a new infinite atom structure At. In this process a (finite) set of 'blurs' is involved in a way to be clarified in a moment. These blurs do not blur the complex algebra CmAt, in the sense that C is 'there on this global level', C embeds into CmAt.
• Thus, the algebra CmAt will not be in K because C / ∈ K, C ⊆ CmAt and SK = K. The completeness (existence of arbitray joins) of the complex algebra plays a major role, because every splitted atom of C is mapped to the join of its splitted copies which exist in CmAt, because it is complete; the other atoms are mapped to themselves. These precarious joins prohibiting membership in K do not exist in the term algebra TmAt, the subalgebra of CmAt generated by the atoms, because it is not complete; only joins of finite or cofinite subsets of the atoms do, so that now 'blurs' blur C on the level of the term algebra; more succintly, C does not embed in TmAt.
• In fact, it can (and will be) be arranged that TmAt will not only be in K, but actually it will be in (the possibly smaller) class RCA n . This is where the blurs play another crucial role. Basically including essentially non-principal ultrafilters, the blurs, together with the principal ultrafilters generated by the atoms in At will be used as colours to represent TmAtA as an algebra of genuine n-ary relations with concrete set-theoretic operations. In the process of representation, one cannot use only principal ultrafilters, because TmAt cannot be completely representable; for else this would induce a representation of CmAtA. • Using the blurs one can actually completely represent (TmAt) + , the canonical extension of TmAt. Concluding, we get an atom structure At that is only weakly representable, that is to say, TmAt ∈ RCA n , but not strongly representable, that is to say, CmAt / ∈ RCA n .
Let us get more concrete by giving some specific examples to this subtle construction that proves highly efficient in proving non-atom canonicity. Theorem 3.2 If 2 < n < ω, then there exists an atomic, countable and simple A ∈ RCA n (i.e., A has the neat embedding property), but A does not have the complex S neat embedding property up to m for any m ≥ n + 3.

Proof
The proof is divided into four parts: 1. Blowing up and blurring a finite rainbow algebra forming a weakly representable atom structure At. Take the finite rainbow CA n , A n+1,n where the reds R is the complete irreflexive graph n, and the greens are {g i : 1 ≤ i < n −1}∪{g i 0 : 1 ≤ i ≤ n +1}. We will show A n+1,n detects that RCA n is not atom-canonical with respect to SNr n CA n+3 . Denote the finite atom structure of A n+1,n by At f ; so At f = At(A n+1,n ). One then replaces the red colours of the finite rainbow algebra of A n+1,n each by infinitely many reds (getting their superscripts from ω), obtaining this way a weakly representable atom structure At. The cylindric reduct of the resulting atom structure after 'splitting the reds', namely, At, is like the weakly (but not strongly) representable atom structure of the atomic, countable and simple algebra A as defined in [9, Definition 4.1]; the sole difference is that we have n + 1 greens and not ω many as is the case in [9]. One then defines a larger class of coloured graphs like in [9, Definition 2.5]. Let 2 < n < ω. Then the colours used are like above except that each red is 'split' into ω many 'copies' of the form r l i j with i < j < n and l ∈ ω, with an additional shade of red ρ such that the consistency conditions for the new reds (in addition to the usual rainbow consistency conditions) are as follows: • (r, ρ, ρ) and (r, r * , ρ), where r, r * are any reds.
The consistency conditions can be coded in an L ω,ω theory T having signature the reds with ρ together with all other colours like in [7, Definition 3.6.9]. The theory T is only a first-order theory (not an L ω 1 ,ω theory) because the number of greens is finite which is not the case with [7] where the number of available greens are countably infinite coded by an infinite disjunction. One can construct an n-homogeneous model M that is a countable limit of finite models of T using a game played between ∃ and ∀ like in [9,Theorem 2.16]. In the rainbow game ∀ challenges ∃ with cones having green tints (g i 0 ), and ∃ wins if she can respond to such moves. This is the only way that ∀ can force a win. ∃ has to respond by labelling apexes of two succesive cones having the same base played by ∀. By the rules of the game, she has to use a red label. She resorts to ρ whenever she is forced a red while using the rainbow reds will lead to an inconsistent triangle of reds; [9, Proposition 2.6, Lemma 2.7]. The number of greens make [9, Lemma 3.10] work with the same proof using only finitely many green and not infinitely many. The winning strategy implemented by ∃ using the red label ρ that comes to her rescue whenever she runs out of 'rainbow reds', so she can always and consistently respond with an extended coloured graph.
We denote the resulting term CA n , TmAt by Bb(A n+1,n , r, ω), a shorthand for blowing up and blurring A n+1,n by splitting each red graph (atom) into ω many. It can be shown exactly like in [9] that ∃ can win the rainbow ω-rounded game and build an n-homogeneous model M by using a shade of red ρ outside the rainbow signature, when she is forced a red; [9, Proposition 2.6, Lemma 2.7]. The n-homogeneity entails that any subgraph (substructure) of M of size at most n is independent of its location in M; it is uniquely determined by its isomorphism type.
In the present context, after the splitting 'the finitely many red colours' replacing each such red colour r kl , k < l < n by ω many r i kl , i ∈ ω, the rainbow signature for the resulting rainbow theory as defined in [6, Definition 3.6.9] call this theory T ra , consists of g i : 1 ≤ i < n − 1, ∈ ω, binary relations, and (n − 1)-ary relations y S , S ⊆ ω n + k − 2 or S = n + 1. The set algebra Bb(A n+1,n , r, ω) of dimension n has base an n-homogeneous model M of another theory T whose signature expands that of T ra by an additional binary relation (a shade of red) ρ. In this new signature T is obtained from T ra by some axioms (consistency conditions) extending T ra . Such axioms (consistency conditions) specify consistent triples involving ρ. We call the models of T extended coloured graphs. In particular, M is an extended coloured graph.
To build M, the class of coloured graphs is considered in the signature L ∪ {ρ} like in usual rainbow constructions as given above with the two additional forbidden triples (r, ρ, ρ) and (r, r * , ρ), where r, r * are any reds. Let GG be the class of all models of this extended rainbow first-order theory. The extra shade of red ρ will be used as a label. This model M is constructed as a countable limit of finite models of T using a game played between ∃ and ∀. Here, unlike the extended L ω 1 ,ω theory dealt with in [9], T is a first-order one because the number of greens used is finite.
In the rainbow game [5,6] ∀ challenges ∃ with cones having green tints (g i 0 ), and ∃ wins if she can respond to such moves. This is the only way that ∀ can force a win. ∃ has to respond by labelling apexes of two successive cones having the same base played by ∀. By the rules of the game, she has to use a red label. She resorts to ρ whenever she is forced a red while using the rainbow reds will lead to an inconsitent triangle of reds; [9, Proposition 2.6, Lemma 2.7]. The winning strategy is implemented by ∃ using the red label ρ that comes to her rescue whenever she runs out of 'rainbow reds', so she can always and consistently respond with an extended coloured graph.

Representing a term algebra (and its completion) as (generalized) set algebras.
Having M at hand, one constructs two atomic n-dimensional set algebras based on M sharing the same atom structure and having the same top element. The atoms of each will be the set of coloured graphs, see [9]; such coloured graphs are 'literally indivisible'. Now L n and L n ∞,ω are taken in the rainbow signature (without ρ). Continuing like in op. cit., deleting the one available red shade, set W = {ā ∈ n M : M | ( i< j<n ¬ρ(x i , x j ))(ā)}, Here W is the set of all n-ary assignments in n M, that have no edge labelled by ρ and | W is first-order semantics with quantifiers relativized to W , cf. [9, §3.2 and Definition 4.1]. We note that ρ is used by ∃ infinitely many times during the game forming a 'red clique' in M [9].
Let A be the relativized set algebra with domain {ϕ W : ϕ a first-order L n -formula} and unit W endowed with the usual concrete cylindric operations read off the connectives. Classical semantics for L n rainbow formulas and their semantics by relativizing to W coincide [9, Proposition 3.13] but not with respect to L n ∞,ω rainbow formulas. Hence the set algebra A is isomorphic to a cylindric set algebra of dimension n having top element n M, so A is simple, in fact, its Df reduct is simple.
Let E = {φ W : φ ∈ L n ∞,ω } [9, Definition 4.1] with the operations defined like on A in the usual way. CmAt is a complete CA n and so, like in [9, Lemma 5.3], we have an isomorphism from CmAt to E defined by X → X . Since AtA = AtTm(AtA), which we refer to only by At, and TmAtA ⊆ A, TmAtA = TmAt is representable. The atoms of A, TmAtA and CmAtA = CmAt are the coloured graphs whose edges are not labelled by ρ. These atoms are uniquely determined by the interpretion in M of so-called MCA formulas in the rainbow signature of At as in [9,Definition 4 3. Embedding A n+1,n into Cm(At). Let CRG f be the class of coloured graphs on At f and CRG be the class of coloured graphs on At. We can (and will) assume that CRG f ⊆ CRG.
Write M a for the atom that is the (equivalence class of the) surjection a : n → M, M ∈ CGR. Here we identify a with [a]; no harm will ensue. We define the (equivalence) We say that M a is a copy of N b if M a ∼ N b (by symmetry, N b is a copy of M a .) Indeed, the relation 'copy of' is an equivalence relation on At. An atom M a is called a red atom, if M a has at least one red edge. Any red atom has ω many copies, that are cylindrically equivalent, in the sense that if N a ∼ M b with one (equivalently both) red, with a : n → N and b : n → M, then we can assume that nodes(N ) = nodes(M) and that for all i < n, a n ∼ {i} = b n ∼ {i}. In CmAt, we write M a for {M a } and we denote suprema taken in CmAt, possibly finite, by . Define the map from A n+1,n = CmAt f to CmAt, by specifing first its values on a is a copy of M a . So each atom maps to the suprema of its copies.
This map is well defined because CmAt is complete. We check that is an injective homomorphim. Injectivity is easy. We check the preservation of all the CA n extra Boolean operations.
• Diagonal elements. If l < k < n, then • Cylindrifiers. Let i < n. By the additivity of cylindrifiers, we restrict our attention to atoms M a ∈ At f with a : n → M, and M ∈ CRG f ⊆ CRG. Then (c 4. ∀ has a winning strategy in G n+3 At(A n+1,n ); and the required result. It is straightforward to show that ∀ has a winning strategy first in the Ehrenfeucht-Fraïssé forth private game played between ∃ and ∀ on the complete irreflexive graphs n(n − 1)/2 + 2) and n in n(n − 1)/2 + 2 rounds EF n(n−1)2+2 n(n−1)+2 (n + 1, n) [7, Definition 16.2] since n(n − 1)/2 + 2 is 'longer' than n. Using (any) p > n many pairs of pebbles available on the board ∀ can win this game in n + 1 many rounds. For brevity let D = A n+1,n . Now ∀ lifts his winning strategy from the last private Ehrenfeucht-Fraïssé forth game to the graph game on At f = At(D) [5, p. 841] forcing a win using n + 3 nodes, i.e., in the graph game ∀ needs two exra nodes by the rainbow theorem [6]. By Lemma 2.4, D / ∈ S c Nr n CA n+3 when 2 < n < ω. Since D is finite, D / ∈ SNr n CA n+3 , because D coincides with its canonical extension and for any D ∈ CA n , D ∈ SNr n CA m implies D + ∈ S c Nr n CA m . But D embeds into CmAtA, hence CmAtA is outside the variety SNr n CA n+3 as well.
The following definition, to be used in the sequel, is taken from [2]: Definition 3.1] Let R be a relation algebra with non-identity atoms I and 2 < n < ω. Assume that J ⊆ ℘ (I ) and E ⊆ 3 ω. We say that (J , E) is a strong n-blur for R if (J , E) is an n-blur of R in the sense of [2, Definition 3.1], that is to say, J is a complex n-blur and E is an index blur such that the complex n-blur satisfies The following definition will be used frequently. We will first encounter it in the second item of Theorem 4.4. We use the notation in [2]. 1. We say that (J , E) is an n-blur for R if J is a complex n-blur defined as follows: (1) each element of J is non-empty, and the tenary relation E is an index blur defined as in item (ii) of [2, Definition 3.1]. 2. We say that (J , E) is a strong n-blur, if it (J , E) is an n-blur such that the complex n-blur satisfies (4) s : Theorem 3.5 For any 2 < n < l < ω, there is an atomic algebra B ∈ Nr n CA l ∩ RCA n such that B is not strongly representable up to l and ω. In particular, CmAtB / ∈ RCA n , B is not completely representable, a fortiori B is not strongly representable.
Proof Let 2 < n < m ≤ ω. First we prove the conditionally the non-atom canonicity of SNr n CA m depending on the existence of certain finite relation algebras R with strong m blursatisfying a condition that we highlight as we go along. We use the flexible blow up and blur construction used in [2]. The idea is to use R in place of the finite Maddux algebras denoted by E k (2, 3) on [2, p. 83]. Here k(< ω) is the number of non-identity atoms and then take it from there to reach the conditions, we move backwards if you like. The required algebra witnessing non-atom canonicity will be obtained by blowing up and blurring R in place of the relation algebra E k (2, 3) [2].
Our exposition addresses an (abstract) finite relation algebra R having an l-blur in the sense of definition [2, Definition 3.1], with 3 ≤ l ≤ k < ω and k depending on l. Occasionally we use the concrete Maddux algebra E k (2, 3) to make certain concepts more tangible. We use the notation in [2]. Let 2 < n ≤ l < ω. One starts with a finite relation algebra R that has only representations, if any, on finite sets (bases), having an l-blur (J , E) as in [2, Definition 3.1] recalled in Definition 3.4. After blowing up and bluring R, by splitting each of its atoms into infinitely many, one gets an infinite atomic representable relation algebra Bb(R, J , E) [2, p. 73], whose atom structure At is weakly but not strongly representable. The atom structure At is not strongly representable, because R is not blurred in CmAt. The finite relation algebra R embeds into CmAt, so that a representation of CmAt, necessarily on an infinite base, induces one of R on the same base, which is impossible. The representability of Bb(R, J , E) depend on the properties of the l-blur, which blurs R in Bb(R, J , E). The set of blurs here, namely J , is finite. In the case of E k (2, 3) used in [2], the set of blurs is the set of all subsets of non-identity atoms having the same size l < ω, where k = f (l) ≥ l for some recursive function f from ω → ω, so that k depends recursively on l.
One (but not the only) way to define the index blur E ⊆ 3 ω is as follows [14, Theorem 3.1.1]: E(i, j, k) if (∃ p, q, r )({ p, q, r } = {i, j, k} and r − q = q − p. This is a concrete instance of an index blur as defined in [2, Definition 3.1(iii)] (recalled in Definition 3.4 above), but defined uniformly, it does not depend on the blurs. The underlying set of At, the atom structure of Bb(R, J , E) is the following set consisting of triplets: More generally, for the R as postulated in the hypothesis, composition in At is defined as follows. First the index blur E can be taken to be like above. Now the triple ((i, P, S), ( j, Q, Z ), (k, R, W )) in which no two entries are equal, is consistent if either S, Z , W are safe, briefly safe(S, Z , W ), witness item (4) in Definition 3.4 (which vacuously holds if S ∩ Z ∩ W = ∅), or E(i, j, k) and P; Q ≤ R in R. This generalizes the above definition of composition, because in E k (2,3), the triple of non-identity atoms (P, Q, R) is consistent ⇐⇒ they do not have the same colour ⇐⇒ |{ P, Q, R}| = 1. Having specified its atom structure, its timely to specfiy the relation algebra Bb(R, J , E) ⊆ CmAt. The relation algebra Bb(R, J , E) is TmAt (the term algebra). Its universe is the set denotes the set of co-finite subsets of E W , that is subsets of E W whose complement is infinite, with E W as defined above. The relation algebra operations are lifted from At in the usual way. The algebra Bb(R, J , E) is proved to be representable in [2].
For brevity, denote Bb(R, J , E) by R, and its domain by R. For a ∈ At, and W ∈ J , set U a = {X ∈ R : a ∈ X } and U W = {X ∈ R : |X ∩ E W | ≥ ω}. Then the principal ultrafilters of R are exactly U a , a ∈ H and U W are non-principal ultrafilters for Uf is the set of ultrafilters of R which is used as colours to represent R, cf. [2, pp. 75-77]. The representation is built from coloured graphs whose edges are labelled by elements in Uf in a fairly standard step-by-step construction. The step-by-step construction builds in the way coloured graphs, which are basically networks whose edges are labelled by ultrafilters, with non-principal ultrafilters allowed. So such coloured graphs are networks that are not atomic because not only principal ultrafilters are allowed as labels. Furthermore, we cannot restrict our attension to only atomic networks because we do not want Bb(R, J , E) to be strongly representable, least completely representable. The 'limit' of a sequence of atomic networks constructed in a step-by-step manner, or obtained via winning strategy for ∃ in an ω-rounded atomic game, will necessarily produce a complete representation of Bb(R, J , E). But the required representation will be extracted from a complete representation of the canonical extension of Bb(R, J , E). Nothing wrong with that. A relation algebra R is representable if and only if its canonical extension is representable. A complete representation of the canonical extension of R induces a representation of R, because R embeds into its a canonical extension, but the converse is not necessarily true. So here we are proving more than the mere representablity of Bb(R, J , E), because we are constructing a complete representation of its canonical extension, namely, the algebra CmUf, where Uf is the atom structure having domain Uf, with Uf as defined above. Now we show why the Dedekind-MacNeille completion CmAt is not representable. For P ∈ I , let H P = {(i, P, W ) : i ∈ ω, W ∈ J , P ∈ W }. Let P 1 = {H P : P ∈ I } and P 2 = {E W : W ∈ J }. These are two partitions of At. The partition P 2 was used to represent, Bb(R, J , E) in the sense that the ternary relation corresponding to composition was defined on At in a such a way that the singletons generate the partition (E W : W ∈ J ) up to "finite deviations." The partition P 1 will now be used to show that Cm(Bb(R, J , E)) = Cm(At) is not representable. This follows by observing that composition restricted to P 1 satisfies H P ; H Q = {H Z : Z ; P ≤ Q in R}, which means that R embeds into the complex algebra CmAt prohibiting its representability, because R allows only representations having a finite base.
The construction lifts to higher dimensions expressed in CA n s, 2 < n < ω. Because (J , E) is an l-blur, then by [2, Theorem 3.2 9(iii)], At ca = Mat l (AtBb(R, J , E)), the set of l by l basic matrices on At is an l-dimensional cylindric basis, giving an algebra B l = Bb l (R, J , E) ∈ RCA l . Again At ca is not strongly representable, for had it been, then a representation of CmAt ca induces a representation of R on an infinite base, because RaCmAt ca ⊇ CmAt ⊇ R, and the representability of CmAt ca induces one of RaCmAt ca , necessarily having an infinite base. For 2 < n ≤ l < ω, denote by C l the non-representable Dedekind-MacNeille completion of the algebra Bb l (R, J , E) ∈ RCA l , that is C l = CmAt(Bb l (R, J , E)) = CmMat l (At). If the l-blur happens to be strong, in the sense of Definition 3.4 and n ≤ m ≤ l, then we get by [2, item (3) . This is proved by defining an embedding h : Rd m C l → C m via x → {M m : M ∈ x} and showing that h Nr m C l is an isomorphism onto C m [2, p.80]. Surjectiveness uses the condition (J 5) l formulated in the second item of definition 3.4 of strong l-blurness. Without this condition, that is if the l-blur (J , E) is not strong, then still C m and C l can be defined because by definition (J , E) is a t-blur for all m ≤ t ≤ l, so Mat t (At) is a cylindric basis and for t < l C t embeds into Nr m C l using the same map as above, but this embedding might not be surjective. So, for every l, now replacing R by the Maddux algebra E f (l) (2,3), the algebra A l = Nr n Bb l (E f (l) (2,3)), J , E), with f (l) depending recursively on l, having strong l-blur due to the properties of the Maddux algebra E f (l) (2,3), is as required. In other words, and more concisely, we have A l ∈ RCA n ∩ Nr n CA l , but CmAtA l / ∈ RCA n .
The flexibility of the construction in op. cit. allows one to refine the main result in [2] by varying the relation algebra R. All we need for the construction to work is that R is finite having a (strong) l-blur with n ≤ l < ω. So one can get sharper results if one requires for example that R has no infinite k-dimensional hyperbasis with n ≤ l < k ≤ ω, k possibly finite, equivalently, R does not have a k-flat infinite representation. The equivalence here is due to the fact that R is finite. It cannot be the case that l ≥ k (k ∈ ω), for else A = Bb n (R, J , E) ∼ = Nr n Bb l (R, J , E), and Bb l (R, J , E) is atomic (and finite-dimensional), so by Lemma 4.2, A will have a complete l, hence a complete k-flat representation, which is impossible because R does not have an infinite k-flat representation. Such requirements lead to negative results on atom-canonicity completely analogous to the result proved in the previous two subitems (a) and (b) of the present item, and possibly more of this kind.

Theorem 3.6
There is an algebra E ∈ RCA n that has the complex I neat embedding property up to m for any m ≥ n but does not have the I neat embedding property up to n + 1, a fortiori the atomic algebra E has the complex neat embedding property up to m ≥ n + 1, but does not have the I neat embedding property for any m ≥ n + 1.
Let α be any ordinal and let F be field of characteristic 0. Let V = {s ∈ α F : |{i ∈ α : s i = 0}| < ω}. Note that V is a vector space over the field F. Let Let y denote the following α-ary relation: For each s ∈ y we let y s be the singleton containing s, i.e., y s = {s}. Let Clearly E and A are in RCA α . We first show that w / ∈ E, then we show that if E ∈ Nr n CA α+1 then w ∈ E concluding that E / ∈ Nr α CA α+1 . Let and It is easy to see that {y, y s : s ∈ y} ⊆ G * * , and G * * is a Boolean field of sets. We prove that w / ∈ G * * and that G * * is closed under cylindrifications. To this end, we set L = {p ∈ Pl < : c 0 p = p} and P(0) = L ∪ {d 01 }.
We have G 1 ∩ G 2 = ∅. Now let It is easy to see that To prove w / ∈ G * * we need the following fact: If g ∈ G 3 and 0 = g, then g ⊂ w. We prove this as follows. Assume g = p 1 ∩ p 2 ∩ · · · ∩ p k say with p i ∈ G and p i / ∈ ({y} ∪ P(0)) for 1 ≤ i ≤ k, and let z ∈ g. Let [] be the function from Pl into F defined as follows: be arbitrary, and let Here we are using that when c ( ) {0} ∈ G, then 0 ∈ .) We now proceed to show that w / ∈ G * * . Assume But it can be seen by implementing easy linear-algebraic arguments that, for every n ∈ ω, and for every system of equations, such that for all j ≤ n, there exists i < α, such that r ji = 0 and r j0 = 0, the equation has a solution s in the weak space α F (0) such that s is not a solution of for every j ≤ n. We have proved that w / ∈ G * * . To show w / ∈ A, we will show that G * * is closed under the cylindric operations (i.e., it is the universe of a CA α . It is enough to show (since the c i 's are additive), that for j ∈ α and g ∈ G * arbitrary, we have c j g ∈ G * * . For this purpose, put for every p ∈ Pl Then it is not hard to see that and so p( j|0) ∈ Pl < for every p ∈ Pl.
Let j and g be as indicated above. We can assume We distinguish between 2 cases: Now for every p, q ∈ Pl, there are p , q , p and q ∈ Pl < such that We have proved that w / ∈ E. Now we restrict α > 1 to be finite and according to the widespread custom of naming ordinals, we call it n. Let B be the full set algebra with unit V = n Q. It is straightforwrad to show that AtB = AtE = {{s} : s ∈ V }, that is to say, the atoms of both algebras coincide with the singletons. Clearly CmAtE = B, so that infcat B is the Dedekind-MacNeille completion of E. Since B is a full set algebra having top element n Q and universe ℘ ( n Q), A ∈ Nr n CA ω . So E is an algebra that has the complex I neat embedding propery up to ω, but E does not have the neat embeding property up to n + 1, since E / ∈ Nr n CA n+1 . n,l ) ⇒ SNr n CA k is not atom-canonical for all k ≥ l. In particular, SNr n CA k is not atom-canonical for all k ≥ n + 3. 5. If SNr n CA l is atom-canonical, then RCA S n,l is first-order definable. There exists a finite k > n + 1, such that RCA S n,k is not first-order definable. 6. Let 2 < n < l ≤ ω. Then RCA l,ω n ∩ Count = ∅ ⇐⇒ l < ω.
Proof 1. The inclusions in the first item holds by definiton. To show the strictness of the last inclusion, use (1) of Lemma 5.4.
ONr n CA l . This proves the first part. The strictness of the last inclusion follows from Theorem 3.2, since the atomic countable algebra A constructed in op. cit. is in RCA n , but CmAtA / ∈ SNr n CA l for any l ≥ n + 3. For the last non-inclusion in item (2), we use the set algebras A and E in Theorem 3.6. 3. This follows by definition observing that if A is finite then A = CmAtA. The strictness of the first inclusion follows from the construction in [8] where it is shown that, for any positive k, there is a finite algebra A in Nr n CA n+k ∼ SNr n CA n+k+1 . The inclusion CNPCA O n,ω ⊆ RCA n holds because if B ∈ CNPCA O n,ω , then B ⊆ CmAtB ∈ ONr n CA ω ⊆ RCA n . The A used in the last item of Theorem 3.2 witnesses the strictness of the last inclusion proving the last statement in this item. 4. It follows from the definition and the construction used in Theorem 3.2. 5. It follows from the fact that SNr n CA l is canonical. So if it is atom-canonical too, then At(SNr n CA l ) = {F : CmF ∈ SNr n CA l }, the former class is elementary [6, Theorem 2.84], and the last class is elementray ⇐⇒ RCA S n,l is elementary. Non-elementarity follows from [7,Corollary 3.7.2] where it is proved that RCA S n,ω is not elementary, together with the fact that n<k<ω SNr n CA k = RCA n . In more detail, let A i be the sequence of strongly representable CA n s with CmAtA i = A i and A = i/U A i is not strongly representable. Hence CmAtA / ∈ SNr n CA ω = i∈ω SNr n CA n+i , so CmAtA / ∈ SNr n K l for all l > k, for some k ∈ ω, k > n. But for each such l, A i ∈ SNr n CA l (⊇ RCA n ), so A i is a sequence of algebras such that CmAtA i = A i ∈ SNr n CA l , but Cm(At( i/U A i )) = CmAtA / ∈ SNr n CA l , for all l ≥ k. That k has to be strictly greater than n + 1 follows because SNr n CA n+1 is atom-canonical. 6. ⇐ : Let l < ω. Then the required statement follows from the second part of Theorem 3.2 proving (l, ω); namely, there exists a countable A ∈ Nr n CA l ∩ RCA n such that CmAtA / ∈ RCA n . Now we prove ⇒ : Suppose to the contrary that there is an A ∈ RCA ω,ω n ∩ Count. Then, by definition, A ∈ Nr n CA ω so A ∈ CRCA n . But this complete representation induces a(n ordinary) representation of CmAtA which is a contradiction.

Clique-guarded semantics
Fix 2 < n < ω. The reader is referred to [6,Definitions 13.4,13.6] for the notions of m-flat and m-square representations for relation algebras (m > 2) to be generalized next to CA n s. Then an n-clique is a set C ⊆ M such that (a 1 , . . . , a n−1 ) ∈ V = 1 M for distinct a 1 , . . . , a n ∈ C. Let    (6) and (7)]. The inverse implication from dilations to representations is harder. One constructs from the given m-dilation an m-dimensional hyperbasis (that can be defined similarly to the RA case, cf.

Omitting types OTT r for the clique guarded fragments
Fix 2 < n ≤ l < m ≤ ω. Consider the following statement (l, m): There exists a countable, complete and atomic L n theory T (meaning that the Tarski-Lindenbuam qoutient algebra Fm T is atomic), such that the type consisting of co-atoms of Fm T is realizable in every m-square model of T (m-representation of Fm T ) but cannot be be isolated using l variables.
Let OTT r (l, m) be by definition ¬ (l, m), short for a restricted version of the Omitting Types Theorem holds at the parameters l and m, where by definition, we stipulate that OTT r (ω, ω) is just the consequence of the Omitting Types Theorem for L ω,ω , that says that a countable atomic theory T has a countbale atomic (prime) model. This atomic (unique up to isomorphism) model of T is the model resulting by omitting the countably many nonprincipal types (X i : i ∈ ω), where X i is the set of co-atoms of Nr i Fm T . These are indeed non-principal because by definition ]Nr i Fm T is an atomic Boolean algebra, since T is an atomic theory. Furthermore, if T is complete, then Nr i Fm T is also a simple CA i for each i < ω; i.e., Nr i Fm T has no proper ideals (congruences).
For 2 < n ≤ l < m ≤ ω and l = m = ω, we investigate the plausability of the following statement which we abbreviate by (**): In other words: OTT r holds only in the limiting case when l → ∞ and m = ω and not 'before'. This will be proved on the 'paths' (l, ω), n ≤ l < ω (x axis) and (n, n + k), k ≥ n + 3 (y axis) using two different blow up and blur constructions, given in Theorems 3.2 and 3.5 .
Let n < ω. Then D n (G n ) is a class of (non-commutative) set algebras having the same signature as CA n . If A ∈ D n (G n ), then the top element of A is a set V ⊆ n U (some non-empty set U ), such that if s ∈ V , and i < j < n (τ : n → n), then s • [i| j](s • τ ) ∈ V . It is known that both D n and G n are finitely axiomatizable varieties [16], such that Gs n ⊆ G n ⊆ D n . It can be proved similarly to Theorem 4.2, that if A satisfies all the CA n axioms with the possible exception of commutativity of cylindrifiers, then for any 2 < n < m < ω, A ∈ SNr n D m ⇐⇒ A ∈ SNr n G m ⇐⇒ A has an m-square representation.
In the next theorem several conditions are given implying (l, m) f for various values of the parameters l and m, where (l, m) f is the formula obtained from (l, m) by replacing square by flat. In the first item of the next theorem by no infinite ω-dimensional hyperbasis (basis), we understand no representation on an infinite base. By an ω-flat (square) representation we mean an ordinary representation, and by a complete ω-flat (square) representation we mean a complete representation. 1 We need a lemma before embarking on the proof of the theorem.

Lemma 4.3 Let R be a relation algebra and 3 < n < ω. Then R + has an n-dimensional infinite relational (hyper)basis if and only if R has an infinite n-square (flat) representation. R + has an n-dimensional infinite hyperbasis if and only if R has an infinite n-flat representation.
Proof [6,Theorem 13.46, the equivalence (1) ⇐⇒ (5) for relational basis, and the equivalence (7) ⇐⇒ (11) for hyperbasis].

Proof (1) ⇒ (2):
We proceed similarly to Theorem 3.5. Let R be as in the hypothesis with strong l-blur (J , E). The idea is to 'blow up and blur' R in place of the Maddux algebra E k (2, 3) blown up and blurred in [2, Lemma 5.1], where k < ω is the number of non-identity atoms and k depends recursively on l, giving the desired strong l-blurness, cf. [2, Lemmata 4.2, 4.3]. Let 2 < n ≤ l < ω. The relation algebra R is blown up by splitting all of the atoms each to infinitely many giving a new infinite atom structure At denoted in [2, p. 73] by At. One proves that the blown up and blurred atomic relation algebra Bb(R, J , E) (as defined in [2]) with atom structure At is representable; in fact this representation is induced by a complete representation of its canonical extension, cf. [2, Item (1) of Theorem 3.2]. Because (J , E) is a strong l-blur, then, by its definition, it is a strong j-blur for all n ≤ j ≤ l, so the atom structure At has a j-dimensional cylindric basis for all n ≤ j ≤ l, namely, Mat j (At). For all such j, there is an RCA j denoted in [2, Top of p. 9] by Bb j (R, J , E) such that TmMat j (At) ⊆ Bb j (R, J , E) ⊆ CmMat j (At) and AtBb j (R, J , E) is a weakly representable atom structure of dimension j, cf. [2,Lemma 4.3]. Now take A = Bb n (R, J , E). We claim that A is as required. Since R has a strong j-blur (J , E) for all n ≤ j ≤ l, then A ∼ = Nr n Bb j (R, J , E) for all n ≤ j ≤ l as proved in Nr n CA m which is impossible. But A ∈ Nr n CA l , so using the same (terminology and) argument as in [2, Theorem 3.1] we get that any witness isolating needs more than l-variables. In more detail, suppose to the contrary that φ is an l witness, so that T | φ → α, for all α ∈ , where recall that is the set of coatoms. Then since A is simple, we can assume without loss of generality that A is a set algebra with base M, say. Let M = (M, R i ) i∈ω be the corresponding model (in a relational signature) to this set algebra in the sense of [4, §4.3]. Let φ M denote the set of all assignments satisfying φ in M. We have M | T and φ M ∈ A, because A ∈ Nr n CA m−1 . But T | ∃xφ, hence φ M = 0, from which it follows that φ M must intersect an atom α ∈ A (recall that the latter is atomic). Let ψ be the formula, such that ψ M = α. Then it cannot be the case that T | φ → ¬ψ, hence φ is not a witness, a contradiction and we are done. We have proved (l, m). The rest follows from the definitions.
For squareness the proofs are essentially the same undergoing the obvious modifications (e.g., using the part on squareness in Lemma 4.3 and repacing CA n by D n ). In the first implication 'infinite' in the hypothesis is not needed because any finite relation algebra having an infinite m-dimensional relational basis has a finite one, cf. [  For the second case, it suffices by Theorem 4.4 (by taking m = ω) to find a countable algebra C ∈ Nr n CA l ∩ RCA n such that CmAtC / ∈ RCA n . This algebra is constructed in [2], cf. Theorem 3.5.
It is time that we tie a few threads together. Definition 4.6 Let 2 < n < ω. We say that VT fails for L n almost everywhere if there exist positive l, m ≥ n such that V(k, ω) and V(n, t) are false for all finite k ≥ l and all t ≥ m. We say that VT fails for L n everywhere if for 3 ≤ l < m ≤ ω and l = m = ω, V(l, m) holds if and only if l = m = ω, that is to say, ( * * ) above holds. Now we formulate an algebraic result implying that VT fails for any finite first-order definable expansion of L n as defined in [3]. We deviate from the notation in [3] by writing RCA + n for a first-order definable expansion of RCA n .
Theorem 4.8 Let 2 < n < ω. Let RCA + n be a first-order definable expansion of RCA n such that the non-cylindric operations are first-order definable by formulas using only finitely many variables l > n. If RCA + n is completely additive, then it is not atom-canonical.
Proof Let n be the finite number of variables occuring in the first-order formulas defining the new connectives and let l = n+1. Let A be countable and atomic such that A ∈ RCA n ∩Nr n CA l and A has no complete representation; such an A exists, cf. Theorem 3.5. Without loss, we can assume that we have only one extra operation f definable by a first-order formula φ, say, using n < k < ω variables with at most n free variables. Now φ defines a CA k term τ (φ) which, in turn, defines the unary operation f on A, via f (a) = τ (φ) B (a). This is well defined in the sense that f (a) ∈ A, because A ∈ Nr n CA n+1 and the first-order formula φ defining f has at most n free variables. Call the expanded structure A * (∈ RCA + n ). By complete additivity, CmAtA * is the Dedekind-MacNeille completion of A * . But Rd ca CmAtA * = CmAtA / ∈ RCA n , a fortiori, Cm(AtA * ) / ∈ RCA + n , and we are done.
In VT(l, m), while the parameter l measures how close we are to L ω,ω , m measures the 'degree' of squareness of permitted models. One can view lim l→∞ VT(l, ω) = VT(ω, ω) algebraically using ultraproducts as follows. Fix 2 < n < ω. For each 2 < n ≤ l < ω, let R l be the finite Maddux algebra E f (l) (2,3) with strong l-blur (J l , E l ) and f (l) ≥ l as specified in [2, Lemma 5.1] (denoted by k therein). Let R l = Bb(R l , J l , E l ) ∈ RRA and let A l = Nr n Bb l (R l , J l , E l ) ∈ RCA n . Then (AtR l : l ∈ ω ∼ n), and (AtA l : l ∈ ω ∼ n) are sequences of weakly representable atom structures that are not strongly representable with a completely representable ultraproduct. We immediately get Corollary 4.9 Assume 2 < n < ω. Then the following hold:

The (elementary) class LCA n of algebras satisfying the Lyndon conditions (which is
ElCRCA n ) is not finitely axiomatizable. 2. [3,10] The set of equations using only one variable that holds in each of the varieties RCA n and RRA, together with any finite first-order definable expansion of each, cannot be derived from any finite set of equations valid in the variety.

Non-elementary classes of algebras having a neat embedding property
We define an atomic k rounded (atomic) game H k stronger than the usual k-rounded (atomic) game G k [6,7]. To define the game we need a few definitions: Definition 5.1 A λ-neat hypernetwork is roughly a network endowed with labelled hyperdeges of length different from n allowed to get arbitrarily long but with finite length, and such hyperedges get their labels from a non-empty set of labels , such that all so-called short hyperedges are constantly labelled by λ ∈ . The board of the game consists of λ-neat hypernetworks: (some arbitrary set of hyperlabels ) such that forx,ȳ ∈ <ω nodes(N ) ifx ∼ȳ ⇒ N h (x) = N h (ȳ). If |x| = k ∈ N and N h (x) = λ, then we say that λ is a k-ary hyperlabel.x is referred to as a k-ary hyperedge, or simply a hyperedge.
We may remove the superscripts a and h if no confusion is likely to ensue. A hyperedgex ∈ <ω nodes(N ) is short if there are y 0 , . . . , y n−1 that are nodes in N such that N (x i , y 0 ,z) ≤ d 01 or . . . or N (x i , y n−1 ,z) ≤ d 01 for all i < |x| for some (equivalently for all)z. Otherwise, it is called long.
This game involves, besides the standard cylindrifier move, two new amalgamation moves. This game has k rounds with k ≤ ω, call it H k . Concerning his moves, ∀ can play a cylindrifier move like before but now played on λneat hypernetworks (λ a constant label). Also ∀ can play a transformation move by picking a previously played λ neat hypernetwork N and a partial, finite surjection θ : ω → nodes(N ); this move is denoted (N , θ). ∃'s response is mandatory. She must respond with N θ . Getting these preliminaries out of the way, we are now ready to start digging deeper.

Lemma 5.3
Let α be a countable atom structure. If ∃ has a winning strategy in H ω (α), then any algebra F having atom structure α is completely representable and there exists a complete D ∈ RCA ω such that Cmα ∼ = Nr n D Proof Fix some a ∈ α. The game H ω is designed so that using ∃'s winning strategy in the game H ω (α) one can define a nested sequence M 0 ⊆ M 1 ⊆ · · · of λ-neat hypernetworks, where M 0 is ∃'s response to the initial ∀-move a, such that If M r is in the sequence and M r (x) ≤ c i a for an atom a and some i < n, then there is s ≥ r and d ∈ nodes(M s ) such that M s (ȳ) = a,ȳ i = d andȳ ≡ ix . In addition, if M r is in the sequence and θ is any partial isomorphism of M r , then there is s ≥ r and a partial isomorphism θ + of M s extending θ such that rng(θ + ) ⊇ nodes(M r ) (This can be done using ∃'s responses to amalgamation moves). Now let M a be the limit of this sequence, that is, M a = M i , the labelling of (n − 1) tuples of nodes by atoms, and hyperedges by hyperlabels done in the obvious way using the fact that the M i s are nested. Let L be the signature with one n-ary relation for each b ∈ α, and one k-ary predicate symbol for each k-ary hyperlabel λ. Now we work in L ∞,ω . For fixed f a ∈ ω nodes(M a ), let U a = { f ∈ ω nodes(M a ) : {i < ω : g(i) = f a (i)} is finite}. We make U a into the base of an L relativized structure M a . We allow a clause for infinitary disjunctions. In more detail, for b ∈ α, l 0 , . . . , l n−1 , i 0 . . . , i k−1 < ω, k-ary hyperlabels λ, and all L-formulas φ, φ i , ψ, and f ∈ U a : ( f (l 0 ), . . . , f (l n−1 )) We are now working with (weak) set algebras whose semantics is induced by L ∞,ω formulas in the signature L, instead of first-order ones. For any such φ is an L-formula} and D a be the weak set algebra with universe D a . Let D = P a∈α D a . Then D is a generalized complete weak set algebra [4, Definition 3.1.2 (iv)]. By complete we mean that (the usual) infinite suprema exist. This is true because we chose to work with L ∞,ω while forming the dilations D a (a ∈ α). Each D a is complete, hence so is their product D. Let X ⊆ Nr n D. Then, by the completeness of D, we get that d = D X exists. Assume that i / ∈ n. Then c i d = c i X = x∈X c i x = X = d, because the c i s are completely additive and c i x = x, for all i / ∈ n, since x ∈ Nr n D. We conclude that d ∈ Nr n D, hence d is an upper bound of X in Nr n D. Since d = D x∈X X , there can be no b ∈ Nr n D (⊆ D) with b < d such that b is an upper bound of X for else it will be an upper bound of X in D. Thus, Nr n D x∈X X = d. We have shown that Nr n D is complete. Making the legitimate identification Nr n D ⊆ d Cmα by density, we get that Nr n D = Cmα (since Nr n D is complete), hence Cmα ∈ Nr n CA ω . This does not mean that Tmα ∈ Nr n CA ω , witness Theorem 4.4 below. To show that an atomic algebra with atom structure α is completely representable, we use that given two atomic algebras A, B ∈ CA n such that AtA ∼ = AtB. Then A ∈ CRCA n if and only if B ∈ CRCA n . Now Cmα ∈ S d Nr n CA ω (⊆ S c Nr n CA ω ) and α is countable, so by [13,Theorem 5.3.6] Cmα is completely representable, hence so is any algebra sharing the atom structure α. Alternatively to prove the last part, one can use that H ω is plainly stronger than the usual ω-rounded atomic game G (in the sense that a winning strategy for ∃ in H ω implies a winning strategy for ∃ in G), and then one uses [7, Theorem 3.3.3] whose more difficult implication says that a winning strategy for G(β) (hence in H(β)), β a countable atom structure, implies that β is completely representable. (The converse, when β is uncountable, may not be true [17,Theorem 4.5]).

Lemma 5.4
Any class K between S d Nr n CA ω ∩ CRCA n and S c Nr n CA n+3 is not elementary Proof (1) ∀ has a winning strategy in G n+3 (AtC) for a rainbow-like algebra C.
Take a rainbow-like CA n , call it C, based on the ordered structure Z and N. The reds R is the set {r i j : i < j < ω(= N)} and the green colours used constitute the set {g i : In complete coloured graphs the forbidden triples are like the usual rainbow constructions based on Z and N, but now the triple (g i 0 , g j 0 , r kl ) is also forbidden if {(i, k), ( j, l)} is not an order-preserving partial function from Z → N. It can be shown that ∀ has a winning strategy in the graph version of the game G n+3 (AtC) played on coloured graphs [5]. The rough idea here is that, as is the case with winning strategy's of ∀ in rainbow constructions, ∀ bombards ∃ with cones having distinct green tints demanding a red label from ∃ to appexes of succesive cones. The number of nodes are limited but ∀ has the option to reuse them, so this process will not end after finitely many rounds. The added order-preserving condition relating two greens and a red forces ∃ to choose red labels one of whose indices form a decreasing sequence in N. In ω many rounds ∀ forces a win, so C / ∈ S c Nr n CA n+3 . More rigorously, ∀ plays as follows: In the initial round ∀ plays a graph M with nodes 0, 1, . . . , n − 1 such that M(i, j) = w 0 for i < j < n − 1 and M(i, n − 1) = g i (i = 1, . . . , n − 2), M(0, n − 1) = g 0 0 and M (0, 1, . . . , n − 2) = y Z . This is a 0 cone. In the following move ∀ chooses the base of the cone (0, . . . , n − 2) and demands a node n with M 2 (i, n) = g i (i = 1, . . . , n − 2), and M 2 (0, n) = g −1 0 . ∃ must choose a label for the edge (n+1, n) of M 2 . It must be a red atom r mk , m, k ∈ N. Since −1 < 0, by the 'order-preserving' condition we have m < k. In the next move ∀ plays the face (0, . . . , n − 2) and demands a node n + 1, with M 3 (i, n) = g i (i = 1, . . . , n − 2), such that M 3 (0, n + 2) = g −2 0 . Then M 3 (n +1, n) and M 3 (n +1, n −1) both being red, the indices must match. M 3 (n +1, n) = r lk and M 3 (n + 1, r − 1) = r km with l < m ∈ N. In the next round ∀ plays (0, 1, . . . n − 2) and reuses the node 2 such that M 4 (0, 2) = g −3 0 . This time we have M 4 (n, n − 1) = r jl for some j < l < m ∈ N. Continuing in this manner leads to a decreasing sequence in N. We have proved the required statement. Since CmAtC = C and C / ∈ S c Nr n CA n+3 , we are done. (2) ∃ has a winning strategy in H k (AtC) for all k < ω. In [16] it is shown that for k < ω, ∃ has a winning strategy in G k (AtC Z,N ) in spite of the newly forbidden triple consisting of two greens and one red, synchronized by an orderpreserving function. This plainly makes her choices more restricted. But we can go further. It can be shown with some more effort (but not much more) that, in fact, ∃ has a winning strategy in even the stronger game H k (AtC Z,N ) for all k < ω.
(2a) Response of ∃ in labelling λ-neat hypredges. We describe ∃'s strategy in dealing with labelling hyperedges in λ-neat hypernetworks, where λ is a constant label kept on short hyperedges. In a play, ∃ is required to play λ-neat hypernetworks, so she has no choice about the short edges, these are labelled by λ. In response to a cylindrifier move by ∀ extending the current hypernetwork providing a new node k, and a previously played coloured hypernetwork M all long hyperedges not incident with k necessarily keep the hyperlabel they had in M. All long hyperedges incident with k in M are given unique hyperlabels not occurring as the hyperlabel of any other hyperedge in M. In response to an amalgamation move, which involves two hypernetworks required to be amalgamated, say (M, N ) all long hyperedges whose range is contained in nodes(M) have hyperlabel determined by M, and those whose range is contained in nodes(N ) have hyperlabels determined by N . Ifx is a long hyperedge of ∃'s response, L where rng(x) nodes(M), nodes(N ), thenx is given a new hyperlabel not used in any previously played hypernetwork and not used within L as the label of any hyperedge other thanx. This completes her strategy for labelling hyperedges.
(2b) Response of ∃ to cylindrification moves. We show that ∃ has a winning strategy in G k (AtC Z,N ) where 0 < k < ω is the number of rounds, the part proved in [16]. Let 0 < k < ω. We proceed inductively. Let M 0 , M 1 , . . . , M r , r < k be the coloured graphs at the start of a play of G k just before round r + 1. Assume inductively that ∃ computes a partial function ρ s : Z → N, for s ≤ r : (i) ρ 0 ⊆ · · · ⊆ ρ t ⊆ · · · ⊆ ρ s is (strict) order-preserving; if i < j ∈ domρ s then ρ s (i) − ρ s ( j) ≥ 3 k−r , where k − r is the number of rounds remaining in the game, and dom(ρ s ) = {i ∈ Z : ∃t ≤ s, M t contains an i-cone as a subgraph}, where i, j ∈ Z are tints of two cones, with base F such that x 0 is the first element in F under the induced linear order, then ρ s (i) = μ and ρ s ( j) = k.
For the base of the induction ∃ takes M 0 = ρ 0 = ∅. Assume that M r , r < k (k is the number of rounds) is the current coloured graph and that ∃ has constructed ρ r : Z → N to be a finite order-preserving partial map such that conditions (i) and (ii) hold. We show that (i) and (ii) can be maintained in a further round. We check the most difficult case. Assume that β ∈ nodes(M r ), δ / ∈ nodes(M r ) is chosen by ∀ in his cylindrifier move, such that β and δ are apexes of two cones having the same base and green tints p = q ∈ Z. Now ∃ adds q to dom(ρ r ) forming ρ r +1 by defining the value ρ r +1 ( p) ∈ N in such a way as to preserve the (natural) order on dom(ρ r ) ∪ {q}, that is maintaining property (i). Inductively, ρ r is order-preserving and 'widely spaced' meaning that the gap between its elements is at least 3 k−r , so this can be maintained in a further round. Now ∃ has to define a (complete) coloured graph M r +1 such that nodes(M r +1 ) = nodes(M r ) ∪ {δ}. In particular, she has to find a suitable red label for the edge (β, δ). Having ρ r +1 at hand she proceeds as follows. Now that p, q ∈ dom(ρ r +1 ), she lets μ = ρ r +1 ( p), b = ρ r +1 (q). The red label she chooses for the edge (β, δ) is (*) M r +1 (β, δ) = r μ,b . In this way she maintains property (ii) for ρ r +1 . Next we show that this is a winning strategy for ∃.
We check the consistency of the newly created triangles proving that M r +1 is a coloured graph completing the induction. Since ρ r +1 is chosen to preserve order, no new forbidden triple (involving two greens and one red) will be created. Now we check red triangles only of the form (β, y, δ) in M r +1 (y ∈ nodes(M r )). We can assume that y is the apex of a cone with base F in M r and green tint t, say, and that β is the apex of the p-cone having the same base. Then inductively by condition (ii), taking x 0 to be the first element of F, and taking the nodes β, y, and the tints p, t, for u, v, i, j, respectively, we have by observing that β, y ∈ nodes(M r ), β, y ∈ dom(ρ r ) and ρ r ⊆ ρ r +1 , the following: M r +1 (β, y) = M r (β, y) = r ρ r ( p),ρ r (t) = r ρ r+1 ( p),ρ r+1 (t) . By her strategy, we have M r +1 (y, δ) = r ρ r+1 (t),ρ r+1 (q) and we know by (*) that M r +1 (β, δ) = r ρ r+1 ( p),ρ r+1 (q) . The triple (r ρ r+1 ( p),ρ r+1 (t) , r ρ r+1 (t),ρ r+1 (q) , r ρ r+1 ( p),ρ r+1 (q) ) of reds is consistent and we are done with this case. All other edge labelling and colouring n − 1 tuples in M r +1 by yellow shades are exactly like in [5]. But we can go further. We show that ∃ has a winning strategy in the stronger game H k (AtC) for all k ∈ ω. ∃'s strategy dealing with λ-neat hypernetworks, where λ is a constant label kept on short hyperedges.
(2c) Response of ∃ to amalgamation moves. Now we change the board of play but only formally. We play on λ-neat hypergraphs. Given a rainbow algebra A, there is a one-to-one correspondence between coloured graphs on AtA and networks on AtA [7, half of p. 76]; denote this correspondence expressed by a bijection from coloured graphs to networks by (*): Now the game H can be reformulated to be played on λ-neat hypergraphs on a rainbow algebra A; these are of the form ( , N h ), where is a coloured graph on AtA, λ is a hyperlabel, and N h is as before, N h : <ω nodes( ) → , such that forx,ȳ ∈ <ω nodes( ), ifx ∼ȳ ⇒ N h (x) = N h (ȳ). Herex ∼ȳ, making the obvious translation, is the equivalence relation defined by x ∼ y if |x| = |y| and N (x i , y i ,z) ≤ d 01 for all i < |x| and somē z ∈ n−2 nodes( ).
All notions earlier defined for hypernetworks, in particular, λ-neat ones, translate to λ-neat hypergraphs, using (*), like short hyperedges, long hyperedges, λ-neat hypergraphs, etc. The game is played now on λ-neat hypergraphs on which the constant label λ is kept on the short hyperedges in <ω nodes( ). We have already dealt with the 'graph part' of the game. We turn to the remaining amalgamation moves. We need some notation and terminology. Every edge of any hypergraph (edge of its graph part) has an owner ∀ or ∃, namely, the one who coloured this edge. We call such edges ∀ edges or ∃ edges. Each long hyperedgex in N h of a hypergraph N occurring in the play has an envelope v N (x) to be defined shortly.
In the initial round, if ∀ plays a ∈ α and ∃ plays N 0 , then all edges of N 0 belong to ∀. There are no long hyperedges in N 0 . If ∀ plays a cylindrifier move requiring a new node k and ∃ responds with M then the owner in M of an edge not incident with k is the same as in N and the envelope in M of a long hyperedge not incident with k is the same as that it was in N .
If in a later move ∀ plays the transformation move (N , θ) and ∃ responds with N θ , then owners and envelopes are inherited in the obvious way. This completes the definition of owners and envelopes. The next claim, basically, reduces amalgamation moves to cylindrifier moves. By induction on the number of rounds one can show the following: Claim: Let M, N occur in a play of H m , 0 < m ∈ ω, in which ∃ uses the above labelling for hyperedges. Letx be a long hyperedge of M and letȳ be a long hyperedge of N . Then for any hyperedgex with rng( if (x, s) belong to ∀ in M for all s ∈ S, then |S| ≤ 2. Next, we proceed inductively with the inductive hypothesis exactly as before, except that now each N r is a λ-neat hypergraph. All that remains is the amalgamation move. With the above claim at hand, this turns out to be an easy task to implement guided by ∃'s winning strategy in the graph part. We consider an amalgamation move at round 0 < r , (N s , N t ) chosen by ∀ in round r + 1, ∃ has to deliver an amalgam N r +1 . ∃ lets nodes(N r +1 ) = nodes(N s ) ∪ nodes(N t ), then she, for a start, has to choose a colour for each edge (i, j) where i ∈ nodes(N s ) ∼ nodes(N t ) and j ∈ nodes(N t ) ∼ nodes(N s ). Letx enumerate nodes(N s ) ∩ nodes(N t ). Ifx is short, then there are at most two nodes in the intersection and this case is identical to the cylindrifier move. If not, that is ifx is long in N s , then by the claim there is a partial isomorphism θ It remains to label the edges (i, j) ∈ N r +1 where i ∈ nodes(N s ) ∼ nodes(N t ) and j ∈ nodes(N t ) ∼ nodes(N s ). Her strategy is now again similar to the cylindrifier move. If i and j are tints of the same cone, she chooses a red using ρ r +1 (constructed inductively like in the above proof), if not she chooses a white. She never chooses a green. Concerning n − 1 tuples, she needs to label n − 1 hyperedges by shades of yellow. For each tuplē a = a 0 , . . . a n−2 ∈ N r +1 , with no edge (a i , a j ) coloured green (we have already labelled edges), ∃ coloursā by y S , where S = {i ∈ Z : there is an i cone in N r +1 with baseā}.
We have shown that ∃ has a winning strategy in H k (AtC) for each finite k.
(3) Finishing the proof. All games used are deterministic. For each k < ω, let σ k describe the winning strategy of H k (α). Let C = Tmα. Let D be a non-principal ultrapower of C.
Then ∃ has a winning strategy σ in H ω (AtD)-essentially she uses σ k in the kth component of the ultraproduct so that, at each round of H ω (AtD), ∃ is still winning in co-finitely many components; this suffices to show she has still not lost. Now one can use an elementary chain argument to construct countable elementary subalgebras C = A 0 A 1 · · · D in the following way. One defines A i+1 to be a countable elementary subalgebra of D containing A i and all elements of D that σ selects in a play of H ω (AtD) in which ∀ only chooses elements from A i . Now let B = i<ω A i . This is a countable elementary subalgebra of D, hence necessarily atomic, and ∃ has a winning strategy in H ω (AtB). (cf. [7,Theorem 3.3.4 and Corollary 3.3.5] for a similar argument). So, by Lemma 5.3 (using AtB in place of α), we get that CmAtB ∈ Nr n CA ω . Since B ⊆ d CmAtB, B ∈ S d Nr n CA ω and, by Lemma 5.3, we also have that B ∈ CRCA n . But ∀ has a winning strategy in G m (AtB), so by Lemma 2.4, C / ∈ S c Nr n CA m . To finalize the proof, let K be as given. Then B ≡ C, B ∈ K(⊆ S d Nr n CA ω ∩ CRCA n ), but C / ∈ S c Nr n CA n+3 (⊇ K) giving that K is not elementary.
be a sequence of (strongly) representable CA n s with CmAtA i = A i and A = i/U A i is not strongly representable with respect to any non-principal ultrafilter U on ω. Such algebras exist [7]. Hence CmAtA / ∈ SNr n CA ω = i∈ω SNr n CA n+i , so CmAtA / ∈ SNr n CA l for all l > m, for some m ∈ ω, m ≥ n + 2. But for each such l, A i ∈ SNr n CA l (⊆ RCA n ), so (A i : i ∈ ω) is a sequence of algebras such that CmAt(A i ) ∈ SNr n CA l (i ∈ I ), but Cm(At( i/U A i )) = CmAt(A) / ∈ SNr n CA l , for all l ≥ m. 2. We use the same construction (and notation) as above. It suffices to show that the class of algebras K k = {A ∈ CA n ∩ At : CmAtA ∈ ONr n CA k } is not elementary. ∃ has a winning strategy in H ω (α) for some countable atom structure α, Tmα ⊆ d Cmα ∈ Nr n CA ω and Tmα ∈ CRCA n . Since C Z,N / ∈ S c Nr n CA n+3 , C Z,N = CmAtC Z,N / ∈ K k , C Z,N ≡ Tmα and Tmα ∈ K k because Cmα ∈ Nr n CA ω ⊆ S d Nr n CA ω ⊆ S c Nr n CA ω . We have shown that C Z,N ∈ ElK k ∼ K k , proving the required statement.
We state an easy lemma towards strengthening Lemma 5. (2) Assume that A S = 1 and suppose to the contrary that there exists b ∈ D, b < 1, such that s ≤ b for all s ∈ S. Let b = 1 − b then b = 0, hence by assumption (density) there exists a non-zero a ∈ A such that a ≤ b, i.e., a ≤ (1 − b ). If a · s = 0 for some s ∈ S, then a is not less than b which is impossible. So a · s = 0 for every s ∈ S, implying that a = 0, a contradiction. Now we prove the second part. Assume that A ⊆ d D and D is atomic. Let b ∈ D be an atom. We show that b ∈ AtA. By density there is a non-zero a ∈ A, such that a ≤ b in D. Since A is atomic, there is an atom a ∈ A such that a ≤ a ≤ b. But b is an atom of D, and a is non-zero in D, too, so it must be the case that a = b ∈ AtA. Thus, AtB ⊆ AtA and we are done.
The next lemma strengthens the main theorem in [13], and will be used later. CA ω , B / ∈ Nr n CA n+1 and A ≡ B. As they stand, A and B are not atomic, but they can be fixed so that they give the same result by interpreting the uncountably many tenary relations in the signature of M defined in [13,Lemma 5.1.3], which is the base of A and B to be disjoint in M, not just distinct. The construction is presented this way in [12], where (the equivalent of) M is built in a more basic step-by-step fashon. We work with 2 < n < ω instead of only n = 3. The proof presented in op. cit. lift verbatim to any such n. Let u ∈ n n. Write 1 u for χ M u (denoted by 1 u (for n = 3) in [13,Theorem 5.1.4].) We denote by A u the Boolean algebra Rl 1 u A = {x ∈ A : x ≤ 1 u } and similarly for B, writing B u short hand for the Boolean algebra Rl 1 u B = {x ∈ B : x ≤ 1 u }. We show that ∃ has a winning strategy in an Ehrenfeucht-Fraïssé-game over (A, B) concluding that A ≡ ∞ B. At any stage of the game, if ∀ places a pebble on one of A or B, ∃ must place a matching pebble, on the other algebra. Letā = a 0 , a 1 , . . . , a n−1 be the position of the pebbles played so far (by either player) on A and letb = b 0 , . . . , b n−1 be the the position of the pebbles played on B. ∃ maintains the following properties throughout the game: If x is an atom (of either algebra) with x · 1 I d = 0, then x ∈ a i if and only if x ∈ b i andā induces a finite partion of 1 I d in A of 2 n (possibly empty) parts p i : i < 2 n andb induces a partion of 1 I d in B of parts q i : i < 2 n . Furthermore, p i is finite if and only if q i is finite and, in this case, | p i | = |q i |. That such properties can be maintained is fairly easy to show. Using that M has quantifier elimination we get, using the same argument as in op. cit., that A ∈ Nr n CA ω . The property that B / ∈ Nr n CA n+1 is also still maintained. To see why, consider the substitution operator n s(0, 1) (using one spare dimension) as defined in the proof of [13,Theorem 5.1.4]. Suppose to the contrary that B = Nr n C, with C ∈ CA n+1 . Let u = 1, 0, 2, . . . , n − 1. Then A u = B u and so |B u | > ω. The term n s(0, 1) acts like a substitution operator corresponding to the transposition [0, 1]; it 'swaps' the first two coordinates. Now one can show that n s(0,1) C B u ⊆ B [0,1]•u = B I d , so | n s(0, 1) C B u | is countable because B I d was forced by construction to be countable. But n s(0, 1) is a Boolean automorpism with inverse n s(1, 0), so that |B u | = | n s(0,1) C B u | > ω, a contradiction. Now we show that the algebra B is outside S d Nr n CA ω ∩ At ⊇ S d Nr n CA ω ∩ CRCA n . Take κ, the signature of M, to be 2 2 ω and suppose to the contrary that B ∈ S d Nr n CA ω ∩ At. Then B ⊆ d Nr n D for some D ∈ CA ω and Nr n D is atomic. For brevity, let C = Nr n D. Then, by the first item of Lemma 5.6, Rl I d B ⊆ d Rl I d C. Since C is atomic, by the following item of the same lemma, Rl I d C is also atomic. Using the same reasoning as above, we get that |Rl I d C| > 2 ω (since C ∈ Nr n CA ω .) By the choice of κ, we get that |AtRl I d C| > ω. By density using Lemma 5.6, AtRl I d C ⊆ AtRl I d B. But by the construction of B, we have |Rl I d B| = |AtRl I d B| = ω, which is a contradiction and we are done.
In what follows, Up, Ur, P and H denote the operations of forming ultraproducts, ultraroots, products and homomorphic images, respectively. Theorem 5.8 1. Any class K such that Nr n CA ω ∩CRCA n ⊆ K ⊆ CRCA n ∩S d Nr n CA ω ∩CRCA n or any class K between CRCA n ∩ S d Nr n CA ω and S c Nr n CA n+3 , K is not elementary. 2. Any class K such that AtNr n CA ω ⊆ K ⊆ AtNr n CA ω is not elementary.
Proof 1. Two atomic algebras A and B are constructed in Lemma 5.7 such that A ∈ Nr n CA ω , B / ∈ S d Nr n CA n+1 and A ≡ B. Thus, B ∈ El(Nr n CA ω ∩ CRCA n ) ∼ S d Nr n CA ω . Since El(Nr n CA ω ∩ CRCA n ) S d Nr n CA ω ∩ CRCA n , there can be no elementary class between Nr n CA ω ∩CRCA n and S d Nr n CA ω ∩CRCA n . Having already eliminated elementary classes between S d Nr n CA ω ∩ CRCA n and S c Nr n CA n+3 , we are done. 2. We prove the following: let α be a countable atom structure. If ∃ has a winning strategy in H ω (α), then any algebra F having atom structure α is completely representable and there exists a complete D ∈ RCA ω such that α ∼ = AtNr n D. In particular, Cmα ∈ Nr n CA ω and α ∈ AtNr n CA ω . Combined with the proof of theorem 5.4 we will be done. For this purpose, let x ∈ D be formed as above. Then Conversely, let ι a : D a → D be the embedding defined by ι a (y) = ( Here short hyperedges are constantly labelled by λ. This map extends to a finite partial isomorphism θ of M a whose domain includes f (i 0 ), . . . , f (i k−1 ). Let g ∈ M a be defined by and similarly g (n − 1) = g(n − 1), so g is identical to g over n and it differs from g on only a finite set. Since φ(x i 0 , . . . , . , x i k−1 ) D a (this can be proved by induction on quantifier depth of formulas). This proves that and so Now every non-zero element x of Nr n D a is above a non-zero element of the following form: ι a (b(x 0 , x 1 , . . . , x n−1 ) D a ) (for some a, b ∈ α) and these are the atoms of Nr n D a . The map defined via b → (b(x 0 , x 1 , . . . , x n−1 ) D a : a ∈ α) is an isomorphism of atom structures, so α ∈ AtNr n CA ω .

Other notions of representability
Theorem 6.1 Let κ be an infinite cardinal. Then there exists an atomless C ∈ CA ω such that, for all 2 < n < ω, Nr n C is atomic with |At(Nr n C)| = 2 κ , Nr n C ∈ LCA n , but Nr n C is not completely representable.
Proof We use the following uncountable version of Ramsey's theorem due to Erdos and Rado: if r ≥ 2 is finite and k is an infinite cardinal, then exp r (k) + → (k + ) r +1 k where exp 0 (k) = k and inductively exp r +1 (k) = 2 exp r (k) . The above partition symbol describes the following statement. If f is a coloring of the (r + 1)-element subsets of a set of cardinality exp r (k) + with k colors, then there is a homogeneous set of cardinality k + (a set all whose (r + 1)-element subsets get the same f -value). Let κ be the given cardinal. We use a variation on the construction which is a simplified more basic version of a rainbow construction where only the two predominent colours, namely, the reds and blues are available. The algebra C will be constructed from a relation algebra possesing an ω-dimensional cylindric basis. To define the relation algebra we specify its atoms and the forbidden triples of atoms. The atoms are Id, g i 0 : i < 2 κ and r j : 1 ≤ j < κ, all symmetric. The forbidden triples of atoms are all permutations of (Id, x, y) for x = y, (r j , r j , r j ) for 1 ≤ j < κ and (g i 0 , g i 0 , g i * 0 ) for i, i , i * < 2 κ . Write g 0 for {g i 0 : i < 2 κ } and r + for {r j : 1 ≤ j < κ}. Call this atom structure α. Consider the term algebra R defined to be the subalgebra of the complex algebra of this atom structure generated by the atoms. We claim that R, as a relation algebra, has no complete representation, hence any algebra sharing this atom structure is not completely representable either.
Suppose to the contrary that R has a complete representation M. Let x, y be points in the representation with M | r 1 (x, y).
Within Z , each edge is labelled by one of the κ atoms in r + . The Erdos-Rado theorem forces the existence of three points z 1 , z 2 , z 3 ∈ Z such that M | r j (z 1 , z 2 ) ∧ r j (z 2 , z 3 ) ∧ r j (z 3 , z 1 ) for some single j < κ. This contradicts the definition of composition in R (since we avoided monochromatic triangles). Let S be the set of all atomic R-networks N with nodes ω such that {r i : 1 ≤ i < κ : r i is the label of an edge inN} is finite. Then it is straightforward to show that S is an amalgamation class, that is, for all M, N ∈ S, if M ≡ i j N then there is L ∈ S with M ≡ i L ≡ j N , witness [6, Definition 12.8] for notation. Now let X be the set of finite R-networks N with nodes ⊆ κ such that For i ∈ ω, let N −i be the subgraph of N obtained by deleting the node i.
We seek M ≡ i L with M ∈ N . This will prove that L ∈ c i N , as required. Since L ∈ S, the set T = {r i / ∈ L} is infinite. Let T be the disjoint union of two infinite sets Y ∪ Y , say. To define the ω-network M we must define the labels of all edges involving the node i (other labels are given by M ≡ i L). We define these labels by enumerating the edges and labeling them one at a time. So let j = i < κ. Suppose j ∈ nodes(N ). We must choose M(i, j) ≤ N (i, j). If N (i, j) is an atom then of course M(i, j) = N (i, j). Since N is finite, this defines only finitely many labels of M. If N (i, j) is a cofinite subset of g 0 then we let M(i, j) be an arbitrary atom in N (i, j). And if N (i, j) is a cofinite subset of r + then let M(i, j) be an element of N (i, j) ∩ Y which has not been used as the label of any edge of M which has already been chosen (possible, since at each stage only finitely many have been chosen so far). If j / ∈ nodes(N ) then we can let M(i, j) = r k ∈ Y some 1 ≤ k < κ such that no edge of M has already been labelled by r k . It is not hard to check that each triangle of M is consistent (we have avoided all monochromatic triangles) and clearly M ∈ N and M ≡ i L. The labeling avoided all but finitely many elements of Y , so M ∈ S. So (N −i ) ⊆ c i N .
Now let X = { N : N ∈ X } ⊆ Ca(S). Then the subalgebra of Ca(S) generated by X is simply obtained from X by closing under finite unions. Thus, R is relation algebra reduct of C ∈ CA ω but has no complete representation. Let n > 2. Let B = Nr n C. Then B ∈ Nr n CA ω , is atomic, but has no complete representation for plainly a complete representation of B induces one of R. In fact, because B is generated by its two-dimensional elements, and its dimension is at least three, its Df reduct is not completely representable. We show that the ω-dilation C is atomless. For any N ∈ X , we can add an extra node extending N to M such that ∅ M N , so that N cannot be an atom in C. Then Nr n C (2 < n < ω) is atomic, but has no complete representation. By Lemma 2.4, ∃ has a winning strategy in G ω (AtNr n C), hence she has a winning strategy in G ω (AtNr n C), a fortiori in G k (AtNr n C) for all k ∈ ω, hence by coding the winning strategies of the G k s in first-order sentences, we get that Nr n C satisfies these first-order sentences which are precisely (by definition) the Lyndon conditions. By observing from the last part of the proof of the previous theorem that Nr n CA ω ⊆ LCA n (= ElCRCA n ) and similarly for RAs, we have RaCA ω ⊆ LRRA = (ElCRRA), we immediately get 1 M , and t preserves arbitrary meets carrying them to set-theoretic intersections. For i ∈ I , where q i α = p i and let W i = { f ∈ α+ω U (q i ) i : |{k ∈ α + ω : f (k) = f i (k)}| < ω}. Let C i = ℘ (W i ). Then C i is atomic; indeed the atoms are the singletons. Let x ∈ Nr α C i , that is, c i x = x for all α ≤ i < α + ω. Now if f ∈ x and g ∈ W i satisfy g(k) = f (k) for all k < α, then g ∈ x. Hence Nr α C i is atomic; its atoms are {g ∈ W i : {g(i) : i < α} ⊆ U i }. Define h i : A → Nr α C i by h i (a) = { f ∈ W i : ∃a ∈ AtA, a ≤ a; ( f (i) : i < α) ∈ t(a )}. Let D = P i C i . Let π i : D → C i be the ith projection map. Now clearly D is atomic, because it is a product of atomic algebras, and its atoms are (π i (β) : β ∈ At(C i )). Now A embeds into Nr α D via J : a → (π i (a) : i ∈ I ). If x ∈ Nr α D, then for each i, we have π i (x) ∈ Nr α C i , and if x is non-zero, then π i (x) = 0. By the atomicity of C i , there is an α-ary tuple y, such that {g ∈ W i : g(k) = y k } ⊆ π i (x). It follows that there is an atom of b ∈ A, such that x · J (b) = 0, and so the embedding is atomic, hence complete. We have shown that A ∈ S c Nr α CA α+ω and we are done.
(2) By [13, Theorem 5.3.6] the class CRCA n coincides with the class S c Nr n CA ω on atomic algebras with countably many atoms. Then together with [7, Theorem 3.3.3] we are done.
(3) We start with CRCA n . Closure under P is straightforward. We show that S c CRCA n = CRCA n . Assume that D ∈ CRCA n and A ⊆ c D. Identifying set algebras with their domain, let f : D → ℘ (V ) be a complete representation of A where V is a Gs n unit. We claim that g = f A establishes the required complete representation of A. Let X ⊆ A, then for x ∈ X (⊆ A), we have f (x) = g(x), so that x∈X g(x) = x∈X f (x) = V , since it is given that f is a complete representation and we are done. Let C be any of the two remaining classes. Closure under S c follows from S c S c C = S c C. Closure under P follows from PS c C ⊆ S c PC and PNr n CA ω = Nr n CA ω . Non-closure under S is trivial for a subalgebra of an atomic algebra may well be non-atomic. We prove non-closure under H for all three clases in one go. Take a family (U i i ∈ N) of pairwise disjoint non-empty sets. Let V i = n U i (i ∈ N). Take the full Gs n A with universe ℘ (V ) where V = i∈N V i . Then A ∈ C RC A n ⊆ C. Let I be the ideal of elements of A intersecting with only finitely many elements of the V i s. Then A/I is non-atomic, and so is outside all three classes. Now we approach closure under ultraroots (Ur). Let C ∈ CA n ∼ CRCA n be atomic having countable many atoms and elementary equivalent to a B ∈ CRCA n . Such algebras exist (as shown above, see, e.g., the algebra C Z,N used in the proof of Theorems 5.4 and 5.5 , or [5]). Since all the given classes are closed under ultraproducts, it must be the case that B / ∈ UrC of any of the given three classes C, since by the Keisler-Shelah ultrapower Therorem ElK = UrUpK. Now we show the pseudo-elementarity of Nr n CA m (which is known to be non-elementary [12]). If m is finite, then the pseudo-elementary class Nr n CA m can be defined in two sorted theory in a fairly straightforward manner. When m = ω, things are slightly (but not much more) involved. One proceeds as follows defining Nr n CA ω in a three-sorted theory: Use a sort of the CA n (c), the second sort is for the Boolean reduct of the CA n (b), and the third sort is for the set odd dimensions (δ). For any infinite ordinal μ the defining theory of Nr n CA μ = Nr n CA ω will include sentences requiring that the constants i δ for i < ω are distinct, and the last two sorts defines a CA ω . There is a function I b from sort (c) to sort (b) and one stipulates sentences forcing that I b is injective and respects the CA n operations. For example, for all x c and i < n I b (c i x c )) = c b i (I b (x c )). One finally requires that I b maps onto the set of n-dimensional elements. This can be expressed via (*): ∀y b (∀z δ (z δ = 0 δ , . . . , (n − 1) δ ⇒ c b (z δ , y b ) = y b )) ⇐⇒ ∃x c (y b = I b (x c ))).
In all cases it is is clear that any algebra of the right type is the first sort of a model of this theory. Conversely, a model of this theory will consist of A ∈ CA n (sort c) and a B ∈ CA ω ; the dimension of the last is the cardinality of the δ-sorted elements which is ω such that by (*) A = Nr n B. Thus, the three-sorted theory defines the class of neat reducts. Furthermore, it is clearly recursive. Recursive enumerability for both classes follows from [6,Theorem 9.37].
For the last statement we show that LCA n = ElCRCA n = ElS c Nr n CA ω ∩ At. Assume A ∈ LCA n . Then, by definition, for all k < ω, ∃ has a winning strategy in the k-rounded atomic game G k (AtA). Using ultrapowers followed by an elementay chain argument, like in [7,Theorem 3.3.3], there exists a countable atomic B such that B ≡ A and ∃ has a winning strategy in the ω-rounded atomic game G ω (AtB). So A ∈ ElCRCA n , because by [6, Theorem 3.3.3], B ∈ CRCA n . One next shows that El(S c )Nr n CA ω ∩ At) ⊆ LCA n as follows. Assume that A ∈ S c Nr n CA ω ∩ At. Then by Lemma 2.4, ∃ has a winning strategy in G ω (AtA). Since we have infinitely many nodes, and infinitely many rounds, reusing the nodes in play, is superfluous, so ∃ has a winning strategy in the usual ω-rounded atomic game G ω (AtA). This obviously implies that ∃ has winning strategy in the k-rounded usual atomic game G k (AtA) for all k < ω. But this means, by definition, that A satifies the Lyndon conditions. We have shown that S c Nr n CA ω ∩At ⊆ LCA n . Since LCA n is elementary, it readily follows that ELS c Nr n CA ω ∩ At ⊆ LCA n .
For the last item: The algebra E used in Theorem 3.6 witnesses that Nr n CA ω S d Nr n CA ω , because E / ∈ ElNr n CA ω ⊇ Nr n CA ω and E ⊆ d B where B is the full CA n with unit n Q and universe ℘ ( n Q). We have constructed algebras with countably many atoms in ELS c Nr n CA ω ∼ S c Nr n CA ω like the rainbow-like algebra C Z,N . Let A ∈ RCA n be simple, countable and atomic such that CmAtA / ∈ RCA n . This algebra exists in [9] and even finer ones were constructed in Theorem 3.2. Then A / ∈ LCA n , because AtA does not satisfy the Lyndon conditions, lest CmAtA ∈ LCA n (⊆ RCA n ) which we know is not the case. Then A ∈ RCA n ∼ El § c Nr n CA ω proving the strictness of the last inclusion. Since all three algebras E, C Z,N , and A are atomic, we are done. Fix 2 < n < ω. Call an atomic A ∈ CA n weakly (strongly) representable if AtA is weakly (strongly) representable. Let WRCA n (SRCA n )) denote the class of all such CA n s, respectively. Then the class SRCA n is not elementary, and LCA n SRCA n WRCA n [7]. Recall that for a class K of atomic BAOs, K ∩ Count denotes the class of algebras having countably many atoms. Theorem 6.4 If 2 < n < ω, then the following hold: appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.