We study the variety Var() of lattice-ordered monoids generated by the natural numbers. In particular, we show that it contains all 2-generated positively ordered lattice-ordered monoids satisfying appropriate distributive laws. Moreover, we establish that the cancellative totally ordered members of Var() are submonoids of ultrapowers of and can be embedded into ordered fields. In addition, the structure of ultrapowers relevant to the finitely generated case is analyzed. Finally, we provide a complete isomorphy invariant in the two-generated case.

It has been recently shown [4] that the lattice effect algebras can be treated as a subvariety of the variety of so-called basic algebras. The open problem whether all subdirectly irreducible distributive lattice effect algebras are just subdirectly irreducible MV-chains and the horizontal sum of two 3-element chains is in the paper transferred into a more tractable one. We prove that modulo distributive lattice effect algebras, the variety generated by MV-algebras and is definable by three simple identities and the problem (...) now is to check if these identities are satisfied by all distributive lattice effect algebras or not. (shrink)

We establish the existence uncountably many atoms in the subvariety lattice of the variety of involutive residuated lattices. The proof utilizes a construction used in the proof of the corresponding result for residuated lattices and is based on the fact that every residuated lattice with greatest element can be associated in a canonical way with an involutive residuated lattice.

Let ${\mathbb{BRL}}$ denote the variety of commutative integral bounded residuated lattices (bounded residuated lattices for short). A Boolean retraction term for a subvariety ${\mathbb{V}}$ of ${\mathbb{BRL}}$ is a unary term t in the language of bounded residuated lattices such that for every ${{\bf A} \in \mathbb{V}, t^{A}}$ , the interpretation of the term on A, defines a retraction from A onto its Boolean skeleton B(A). It is shown that Boolean retraction terms are equationally definable, in the sense (...) that there is a variety ${\mathbb{V}_{t} \subsetneq \mathbb{BRL}}$ such that a variety ${\mathbb{V} \subsetneq \mathbb{BRL}}$ admits the unary term t as a Boolean retraction term if and only if ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ . Moreover, the equation s(x) = t(x) holds in ${\mathbb{V}_{s} \cap \mathbb{V}_{t}}$ . The radical of ${{\bf A} \in \mathbb{BRL}}$ , with the structure of an unbounded residuated lattice with the operations inherited from A expanded with a unary operation corresponding to double negation and a a binary operation defined in terms of the monoid product and the negation, is called the radical algebra of A. To each involutive variety ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ is associated a variety ${\mathbb{V}^{r}}$ formed by the isomorphic copies of the radical algebras of the directly indecomposable algebras in ${\mathbb{V}}$ . Each free algebra in such ${\mathbb{V}}$ is representable as a weak Boolean product of directly indecomposable algebras over the Stone space of the free Boolean algebra with the same number of free generators, and the radical algebra of each directly indecomposable factor is a free algebra in the associated variety ${\mathbb{V}^{r}}$ , also with the same number of free generators.A hierarchy of subvarieties of ${\mathbb{BRL}}$ admitting Boolean retraction terms is exhibited. (shrink)

We show that the variety of residuated lattices is generated by its finite simple members, improving upon a finite model property result of Okada and Terui. The reasoning is a blend of proof-theoretic and algebraic arguments.

Given a variety we study the existence of a class such that S1 every A can be represented as a global subdirect product with factors in and S2 every non-trivial A is globally indecomposable. We show that the following varieties (and its subvarieties) have a class satisfying properties S1 and S2: p-algebras, distributive double p-algebras of a finite range, semisimple varieties of lattice expansions such that the simple members form a universal class (bounded distributive lattices, De Morgan (...) algebras, etc) and arithmetical varieties in which the finitely subdirectly irreducible algebras form a universal class (f-rings, vector groups, Wajsberg algebras, discriminator varieties, Heyting algebras, etc). As an application we obtain results analogous to that of Nachbin saying that if every chain of prime filters of a bounded distributive lattice has at most length 1, then the lattice is Boolean. (shrink)

We solve several open problems on the cardinality of atoms in the subvariety lattice of residuated lattices and FL-algebras [4, Problems 17—19, pp. 437]. Namely, we prove that the subvariety lattice of residuated lattices contains continuum many 4-potent commutative representable atoms. Analogous results apply also to atoms in the subvariety lattice of FL i -algebras and FL o -algebras. On the other hand, we show that the subvariety lattice of residuated lattices contains only five 3-potent commutative representable (...) atoms and two integral commutative representable atoms. Inspired by the construction of atoms, we are also able to prove that the variety of integral commutative representable residuated lattices is generated by its 1-generated finite members. (shrink)

