In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some given n. We show that for such “path defined” Maltsev conditions, the decision problem is polynomial-time solvable.

Positive modal algebras are the$$\left\langle { \wedge, \vee,\diamondsuit,\square,0,1} \right\rangle $$-subreducts of modal algebras. We prove that the variety of positive S4-algebras is not locally finite. On the other hand, the free one-generated positive S4-algebra is shown to be finite. Moreover, we describe the bottom part of the lattice of varieties of positive S4-algebras. Building on this, we characterize structurally complete varieties of positive K4-algebras.

A meadow is a commutative ring with an inverse operator satisfying 0⁻¹ = 0. We determine the initial algebra of the meadows of characteristic 0 and prove a normal form theorem for it. As an immediate consequence we obtain the decidability of the closed term problem for meadows and the computability of their initial object.

A lattice L is coordinatizable, if it is isomorphic to the lattice L of principal right ideals of some von Neumann regular ring R. This forces L to be complemented modular. All known sufficient conditions for coordinatizability, due first to von Neumann, then to Jónsson, are first-order. Nevertheless, we prove that coordinatizability of lattices is not first-order, by finding a non-coordinatizable lattice K with a coordinatizable countable elementary extension L. This solves a 1960 problem of Jónsson. We also prove that (...) there is no [Formula: see text] statement equivalent to coordinatizability. Furthermore, the class of coordinatizable lattices is not closed under countable directed unions; this solves another problem of Jónsson from 1962. (shrink)

The paper describes the isomorphic lattices of quasivarieties of commutative quasigroup modes and of cancellative commutative binary modes. Each quasivariety is characterised by providing a quasi-equational basis. A structural description is also given. Both lattices are uncountable and distributive.

The paper aims at studying, in full generality, logics defined by imposing a variable inclusion condition on a given logic $$\vdash $$. We prove that the description of the algebraic counterpart of the left variable inclusion companion of a given logic $$\vdash $$ is related to the construction of Płonka sums of the matrix models of $$\vdash $$. This observation allows to obtain a Hilbert-style axiomatization of the logics of left variable inclusion, to describe the structure of their reduced models, (...) and to locate them in the Leibniz hierarchy. (shrink)

We characterize the elementary classes generated from a distinguished subclass closing by taking direct products and elementary equivalence. In the second part we give the same characterization in terms of atomic Boolean products. In the last part, we study the cases when the class of Boolean products is elementary but is not given by a discriminator.