For any $n<\omega $ we construct an infinite $(n+1)$-generated Heyting algebra whose n-generated subalgebras are of cardinality $\leq m_n$ for some positive integer $m_n$. From this we conclude that for every $n<\omega $ there exists a variety of Heyting algebras which contains an infinite $(n+1)$-generated algebra, but which contains only finite n-generated algebras. For the case $n=2$ this provides a negative answer to a question posed by G. Bezhanishvili and R. Grigolia in [4].

We prove that the opposite of the category of coalgebras for the Vietoris endofunctor on the category of compact Hausdorff spaces is monadic over $\mathsf {Set}$. We deliver an analogous result for the upper, lower, and convex Vietoris endofunctors acting on the category of stably compact spaces. We provide axiomatizations of the associated (infinitary) varieties. This can be seen as a version of Jónsson–Tarski duality for modal algebras beyond the zero-dimensional setting.

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to have a model completion, extending a characterization provided by Wheeler. For varieties of algebras that have equationally definable principal congruences and the compact intersection property, these conditions yield a more elegant characterization obtained (in a slightly more restricted setting) by Ghilardi and Zawadowski. Moreover, it is shown that under certain further assumptions on congruence lattices, the existence of a model completion implies that the variety has equationally definable principal congruences. This result is then used to provide necessary and sufficient conditions for the existence of a model completion for theories of Hamiltonian varieties of pointed residuated lattices, a broad family of varieties that includes lattice-ordered abelian groups and MV-algebras. Notably, if the theory of a Hamiltonian variety of pointed residuated lattices has a model completion, it must have equationally definable principal congruences. In particular, the theories of lattice-ordered abelian groups and MV-algebras do not have a model completion, as first proved by Glass and Pierce, and Lacava, respectively. Finally, it is shown that certain varieties of pointed residuated lattices generated by their linearly ordered members, including lattice-ordered abelian groups and MV-algebras, can be extended with a binary operation to obtain theories that do have a model completion.

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz hierarchy. In particular, it is proved that the classes of truth-equational and assertional logics are meet-prime in the Leibniz hierarchy, while the classes of protoalgebraic and equivalential logics are meet-reducible. However, the last two classes are shown to be determined by Leibniz conditions consisting of meet-prime logics only.

A notion of interpretation between arbitrary logics is introduced, and the poset $\mathsf {Log}$ of all logics ordered under interpretability is studied. It is shown that in $\mathsf {Log}$ infima of arbitrarily large sets exist, but binary suprema in general do not. On the other hand, the existence of suprema of sets of equivalential logics is established. The relations between $\mathsf {Log}$ and the lattice of interpretability types of varieties are investigated.

We study the lattice of extensions of four-valued Belnap–Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and prove some new completeness theorems for super-Belnap logics. The crucial technical tool for this purpose will be the so-called antiaxiomatic (or explosive) part operator. The antiaxiomatic (or explosive) extensions of Belnap–Dunn logic turn out to be of particular interest owing to their connection to graph theory: the lattice of finitary antiaxiomatic extensions of Belnap–Dunn logic is isomorphic to the lattice of upsets in the homomorphism order on finite graphs (with loops allowed). In particular, there is a continuum of finitary super-Belnap logics. Moreover, a non-finitary super-Belnap logic can be constructed with the help of this isomorphism. As algebraic corollaries we obtain the existence of a continuum of antivarieties of De Morgan algebras and the existence of a prevariety of De Morgan algebras which is not a quasivariety.

We give a short proof of the fundamental theorem of central element theory (see: Sanchez Terraf and Vaggione, Varieties with definable factor congruences, T.A.M.S. 361). The original proof is constructive and very involved and relies strongly on the fact that the class be a variety. Here we give a more direct nonconstructive proof which applies for the more general case of a first-order class which is both closed under the formation of direct products and direct factors.

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We present our main construction in terms of polygroupoids.

It is known that a countable $\omega $ -categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone homomorphism. We investigate the relationship between the existence of a clone homomorphism to the projection clone, and the existence of such a homomorphism which is continuous and thus meets the above criterion.

Positive logics are $\{ \wedge , \vee , \to \}$-fragments of intermediate logics. It is clear that the positive fragment of $Int$ is not structurally complete. We give a description of all hereditarily structurally complete positive logics, while the question whether there is a structurally complete positive logic which is not hereditarily structurally complete, remains open.

Profinite algebras are exactly those that are isomorphic to inverse limits of finite algebras. Such algebras are naturally equipped with Boolean topologies. A variety ${\cal V}$ is standard if every Boolean topological algebra with the algebraic reduct in ${\cal V}$ is profinite.