The paper investigates completions in the context of finitely generated lattice-based varieties of algebras. In particular the structure of canonical extensions in such a variety $${\mathcal {A}}$$ is explored, and the role of the natural extension in providing a realisation of the canonical extension is discussed. The completions considered are Boolean topological algebras with respect to the interval topology, and consequences of this feature for their structure are revealed. In addition, we call on recent results from duality theory to (...) show that topological and discrete dualities for $${\mathcal {A}}$$ exist in partnership. (shrink)

We examine some extensions of the constructive propositional logic with strong negation in the setting of varieties of $\mathcal{N}$ -lattices. The main aim of the paper is to give a description of all pretabular, primitive and preprimitive varieties of $\mathcal{N}$ -lattices.

In any variety of bounded integral residuated lattice-ordered commutative monoids the class of its semisimple members is closed under isomorphic images, subalgebras and products, but it is not closed under homomorphic images, and so it is not a variety. In this paper we study varieties of bounded residuated lattices whose semisimple members form a variety, and we give an equational presentation for them. We also study locally representable varieties whose semisimple members form a variety. Finally, we analyze (...) the relationship with the property “to have radical term”, especially for k-radical varieties, and for the hierarchy of varieties k>0 defined in Cignoli and Torrens. (shrink)

We shall show that certain natural and interesting intervals in the lattice of varieties of representable relation algebras embed the lattice of all subsets of the natural numbers, and therefore must have a very complicated lattice-theoretic structure.

We prove that all semisimple varieties of FL ew-algebras are discriminator varieties. A characterisation of discriminator and EDPC varieties of FL ew-algebras follows. It matches exactly a natural classification of logics over FL ew proposed by H. Ono.

In this paper, we show that all semisimple varieties of bounded weak-commutative residuated lattices with an S4-like modal operator are discriminator varieties. We also give a characterization of discriminator and EDPC varieties of bounded weak-commutative residuated lattices with an S4-like modal operator follows.

A subresiduated lattice is a pair, where A is a bounded distributive lattice, D is a bounded sublattice of A and for every there exists the maximum of the set, which is denoted by. This pair can be regarded as an algebra of type (2, 2, 2, 0, 0), where. The class of subresiduated lattices is a variety which properly contains the variety of Heyting algebras. In this paper we study the subvariety of subresiduated lattices, denoted by, whose (...) members satisfy the equation. Inspired by the fact that in any subresiduated lattice whose order is total the previous equation and the condition for every are satisfied, we also study the subvariety of generated by the class whose members satisfy that for every. (shrink)

In this paper we prove that the free pseudocomplemented residuated lattices are decomposable if and only if they are Stone, i.e., if and only if they satisfy the identity ¬ x ∨ ¬¬ x = 1. Some applications are given.

In this paper we prove that the free pseudocomplemented residuated lattices are decomposable if and only if they are Stone, i.e., if and only if they satisfy the identity ¬x ∨ ¬¬x = 1. Some applications are given.

The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fit- ting), while others arose from the algebraic study of O. Arieli and A. Avron’s bilattice logics developed in the third author’s PhD dissertation. We extend the representation theorem for bounded interlaced bilattices (proved, among others, by A. Avron) to un- bounded bilattices and prove (...) analogous representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices. (shrink)

The paper has two parts preceded by quite comprehensive preliminaries.In the first part it is shown that a subvariety of the variety ${\cal T}$ of all tense algebras is discriminator if and only if it is semisimple. The variety ${\cal T}$ turns out to be the join of an increasing chain of varieties ${\cal D}_n$, which are discriminator varieties. The argument carries over to all finite type varieties of boolean algebras with operators satisfying some term conditions. In (...) the case of tense algebras, the varieties ${\cal D}_n$ can be further characterised by certain natural conditions on Kripke frames.In the second part it is shown that the lattice of subvarieties of ${\cal D}_0$ has two atoms, the lattice of subvarieties of ${\cal D}_1$ has countably many atoms, and for $n>1$, the lattice of subvarieties of ${\cal D}_n$ has continuum atoms. The proof of the second of the above statements involves a rather detailed description of zero-generated simple algebras in ${\cal D}_1$.Almost all the arguments are cast in algebraic form, but both parts begin with an outline describing their contents from the dual point of view of tense logics. (shrink)

