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)     

Equational fragments of systems for arithmetic

We investigate the equational fragments of formal systems for arithmetic by means of the equational theory of f-rings and of their positive cones, starting from the observation that a model of arithmetic is the positive cone of a discretely ordered ring. A consequence of the discreteness of the order is the presence of a discriminator, which allows us to derive many properties of the models of our equational theories. For example, the spectral topology of discrete f-rings is a Stone topology. We also characterize the equational fragment of Iopen, and we obtain an equational version of G?del's First Incompleteness Theorem. Finally, we prove that the lattice of subvarieties of the variety of discrete f-rings is uncountable, and that the lattice of filters of the countably generated distributive free lattice can be embedded into it. Received April 17, 1998; accepted in final form January 23, 2001.     

On the covering relation in the interpretability lattice of equational theories

We prove that the chapter in the interpretability lattice represented by the equational theory of Boolean algebras has a unique cover in the lattice. We conjecture that, among chapters represented by equational theories of two-element algebras, this is the only one to have a cover. Also, we prove that the chapter represented by the equational theory of Abelian groups has no cover.Presented by W. Taylor.Research supported by a Ulam Research Professorship at the University of Colorado and by NSF Grant DMS 89 04014.     

Equational classes of f-rings with unit: disconnected classes

This paper introduces several families of equational classes of unital f-rings that are defined by equations that impose conditions on the elements between 0 and 1. We investigate the portion of the lattice of equational classes of f-rings that involves these classes.     

Structural diversity in the lattice of equational theories

This paper is principally concerned with conditions under which various partition lattices are isomorphic to intervals in either the lattice of equational theories extending a given equational theory or the lattice of subtheories of a given equational theory. This paper is for Elizabeth Eldridge. Presented by W. Taylor.     

Definability in the lattice of equational theories of commutative semigroups

In this paper we study first-order definability in the lattice of equational theories of commutative semigroups. In a series of papers, J. Jezek, solving problems posed by A. Tarski and R. McKenzie, has proved, in particular, that each equational theory is first-order definable in the lattice of equational theories of a given type, up to automorphism, and that such lattices have no automorphisms besides the obvious syntactically defined ones (with exceptions for special unary types). He has proved also that the most important classes of theories of a given type are so definable. In a later paper, Jezek and McKenzie have ``almost proved" the same facts for the lattice of equational theories of semigroups. There were good reasons to believe that the same can be proved for the lattice of equational theories of commutative semigroups. In this paper, however, we show that the case of commutative semigroups is different.

     

Non-covering in the interpretability lattice of equational theories

We prove a general theorem which implies that many members of the interpretability lattice — including the least element of the lattice, the element represented by the theory with one constant and no axioms, and the equational theory of semilattices — have no cover in the lattice.Presented by R. W. Quackenbush.Research supported by National Science Foundation Grant DMS 89 04014.     

Complements in lattices of varieties and equational theories

We investigate various weak conditions ensuring that a lattice be complemented. Using these general results in connection with a famous result due to Lampe, we show that the lattice of all equational theories containing a fixed theory must be complemented if it is lower semicomplemented, thereby answering in the affirmative a question raised by Volkov and Vernikov. Moreover, such a lattice must be a finite Boolean algebra if it has one of the following properties: upper or lower sectionally complemented; incomparably complemented; lower semicomplemented and lower semimodular; or atomistic and upper semimodular.Presented by R. Freese.     

A property of the lattice of equational theories

It had been conjectured that any algebraic lattice having a compact one could be represented as the lattice of equational theories extending some theory. However, we show that each lattice having such a representation satisfies a nontrivial quasidistributivity condition. In particular,M ₃ has no such representation.To the memory of András HuhnPresented by Walter Taylor.     

MacNeille completions of lattice expansions

There are two natural ways to extend an arbitrary map between (the carriers of) two lattices, to a map between their MacNeille completions. In this paper we investigate which properties of lattice maps are preserved under these constructions, and for which kind of maps the two extensions coincide. Our perspective involves a number of topologies on lattice completions, including the Scott topologies and topologies that are induced by the original lattice. We provide a characterization of the MacNeille completion in terms of these induced topologies. We then turn to expansions of lattices with additional operations, and address the question of which equational properties of such lattice expansions are preserved under various types of MacNeille completions that can be defined for these algebras. For a number of cases, including modal algebras and residuated (ortho)lattice expansions, we provide reasonably sharp sufficient conditions on the syntactic shape of equations that guarantee preservation. Generally, our results show that the more residuation properties the primitive operations satisfy, the more equations are preserved. Received August 21, 2005; accepted in final form October 17, 2006.     

Monadic MV-algebras II: Monadic implicational subreducts

In this paper, we study the class of all monadic implicational subreducts, that is, the ${\{\rightarrow, \forall,1\}}$ -subreducts of the class of monadic MV-algebras. We prove that this class is an equational class, which we denote by ${\mathcal{ML}}$ , and we give an equational basis for this variety. An algebra in ${\mathcal{ML}}$ is called a monadic ?ukasiewicz implication algebra. We characterize the subdirectly irreducible members of ${\mathcal{ML}}$ and the congruences of every monadic ?ukasiewicz implication algebra by monadic filters. We prove that ${\mathcal{ML}}$ is generated by its finite members. Finally, we completely describe the lattice of subvarieties, and we give an equational basis for each proper subvariety.     

