Axiomatizability of reducts of algebras of relations

In this paper, we prove that any subreduct of the class of representable relation algebras whose similarity type includes intersection, relation composition and converse is a non-finitely axiomatizable quasivariety and that its equational theory is not finitely based. We show the same result for subreducts of the class of representable cylindric algebras of dimension at least three whose similarity types include intersection and cylindrifications. A similar result is proved for subreducts of the class of representable sequential algebras. Received October 7, 1998; accepted in final form September 10, 1999.     

The class of infinite dimensional neat reducts of quasi‐polyadic algebras is not axiomatizable

SC, CA, QA and QEA denote the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasi‐polyadic algebras and quasi‐polyadic equality algebras, respectively. Let ω ≤ α < β and let K ∈ {SC,CA,QA,QEA}. We show that the class of α ‐dimensional neat reducts of algebras in K_β is not elementary. This solves a problem in [3]. Also our result generalizes results proved in [2] and [3]. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Comparing decision problem for various paradigms of algebraic logic

We show that in many cases the decision problems for varieties of cylindric algebras are much harder than those for the corresponding relation algebra reducts. We also give examples of varieties of cylindric and relation algebras which are algorithmically more complicated than the subvarieties of their representable algebras.     

Varieties of Algebras without the Amalgamation Property

Let α be an ordinal and κ be a cardinal, both infinite, such that κ ≤ |α|. For τ ∈^αα, let sup(τ) = {i ∈ α: τ(i) ≠ i}. Let G _κ = {τ ∈^αα: |sup(τ)| < κ}. We consider variants of polyadic equality algebras by taking cylindrifications on Γ ? α, |Γ| < κ and substitutions restricted to G _κ. Such algebras are also enriched with generalized diagonal elements. We show that for any variety V containing the class of representable algebas and satisfying a finite schema of equations, V fails to have the amalgamation property. In particular, many varieties of Halmos’ quasi-polyadic equality algebras and Lucas’ extended cylindric algebras (including that of the representable algebras) fail to have the amalgamation property.     

Weakly representable atom structures that are not strongly representable,with an application to first order logic

Letn > 2. A weakly representable relation algebra that is not strongly representable is constructed. It is proved that the set of all n by n basic matrices forms a cylindric basis that is also a weakly but not a strongly representable atom structure. This gives an example of a binary generated atomic representable cylindric algebra with no complete representation. An application to first order logic is given. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on substitutions in representable cylindric algebras

We show that it is impossible to define a substitution operator for arbitrary representable cylindric algebras that agrees in its basic properties with the notion of substitutions introduced for dimension complemented algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A construction of cylindric and polyadic algebras from atomic relation algebras

Given a simple atomic relation algebra ${\mathcal{A}}$ and a finite n ?? 3, we construct effectively an atomic n-dimensional polyadic equality-type algebra ${\mathcal{P}}$ such that for any subsignature L of the signature of ${\mathcal{P}}$ that contains the boolean operations and cylindrifications, the L-reduct of ${\mathcal{P}}$ is completely representable if and only if ${\mathcal{A}}$ is completely representable. If ${\mathcal{A}}$ is finite then so is ${\mathcal{P}}$ . It follows that there is no algorithm to determine whether a finite n-dimensional cylindric algebra, diagonal-free cylindric algebra, polyadic algebra, or polyadic equality algebra is representable (for diagonal-free algebras this was known). We also obtain a new proof that the classes of completely representable n-dimensional algebras of these types are non-elementary, a result that remains true for infinite dimensions if the diagonals are present, and also for infinite-dimensional diagonal-free cylindric algebras.     

Boolean products of R0‐algebras