The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may (...) be mapped by noninjective homomorphisms. The homomorphic preimages of C4 within DMM constitute a proper quasivariety, which is shown to have a largest subvariety U. The covers of the variety within U are revealed here. There are just ten of them. In exactly six of these ten varieties, all nontrivial members have C4 as a retract. In the varietal join of those six classes, every subquasivariety is a variety—in fact, every finite subdirectly irreducible algebra is projective. Beyond U, all covers of [or of ] within DMM are discriminator varieties. Of these, we identify infinitely many that are finitely generated, and some that are not. We also prove that there are just 68 minimal quasivarieties of De Morgan monoids. (shrink)

We study modal logics in the setting of varieties of modal algebras. Any variety of modal algebras generated by a finite algebra — such, a variety is called tabular — has only finitely many subvarieties, i.e. is of finite height. The converse does not hold in general. It is shown that the converse does hold in the lattice of varieties of K4-algebras. Hence the lower part of this lattice consists of tabular varieties only. We proceed to show (...) that there is a continuum of pretabular varieties of K4-algebras — those are the non-tabular varieties all of whose proper subvarieties are tabular — in contrast with Maksimova's result that there are only five pretabular varieties of S4-algebras. (shrink)

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.

The notion of a pseudo-interior algebra was introduced by Blok and Pigozzi in [BPIV]. We continue here our studies begun in [BK]. As a consequence of the representation theorem for pseudo-interior algebras given in [BK] we prove that the variety of all pseudo-interior algebras is generated by its finite members. This result together with Jónsson's Theorem for congruence distributive varieties provides a useful technique in the study of the lattice of varieties of pseudo-interior algebras.

A biresiduation algebra is a 〈/,\,1〉-subreduct of an integral residuated lattice. These algebras arise as algebraic models of the implicational fragment of the Full Lambek Calculus with weakening. We axiomatize the quasi-variety B of biresiduation algebras using a construction for integral residuated lattices. We define a filter of a biresiduation algebra and show that the lattice of filters is isomorphic to the lattice of B-congruences and that these lattices are distributive. We give a finite basis of terms for (...) generating filters and use this to characterize the subvarieties of B with EDPC and also the discriminator varieties. A variety generated by a finite biresiduation algebra is shown to be a subvariety of B. The lattice of subvarieties of B is investigated; we show that there are precisely three finitely generated covers of the atom. (shrink)

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties (...) of monadic Heyting algebras in detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC. (shrink)

This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of subvarieties (...) (Q 3 ) of the variety Q 3. (shrink)

This paper is devoted to the study of some subvarieties of the variety Q of Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q subscript 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Q is far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q subscript 3 and we construct (...) the lattice of subvarieties lambda (Q subscript 3) of the variety Q subscript 3. (shrink)

We study the structure of the partial order induced by the definability relation on definitions of truth for the language of arithmetic. Formally, a definition of truth is any sentence \(\alpha \) which extends a weak arithmetical theory (which we take to be \({{\,\mathrm{I\Delta _{0}+\exp }\,}}\) ) such that for some formula \(\Theta \) and any arithmetical sentence \(\varphi \), \(\Theta (\ulcorner \varphi \urcorner )\equiv \varphi \) is provable in \(\alpha \). We say that a sentence \(\beta \) is definable (...) in a sentence \(\alpha \), if there exists an unrelativized translation from the language of \(\beta \) to the language of \(\alpha \) which is identity on the arithmetical symbols and such that the translation of \(\beta \) is provable in \(\alpha \). Our main result is that the structure consisting of truth definitions which are conservative over the basic arithmetical theory forms a countable universal distributive lattice. Additionally, we generalize the result of Pakhomov and Visser showing that the set of (Gödel codes of) definitions of truth is not \(\Sigma _2\) -definable in the standard model of arithmetic. We conclude by remarking that no \(\Sigma _2\) -sentence, satisfying certain further natural conditions, can be a definition of truth for the language of arithmetic. (shrink)

In this paper we study the subdirectly irreducible algebras in the variety of pseudocomplemented De Morgan algebras by means of their De Morgan p‐spaces. We introduce the notion of the body of an algebra and determine when is subdirectly irreducible. As a consequence of this, in the case of pseudocomplemented Kleene algebras, two special subvarieties arise naturally, for which we give explicit identities that characterise them. We also introduce a subvariety of, namely the variety of bundle pseudocomplemented Kleene algebras, fully (...) describe its subvariety lattice and find explicit equational bases for each subvariety. In addition, we study the subvariety of generated by the simple members of, determine the structure of the free algebra over a finite set in this variety and their finite weakly projective algebras. (shrink)

In this paper we introduce a poset of subvarieties of BL-algebras, whose completion is the entire lattice of subvarietes; we exhibit also a description of this poset in terms of finite sequences of functions on the natural numbers.

