On the structure of linearly ordered pseudo-BCK-algebras

Pseudo-BCK-algebras are a non-commutative generalization of well-known BCK-algebras. The paper describes a situation when a linearly ordered pseudo-BCK-algebra is an ordinal sum of linearly ordered cone algebras. In addition, we present two identities giving such a possibility of the decomposition and axiomatize the residuation subreducts of representable pseudo-hoops and pseudo-BL-algebras.     

A simple construction of representable relation algebras with non‐representable completions

We give a simple new construction of representable relation algebras with non‐representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Axiomatization of identity-free equations valid in relation algebras

A finite axiom set for the identity-free equations valid in relation algebras is given. This is a simplification of the one given by Jónsson, and confirms a conjecture of Tarski. An axiom set for the identity-free equations valid in the representable relation algebras is given, too. We show that in the class of representable relation algebras, both the operation of taking converse and the identity constant are finitely axiomatizable (over the rest of the operations).Dedicated to the memory of Alan DayPresented by J. Sichler.     

Weakly representable relation algebras form a variety

We prove that the class of weakly representable relation algebras is closed under homomorphic images, hence it is a variety. As a corollary we classify the subdirectly irreducible algebras in this class. Received April 3, 2007; accepted in final form February 7, 2008.     

Coset relation algebras

A measurable relation algebra is 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). A large class of examples of such algebras, using systems of groups and coordinated systems of isomorphisms between quotients of the groups, has been constructed. This class of group relation algebras is not large enough to exhaust the class of all measurable relation algebras. In the present article, the class of examples of measurable relation algebras is considerably extended by adding one more ingredient to the mix: systems of cosets that are used to “shift” the operation of relative multiplication. It is shown that, under certain additional hypotheses on the system of cosets, each such coset relation algebra with a shifted operation of relative multiplication is an example of a measurable relation algebra. We also show that the class of coset relation algebras does contain examples that are not representable as set relation algebras. In later articles, it is shown that the class of coset relation algebras is adequate to the task of describing all measurable relation algebras in the sense that every atomic measurable relation algebra is essentially isomorphic to a coset relation algebra, and the class of group relation algebras is similarly adequate to the task of representing all measurable relation algebras in which the associated groups are finite and cyclic.     

Relativized relation algebras

Relativization is one of the central topics in the study of algebras of relations (i.e. relation and cylindric algebras). Relativized representable relation algebras behave much nicer than the original class RAA: for instance, one obtains finite axiomatizability, decidability and amalgamation by relativization. The properties of the class obtained by relativizing RRA depend on the kind of element with which the algebras are relativized. We give a systematic account of all interesting choices of relativizing RRA, and show that relativizing with transitive elements forms the borderline where all above mentioned three properties switch from negative to positive. Received January 24, 1993; accepted in final form October 7, 1998.     

Bifunctional-elementary relation algebras

A relation algebra is bifunctional-elementary if it is atomic and for any atom a, the element a;1;a is the join of at most two atoms, and one of these atoms is bifunctional (an element x is bifunctional if ’). We show that bifunctional-elementary relation algebras are representable. Our proof combines the representation theorems for: pair-dense relation algebras given by R. Maddux; relation algebras generated by equivalence elements provided corresponding relativizations are representable by S. Givant; and strong-elementary relation algebras dealt with in our earlier work. It turns out that atomic pair-dense relation algebras are bifunctional elementary, showing that our theorem generalizes the representation theorem of atomic pair-dense relation algebras. The problem is still open whether the related classes of rather elementary, functional-elementary, and strong functional-elementary relation algebras are representable. Received July 15, 2007; accepted in final form March 17, 2008.     

Representations of polyadic-like equality algebras

Assuming the usual finite axiom schema of polyadic equality algebras, axiom (P10) is changed to a stronger version. It is proved that infinite dimensional, polyadic equality algebras satisfying the resulting system of axioms are representable. The foregoing stronger axiom is not given with a first order schema. The latter is to be expected knowing the negative results for the Halmos schema axiomatizability of the representable, infinite dimensional, polyadic equality algebras. Furthermore, Halmos’ well-known classical theorem that “locally finite polyadic equality algebras of infinite dimension α are representable” is generalized for locally-\({\mathfrak{m}}\) polyadic equality algebras, where \({\mathfrak{m}}\) is an arbitrary infinite cardinal and \({\mathfrak{m}}\) < α. Also, a neat embedding theorem is proved for the foregoing classes of polyadic-like equality algebras (a neat embedding theorem does not exists for polyadic equality algebras).     

On the variety question for wRRA

In this paper we consider a question of Jónsson [6] whether the class of weakly representable relation algebras is a variety. We prove that the class is closed under taking homomorphic images provided that a certain embedding condition obtains. Received June 21, 2005; accepted in final form October 17, 2006.     

Atom structures and Sahlqvist equations