We show that there is no algorithm which takes as input a finite algebra A of a finite type and decide whether the variety $V\left( {\bf{A}} \right)$ generated by A is standard. We also show the undecidability of some related properties. In particular, we solve a problem posed by Clark, Davey, Freese, and Jackson.

We accomplish this by combining two results. The first one is Moore’s theorem saying that there is no algorithm which takes as input a finite algebra A of a finite type and decides whether $V\left( {\bf{A}} \right)$ has definable principal subcongruences. The second is our result saying that possessing definable principal subcongruences yields possessing finitely determined syntactic congruences for varieties. The latter property is known to yield standardness.

Givant [6] generalized the notion of an atomic pair-dense relation algebra from Maddux [13] by defining the notion of a measurable relation algebra, that is to say, a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the “size” of each such atom can be defined in an intuitive and reasonable way (within the framework of the first-order theory of relation algebras). In Andréka--Givant [2], a large class of examples of such algebras is constructed from systems of groups, coordinated systems of isomorphisms between quotients of the groups, and systems of cosets that are used to “shift” the operation of relative multiplication. In Givant--Andréka [8], it is shown that the class of these full coset relation algebras is adequate to the task of describing all measurable relation algebras in the sense that every atomic and complete measurable relation algebra is isomorphic to a full coset relation algebra.

Call an algebra $\mathfrak{A}$ a coset relation algebra if $\mathfrak{A}$ is embeddable into some full coset relation algebra. In the present article, it is shown that the class of coset relation algebras is equationally axiomatizable (that is to say, it is a variety), but that no finite set of sentences suffices to axiomatize the class (that is to say, the class is not finitely axiomatizable).

We present a logical and algebraic description of right adjoint functors between generalized quasi-varieties, inspired by the work of McKenzie on category equivalence. This result is achieved by developing a correspondence between the concept of adjunction and a new notion of translation between relative equational consequences.

Let A ≤ B be structures, and ${\cal K}$ a class of structures. An element b ∈ B is dominated by A relative to ${\cal K}$ if for all ${\bf{C}} \in {\cal K}$ and all homomorphisms g, g' : B → C such that g and g' agree on A, we have gb = g'b. Our main theorem states that if ${\cal K}$ is closed under ultraproducts, then A dominates b relative to ${\cal K}$ if and only if there is a partial function F definable by a primitive positive formula in ${\cal K}$ such that FB(a1,…,an) = b for some a1,…,an ∈ A. Applying this result we show that a quasivariety of algebras ${\cal Q}$ with an n-ary near-unanimity term has surjective epimorphisms if and only if $\mathbb{S}\mathbb{P}_n \mathbb{P}_u \left( {\mathcal{Q}_{{\text{RSI}}} } \right)$ has surjective epimorphisms. It follows that if ${\cal F}$ is a finite set of finite algebras with a common near-unanimity term, then it is decidable whether the (quasi)variety generated by ${\cal F}$ has surjective epimorphisms.

It is shown that Tarski’s set of ten axioms for the calculus of relations is independent in the sense that no axiom can be derived from the remaining axioms. It is also shown that by modifying one of Tarski’s axioms slightly, and in fact by replacing the right-hand distributive law for relative multiplication with its left-hand version, we arrive at an equivalent set of axioms which is redundant in the sense that one of the axioms, namely the second involution law, is derivable from the other axioms. The set of remaining axioms is independent. Finally, it is shown that if both the left-hand and right-hand distributive laws for relative multiplication are included in the set of axioms, then two of Tarski’s other axioms become redundant, namely the second involution law and the distributive law for converse. The set of remaining axioms is independent and equivalent to Tarski’s axiom system.

Let ($\rm L$;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of ($\rm L$;C), i.e., the structures with domain $\rm L$ that are first-order definable in ($\rm L$;C). We show that up to existential interdefinability, there are finitely many such reducts. This implies that there are finitely many reducts up to first-order interdefinability, thus confirming a conjecture of Simon Thomas for the special case of ($\rm L$;C). We also study the endomorphism monoids of such reducts and show that they fall into four categories.

We give an exposition of results of Baldwin–Shelah [2] on saturated free algebras, at the level of generality of complete first order theories T with a saturated model M which is in the algebraic closure of an indiscernible set. We then make some new observations when M is a saturated free algebra, analogous to (more difficult) results for the free group, such as a description of forking.

In this paper we show that every locally finite strongly Abelian variety satisfies the Hamiltonian property. An algebra is Hamiltonian if every one of its subuniverses is a block of some congruence of the algebra. A counterexample is provided to show that not all strongly Abelian varieties are Hamiltonian.