It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K . It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that (...) for every integer $n \geq 2$ , the variety of all Heyting algebras of width at most n has a non-surjective epimorphism. Within the so-called Kuznetsov-Gerčiu variety (i.e., the variety generated by finite linear sums of one-generated Heyting algebras), we describe exactly the subvarieties that have surjective epimorphisms. This yields new positive examples, and an alternative proof of epimorphism surjectivity for all varieties of Gödel algebras. The results settle natural questions about Beth-style definability for a range of intermediate logics. (shrink)

The lattices of varieties were studied in many works (see [4], [5], [11], [24], [31]). In this paper we describe the lattice of all subvarieties of the variety $G_{Ex}^n$ defined by so called externally compatible identities of Abelian groups and the identity xⁿ ≈ yxⁿ. The notation in this paper is the same as in [2].

In this paper we pursue the study of the variety of m -generalized Łukasiewicz algebras of order n which was initiated in [1]. This variety contains the variety of Łukasiewicz algebras of order n . Given , we establish an isomorphism from its congruence lattice to the lattice of Stone filters of a certain Łukasiewicz algebra of order n and for each congruence on A we find a description via the corresponding Stone filter. We characterize the principal congruences on A (...) via Stone filters. In doing so, we obtain a polynomial equation which defines the principal congruences on the algebras of . After showing that for m > 1 and n > 2, the variety of Łukasiewicz algebras of order n is a proper subvariety of , we prove that is a finitely generated discriminator variety and point out some consequences of this strong property, one of which is congruence permutability. (shrink)

Given a positive universal formula in the language of residuated lattices, we construct a recursive basis of equations for a variety, such that a subdirectly irreducible residuated lattice is in the variety exactly when it satisfies the positive universal formula. We use this correspondence to prove, among other things, that the join of two finitely based varieties of commutative residuated lattices is also finitely based. This implies that the intersection of two finitely axiomatized substructural logics over FL (...) + is also finitely axiomatized. Finally, we give examples of cases where the join of two varieties is their Cartesian product. (shrink)

The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of non-trivial (0,1)-lattices belonging to the same variety with (0,1)-lattice homomorphisms as morphisms. Although the two categories coincide on their finite objects, the presented dualities essentially differ mostly but not only by the fact that the duality for the second category uses topology. Using the (...) presented dualities and some known in the literature results we prove that the Q-lattice of any non-trivial variety of (0,1)-lattices is either a 2-element chain or is uncountable and non-distributive. (shrink)

The Post, axled and Łukasiewicz–Moisil algebras are important lattices studied in algebraic logic. In this paper, we investigate a useful interpretation between these algebras and some rings. We give a term equivalence between Post algebras of order |$p$| and |$p$|-rings, |$p$| prime and lift this result to the axled Łukasiewicz–Moisil algebra |$L \cong B_s \times P$| and the ring |$\prod ^s F_2 \times \prod ^l F_p$|⁠, where |$B_s$| is a Boolean algebra of order |$2^s$|⁠, |$P$| a |$p$|-valued Post algebra (...) of order |$p^l$| and |$F_p$| is the prime field of order |$p$|⁠. (shrink)

We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail (...) Abelian ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”. (shrink)

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.

This book presents the foundations of a general theory of algebras. Often called “universal algebra”, this theory provides a common framework for all algebraic systems, including groups, rings, modules, fields, and lattices. Each chapter is replete with useful illustrations and exercises that solidify the reader's understanding. The book begins by developing the main concepts and working tools of algebras and lattices, and continues with examples of classical algebraic systems like groups, semigroups, monoids, and categories. The essence of the (...) book lies in Chapter 4, which provides not only basic concepts and results of general algebra, but also the perspectives and intuitions shared by practitioners of the field. The book finishes with a study of possible uniqueness of factorizations of an algebra into a direct product of directly indecomposable algebras. There is enough material in this text for a two semester course sequence, but a one semester course could also focus primarily on Chapter 4, with additional topics selected from throughout the text. (shrink)

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.

Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show (...) that there exists an immediate predecessor of classical logic (axiomatized by $p \leftrightarrow \square p$ ) which is not characterized by any finite algebra. The existence of modal logics having 2 ℵ 0 immediate predecessors is established. In contrast with these results we prove that the lattice of extensions of S4 behaves much better: a logic extending S4 is characterized by a finite algebra iff it has finitely many extensions and any such logic has only finitely many immediate predecessors, all of which are characterized by a finite algebra. (shrink)