In this paper, the (weak) Boolean representation of R₀‐algebras are investigated. In particular, we show that directly indecomposable R₀‐algebras are equivalent to local R₀‐algebras and any nontrivial R₀‐algebra is representable as a weak Boolean product of local R₀‐algebras (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Derivations,automorphisms, and representations of complex ω-Lie algebras

Let (𝔤,ω) be a finite-dimensional non-Lie complex ω-Lie algebra. We study the derivation algebra Der(𝔤) and the automorphism group Aut(𝔤) of (𝔤,ω). We introduce the notions of ω-derivations and ω-automorphisms of (𝔤,ω) which naturally preserve the bilinear form ω. We show that the set Der_ω(𝔤) of all ω-derivations is a Lie subalgebra of Der(𝔤) and the set Aut_ω(𝔤) of all ω-automorphisms is a subgroup of Aut(𝔤). For any three-dimensional and four-dimensional nontrivial ω-Lie algebra 𝔤, we compute Der(𝔤) and Aut(𝔤) explicitly, and study some Lie group properties of Aut(𝔤). We also study representation theory of ω-Lie algebras. We show that all three-dimensional nontrivial ω-Lie algebras are multiplicative, as well as we provide a four-dimensional example of ω-Lie algebra that is not multiplicative. Finally, we show that any irreducible representation of the simple ω-Lie algebra C_α(α≠0,?1) is one-dimensional.     

Some Boolean Algebras with Finitely Many Distinguished Ideals I

We consider the theory Th_prin of Boolean algebras with a principal ideal, the theory Th_max of Boolean algebras with a maximal ideal, the theory Th_ac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Th_sa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Th_prin and Th_sa. If T is a theory in a first order language and α is a linear order with least element, then we let Sentalg(T) be the Lindenbaum-Tarski algebra with respect to T, and we let intalg(α) be the interval algebra of α. Using rank diagrams, we show that Sentalg(Th_prin) ? intalg(ω⁴), Sentalg(Th_max) ? intalg(ω³) ? Sentalg(Th_ac), and Sentalg(Th_sa) ? intalg(ω² + ω²). For Th_max and Th_ac we use Ershov's elementary invariants of these theories. We also show that the algebra of formulas of the theory Tx of Boolean algebras with finitely many ideals is atomic.     

On the complexity of axiomatizations of the class of representable quasi‐polyadic equality algebras

Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omegaUsing games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omega$ and $l< n,$ $k < n$, k′ < ω are natural numbers, then Σ contains infinitely equations in which ? occurs, one of + or · occurs, a diagonal or a permutation with index l occurs, more than k cylindrifications and more than k′ variables occur. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

A Modeltheoretic Solution to a Problem of Tarski

Let 1 < n < ω and β > n. We show that the class Nr_nCA_β of n‐dimensional neat reducts of β‐dimensional cylindric algebras is not closed under forming elementary subalgebras. This solves a long‐standing open problem of Tarski and his co‐authors Andréka, Henkin, Monk and Németi. The proof uses genuine model‐theoretic arguments.     

Amalgamation in finite dimensional cylindric algebras

For every finite n > 1, the embedding property fails in the class of all n-dimensional cylindric type algebras which satisfy the following. Their boolean reducts are boolean algebras and two of the cylindrifications are normal, additive and commute. This result also holds for all subclasses containing the representable n-dimensional cylindric algebras. This considerably strengthens a result of S. Comer on CA _n and provides a strong counterexample for interpolation in finite variable fragments of first order logic. We provide a new modern proof, using an argument inspired by modal logic. February 22, 1999.     

Finite Dimensional Hopf Algebras Over the Dual Group Algebra of the Symmetric Group in Three Letters

We classify finite-dimensional Hopf algebras whose coradical is isomorphic to the algebra of functions on 𝕊₃. We describe a new infinite family of Hopf algebras of dimension 72.     

σ‐short Boolean algebras

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On notions of representability for cylindric‐polyadic algebras,and a solution to the finitizability problem for quantifier logics with equality

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEA_T is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEA_T are completely representable and that CPEA_T has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEA_T is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented.     

Bounded BCK‐algebras and their generated variety

In this paper we prove that the equational class generated by bounded BCK‐algebras is the variety generated by the class of finite simple bounded BCK‐algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK‐algebras is also a relatively simple bounded BCK‐algebra. Moreover, we show that every simple bounded BCK‐algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Finite vs affine W-algebras

In Section 1 we review various equivalent definitions of a vertex algebra V. The main novelty here is the definition in terms of an indefinite integral of the λ-bracket. In Section 2 we construct, in the most general framework, the Zhu algebra Zhu_ΓV, an associative algebra which “controls” Γ-twisted representations of the vertex algebra V with a given Hamiltonian operator H. An important special case of this construction is the H-twisted Zhu algebra Zhu_H V. In Section 3 we review the theory of non-linear Lie conformal algebras (respectively non-linear Lie algebras). Their universal enveloping vertex algebras (resp. universal enveloping algebras) form an important class of freely generated vertex algebras (resp. PBW generated associative algebras). We also introduce the H-twisted Zhu non-linear Lie algebra Zhu_H R of a non-linear Lie conformal algebra R and we show that its universal enveloping algebra is isomorphic to the H-twisted Zhu algebra of the universal enveloping vertex algebra of R. After a discussion of the necessary cohomological material in Section 4, we review in Section 5 the construction and basic properties of affine and finite W-algebras, obtained by the method of quantum Hamiltonian reduction. Those are some of the most intensively studied examples of freely generated vertex algebras and PBW generated associative algebras. Applying the machinery developed in Sections 3 and 4, we then show that the H-twisted Zhu algebra of an affine W-algebra is isomorphic to the finite W-algebra, attached to the same data. In Section 6 we define the Zhu algebra of a Poisson vertex algebra, and we discuss quasiclassical limits. In the Appendix, the equivalence of three definitions of a finite W-algebra is established. “I am an old man, and I know that a definition cannot be so complicated.” I.M. Gelfand (after a talk on vertex algebras in his Rutgers seminar)     

Critère d’existence d’idempotent basé sur les algèbres de Rétrocroisement

We study the relationship of backcrossing algebras with mutation algebras and algebras satisfying ω-polynomial identities: we show that in a backcrossing algebra every element of weight 1 generates a mutation algebra and that for any polynomial identity f there is a backcrossing algebra satisfying f. We give a criterion for the existence of idempotent in the case of baric algebras satisfying a nonhomogeneous polynomial identity and containing a backcrossing subalgebra. We give numerous genetic interpretations of the algebraic results.