On the structure of generalized BL-algebras

A generalized BL - algebra (or GBL-algebra for short) is a residuated lattice that satisfies the identities . It is shown that all finite GBL-algebras are commutative, hence they can be constructed by iterating ordinal sums and direct products of Wajsberg hoops. We also observe that the idempotents in a GBL-algebra form a subalgebra of elements that commute with all other elements. Subsequently we construct subdirectly irreducible noncommutative integral GBL-algebras that are not ordinal sums of generalized MV-algebras. We also give equational bases for the varieties generated by such algebras. The construction provides a new way of order-embedding the lattice of -group varieties into the lattice of varieties of integral GBLalgebras. The results of this paper also apply to pseudo-BL algebras. This paper is dedicated to Walter Taylor. Received March 7, 2005; accepted in final form July 25, 2005.     

Lattice-theoretic properties of algebras of logic

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic. For a class of integral residuated lattices that includes Heyting algebras and semi-linear residuated lattices, we prove that a member of such is projectable iff the order dual of each subinterval [a,1]$[a,1]$ is a Stone lattice. We also show that an integral GMV algebra is projectable iff it can be endowed with a positive Gödel implication. In particular, a ΨMV or an MV algebra is projectable iff it can be endowed with a Gödel implication. Moreover, those projectable involutive residuated lattices that admit a Gödel implication are investigated as a variety in the expanded signature. We establish that this variety is generated by its totally ordered members and is a discriminator variety.     

Topological duality for Tarski algebras

In this paper we will generalize the representation theory developed for finite Tarski algebras given in [7]. We will introduce the notion of Tarski space as a generalization of the notion of dense Tarski set, and we will prove that the category of Tarski algebras with semi-homomorphisms is dually equivalent to the category of Tarski spaces with certain closed relations, called T-relations. By these results we will obtain that the algebraic category of Tarski algebras is dually equivalent to the category of Tarski spaces with certain partial functions. We will apply these results to give a topological characterization of the subalgebras. Received August 21, 2005; accepted in final form December 5, 2006.     

Embedding theorems for classes of GBL-algebras

The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBL-algebras have poset product embeddings where the poset is a root system. We also give a Conrad-Harvey-Holland-style embedding theorem for commutative GBL-algebras, where the poset factors are the real numbers extended with −∞. Finally, an explicit construction of a generic commutative GBL-algebra is given, and it is shown that every normal GBL-algebra embeds in the conucleus image of a GMV-algebra.     

Injectives in residuated algebras

Injectives in several classes of structures associated with logic are characterized. Among the classes considered are residuated lattices, MTL-algebras, IMTL-algebras, BL-algebras, NM-algebras and bounded hoops.     

A Gentzen system for involutive residuated lattices

We establish a cut-free Gentzen system for involutive residuated lattices and provide an algebraic proof of completeness. As a result we conclude that the equational theory of involutive residuated lattices is decidable. The connection to noncommutative linear logic is outlined. Received July 22, 2004; accepted in final form July 19, 2005.     

Algebraic lattices and Boolean algebras

In this paper we establish several equivalent conditions for an algebraic lattice to be a finite Boolean algebra. This paper is dedicated to Walter Taylor. Received February 11, 2005; accepted in final form October 9, 2005.     

The depth of ultraproducts of Boolean algebras

We show that if μ is a compact cardinal then the depth of ultraproducts of less than μ many Boolean algebras is at most μ plus the ultraproduct of the depths of those Boolean algebras. Received May 18, 2004; accepted in final form December 9, 2004.     

Free Boolean algebras over unions of two well orderings

Given a partially ordered set P there exists the most general Boolean algebra which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over posets of the form P=P₀∪P₁, where P₀, P₁ are well orderings. We call them nearly ordinal algebras.Answering a question of Maurice Pouzet, we show that for every uncountable cardinal κ there are κ² pairwise non-isomorphic nearly ordinal algebras of cardinality κ.Topologically, free Boolean algebras over posets correspond to compact 0-dimensional distributive lattices. In this context, we classify all closed sublattices of the product (ω₁+1)×(ω₁+1), showing that there are only ℵ₁ many types. In contrast with the last result, we show that there are ℵ₁² topological types of closed subsets of the Tikhonov plank (ω₁+1)×(ω+1).     

Weak effect algebras