Equational Classes of Totally Ordered Modal Lattices

A modal lattice is a bounded distributive lattice endowed with a unary operator which preserves the join-operation and the smallest element. In this paper we consider the variety CH of modal lattices that is generated by the totally ordered modal lattices and we characterize the lattice of subvarieties of CH. We also give an equational basis for each subvariety of CH.     

Some subdirectly irreducible idempotent semigroups

Subdirectly irreducible idempotent semigroups were characterized in [3], and in that paper, their connection with the various equational classes of idempotent semigroups was discussed. All these results are in terms of identities, so that examples of subdirectly irreducibles in the equational classes are explicitly known only for small classes. It is easy to show from general considerations (see the last section of the present paper) that every proper equational subclass of the class of idempotent semigroups is generated (as an equational class) by one or two subdirectly irreducibles. In this paper we give an example of a subdirectly irreducible for each join irreducible equational class of idempotent semigroups, which generates the class. This list, together with known results, gives explicit examples of one or two finite subdirectly irreducibles which generate the various equational classes. Research supported by the National Research Council of Canada.     

Notes on equational theories of relations

We describe explicitly the free algebras in the equational class generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure and neutral elements 0 (empty relation) and 1 (identity relation). We show the corresponding equational theory is decidable by reducing the problem to a question about regular sets. Similar results are given for two related equational theories.Presented by R. W. Quackenbush.Partially supported by a joint grant from the NSF and the Hungarian Academy of Sciences.Partially supported by a grant from the Hungarian National Foundation for Scientific Research and a joint grant from the NSF and the Hungarian Academy of Sciences. ^v-semirings of 1-closed regular sets. On the basis of this characterization, we conjectured that a set of equational axioms for the variety REL^v consists of equational axioms for the variety L^v and the equation (10). Recently, this conjecture has been proved in [6].     

Idempotent distributive semirings II

In [2] it is shown that every idempotent distributive semiring is the P?onka sum of a semilattice ordered system of idempotent distributive semirings which satisfy the generalized absorption law x+xyx+x=x. We shall show that an idempotent distributive semiring which satisfies the above absorption law must be a subdirect product of a distributive lattice and a semiring which satisfies the additional identity xyx+x+xyx=xyx. Using this, we construct the lattice of all equational classes of idempotent distributive semirings for which the two reducts are normal bands.     

Algebraic geometry over algebraic structures. IV. Equational domains and codomains

We introduce and study equational domains and equational codomains. Informally, an equational domain is an algebra every finite union of algebraic sets over which is an algebraic set; an equational codomain is an algebra every proper finite union of algebraic sets over which is not an algebraic set.     

Antivarieties and colour-families of graphs

We suggest an algebraic approach to the study of colour-families of graphs. This approach is based on the notion of a congruence of an arbitrary structure. We prove that every colour-family of graphs is a finitely generated universal Horn class and show that for every colour-family the universal theory is decidable. We study the structure of the lattice of colour-families of graphs and the lattice of antivarieties of graphs. We also consider bases of quasi-identities and bases of anti-identities for colour-families and find certain relations between the existence of bases of a special form and problems in graph theory. Received January 19, 1999; accepted in final form October 25, 1999.     

Gentzen-style axiomatizations in equational logic

The notion of a Gentzen-style axiomatization of equational theories is presented. In the standard deductive systems for equational logic axioms take the form of equations and the inference rules can be viewed as quasi-equations. In the deductive systems for quasi-equational logic the axioms, which are quasi-equations, can be viewed as sequents and the inference rules as Gentzen-style rules. It is conjectured that every finite algebra has a finite Gentzen-style axiomatization for its quasi-identities. We verify this conjecture for a class of algebras that includes all finite algebras without proper subalgebras and all finite simple algebras that are embeddable into the free algebra of their variety.Dedicated to the memory of Alan DayPresented by J. Sichler.Supported by an Iowa State University Research Assistantship.Supported by National Science Foundation Grant #DMS 8005870.     

Decidability of Equational Theories of Coverings of Semigroup Varieties

For every proper semigroup variety X, there exists a semigroup variety Y satisfying the following three conditions: (1) Y covers X, (2) if X is finitely based then so is Y, and (3) the equational theory of X is decidable if and only if so is the equational theory of Y. If X is an arbitrary semigroup variety defined by identities depending on finitely many variables and such that all periodic groups of X are locally finite, then one of the following two conditions holds: (1) all nilsemigroups of X are locally finite and (2) X includes a subvariety Y whose equational theory is undecidable and which has infinitely many covering varieties with undecidable equational theories.     

Covering in the lattice of equational theories and some properties of term finite theories

For countable languages, we completely describe those cardinals κ such that there is an equational theory which covers exactly κ other equational theories. For this task understanding term finite theories is helpful. A theoryT isterm finite provided {ψ:Tτϕ≈ψ} is finite for all terms ϕ. We develop here some fundamental properties of term finite theories and use them, together with Ramsey's Theorem, to prove that any finitely based term finite theory covers only finitely many others. We also show that every term finite theory possesses an independent base and that there are such theories whose pairwise joins are not term finite. The paper was written with the support of NSF Grant MCS-80-01778. Presented by B. Jónsson. Received July 22, 1980. Accepted for publication in final form March 19, 1981.