This paper addresses the question for which varieties of boolean algebras with operators membership of an atomic algebra is determined by its atom structure . We prove a positive answer for conjugated Sahlqvist varieties; we also show that the conjugation condition is necessary. As a corollary to the positive result and a recent result by I. Hodkinson, we prove that the variety RRA of representable relation algebras, although canonical, cannot be axiomatized by Sahlqvist equations. Received February 21, 1996; accepted in final form October 1, 1997.     

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.     

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.     

On the equational complexity of RRA

We prove that the equational complexity function for the variety of representable relation algebras is bounded below by a log-log function.     

Weakly representable but not representable relation algebras

We prove the existence of non-representable relation algebras the union and complementation free reducts of which can be represented, i.e. which are weakly representable. This answers Problem 3 in Jónsson [4], and has consequences concerning the complexity of the equational theory of representable relation algebras.Presented by B. Jonsson.Research supported by Hungarian National Foundation for Scientific Research grants No. 1911 and No. T7255.     

Subreducts of MV-algebras with product and product residuation

Recently, MV-algebras with product have been investigated from different points of view. In particular, in [EGM01], a variety resulting from the combination of MV-algebras and product algebras (see [H98]) has been introduced. The elements of this variety are called ŁΠ-algebras. In this paper we treat subreducts of ŁΠ-algebras, with emphasis on quasivarieties of subreducts whose basic operations are continuous in the order topology. We give axiomatizations of the most interesting classes of subreducts, and we connect them with other algebraic classes of algebras, like f-rings and Wajsberg hoops, as well as to structures of co-infinitesimals of ŁΠ-algebras. In some cases, connections are given by means of equivalences of categories.Dedicated to the Memory of Wim BlokReceived June 19, 2002; accepted in final form November 29, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Necessary subalgebras of simple nonintegral semiassociative relation algebras

There are six finite nonintegral representable relation algebras such that every nonintegral simple semiassociative relation algebra has a nontrivial subalgebra isomorphic to one of those six.Presented by Bjarni Jónsson.     

Relational Representation of Groupoid Quantales

In Palmigiano and Re (J Pure Appl Algebra 215(8):1945–1957, 2011), spatial SGF-quantales are axiomatically introduced and proved to be representable as sub unital involutive quantales of quantales arising from set groupoids. In the present paper, spatial SGF-quantales of this class are shown to be optimally representable as unital involutive quantales of relations. The results of the present paper have several aspects in common with Jónsson and Tarski’s representation theory for relation algebras (Jónsson and Tarski, Am J Math 74(2):127–162, 1952).     

Loosely-abelian algebras

Abelianity has two different meanings in universal algebra. On the one hand, the term “abelian” is used interchangeably with “commutative” whilst on the other, an algebra is said to be abelian if for every term \({t(x, \overline{y})}\) and for all elements \({a, b, \overline{c}, \overline{d}}\) we have the following implication: \({t(a, \overline{c}) = t(a, \overline{d}) \Rightarrow t(b, \overline{c}) = t(b, \overline{d})}\). These two definitions are equivalent for groups but not generally. We will introduce the class of loosely-abelian algebras which for finite algebras is a generalization of both kinds of abelianity mentioned above. We will prove some basic properties of loosely-abelian algebras and using the introduced concept, we will characterize the subreducts of finite semilattices. Furthermore, we will present an algorithm which solves equations over loosely-abelian algebras.     

Narrowness implies uniformity

This paper is about varietiesV of universal algebras which satisfy the following numerical condition on the spectrum: there are only finitely many prime integersp such thatp is a divisor of the cardinality of some finite algebra inV. Such varieties are callednarrow. The variety (or equational class) generated by a classK of similar algebras is denoted by V(K)=HSPK. We define Pr (K) as the set of prime integers which divide the cardinality of a (some) finite member ofK. We callK narrow if Pr (K) is finite. The key result proved here states that for any finite setK of finite algebras of the same type, the following are equivalent: (1) SPK is a narrow class. (2) V(K) has uniform congruence relations. (3) SK has uniform congruences and (3) SK has permuting congruences. (4) Pr (V(K))= Pr(SK). A varietyV is calleddirectly representable if there is a finite setK of finite algebras such thatV= V(K) and such that all finite algebras inV belong to PK. An equivalent definition states thatV is finitely generated and, up to isomorphism,V has only finitely many finite directly indecomposable algebras. Directly representable varieties are narrow and hence congruence modular. The machinery of modular commutators is applied in this paper to derive the following results for any directly representable varietyV. Each finite, directly indecomposable algebra inV is either simple or abelian.V satisfies the commutator identity [x,y]=x·y·[1,1] holding for congruencesx andy over any member ofV. The problem of characterizing finite algebras which generate directly representable varieties is reduced to a problem of ring theory on which there exists an extensive literature: to characterize those finite ringsR with identity element for which the variety of all unitary leftR-modules is directly representable. (In the terminology of [7], the condition is thatR has finite representation type.) We show that the directly representable varieties of groups are precisely the finitely generated abelian varieties, and that a finite, subdirectly irreducible, ring generates a directly representable variety iff the ring is a field or a zero ring.