Weak effect algebras are based on a commutative, associative and cancellative partial addition; they are moreover endowed with a partial order which is compatible with the addition, but in general not determined by it. Every BL-algebra, i.e. the Lindenbaum algebra of a theory of Basic Logic, gives rise to a weak effect algebra; to this end, the monoidal operation is restricted to a partial cancellative operation. We examine in this paper BL-effect algebras, a subclass of the weak effect algebras which properly contains all weak effect algebras arising from BL-algebras. We describe the structure of BL-effect algebras in detail. We thus generalise the well-known structure theory of BL-algebras. Namely, we show that BL-effect algebras are subdirect products of linearly ordered ones and that linearly ordered BL-effect algebras are ordinal sums of generalised effect algebras. The latter are representable by means of linearly ordered groups. This research was partially supported by the German Science Foundation (DFG) as part of the Collaborative Research Center “Computational Intelligence” (SFB 531).     

Archimedeanness and the MacNeille completion of pseudoeffect algebras and po-groups

Pseudoeffect (PE-) algebras are partial algebras differing from effect algebras in that they need not satisfy the commutativity assumption. PE-algebras typically arise from intervals of po-groups; this applies in particular to all those which satisfy a certain Riesz property.In this paper, we discuss the property of archimedeanness for PE-algebras on the one hand and for po-groups on the other hand. We prove that under the assumption of suphomogeneity, archimedeanness holds for a PE-algebra with the Riesz property if and only if it holds for its representing group. The algebra is in that case commutative. This result is established by using the technique of MacNeille completion. We give the exact condition for this completion to exist, and we clearly exhibit the role played by archimedeanness and by sup-homogeneity.     

Pseudo-trees and Boolean algebras

We consider Boolean algebras constructed from pseudo-trees in various ways and make comments about related classes of Boolean algebras.     

Ordered groups with a conucleus

Our work proposes a new paradigm for the study of various classes of cancellative residuated lattices by viewing these structures as lattice-ordered groups with a suitable operator (a conucleus). One consequence of our approach is the categorical equivalence between the variety of cancellative commutative residuated lattices and the category of abelian lattice-ordered groups endowed with a conucleus whose image generates the underlying group of the lattice-ordered group. In addition, we extend our methods to obtain a categorical equivalence between -algebras and product algebras with a conucleus. Among the other results of the paper, we single out the introduction of a categorical framework for making precise the view that some of the most interesting algebras arising in algebraic logic are related to lattice-ordered groups. More specifically, we show that these algebras are subobjects and quotients of lattice-ordered groups in a “quantale like” category of algebras.     

A condition for constructing formally real monoid algebras

In this paper we demonstrate that every positive totally ordered commutative monoid on 2 generators satisfying a weak cancellation property is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. In [1], the current author, along with Evans, Konikoff, Mathis, and Madden, employed the work of Hion, [5], to demonstrate that the monoid ring of all finite formal sums over a totally ordered domain is a formally real totally ordered ring providing the totally ordered monoid satisfies this weak cancellation property and is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. Therefore, we provide here significant information about a condition for the construction of formally real totally ordered monoid algebras. Received November 4, 2003; accepted in final form November 18, 2004.     

Minimally generated Boolean algebras

We introduce the class of minimally generated Boolean algebras, i.e. those algebras representable as the union of a continuous well-ordered chain of subalgebras A ₁ where A _i+1 is a minimal extension of A _i. Minimally generated algebras are closely related to interval algebras and superatomic algebras.     

Boolean inequations

In this paper we consider Boolean inequations i.e. the inequations of the form f(X)≠0, where f is a Boolean function. The basic idea in this paper is: the inequation f(X)≠0 means that there exists p such that f(X)=p and p≠0. We give the formula which determines all the solutions of Boolean inequation.     

Ordinal decompositions for preordered root systems

In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These decompositions are examples of ordinal decompositions in relatively normal lattices as introduced by Snodgrass, Tsinakis, and Hart. We conclude the paper with an application to information systems.     

Ordering groups and validity in lattice-ordered groups

An inductive characterization is given of the subsets of a group that extend to the positive cone of a right order on the group. This characterization is used to relate validity of equations in lattice-ordered groups (?-groups) to subsets of free groups that extend to the positive cone of a right order. As a consequence, new proofs are obtained of the decidability of the word problem for free ?-groups and generation of the variety of ?-groups by the ?-group of automorphisms of the real line. An inductive characterization is also given of the subsets of a group that extend to the positive cone of an order on the group. In this case, the characterization is used to relate validity of equations in varieties of representable ?-groups to subsets of relatively free groups that extend to the positive cone of an order.