The pasting constructions for effect algebras

The aim of this paper is to present several techniques of constructing a lattice-ordered effect algebra from a given family of lattice-ordered effect algebras, and to study the structure of finite lattice-ordered effect algebras. Firstly, we prove that any finite MV-effect algebra can be obtained by substituting the atoms of some Boolean algebra by linear MV-effect algebras. Then some conditions which can guarantee that the pasting of a family of effect algebras is an effect algebra are provided. At last, we prove that any finite lattice-ordered effect algebra E without atoms of type 2 can be obtained by substituting the atoms of some orthomodular lattice by linear MV-effect algebras. Furthermore, we give a way how to paste a lattice-ordered effect algebra from the family of MV-effect algebras.     

Generalized Specker lattice-ordered groups and two types of distributivity

Let A be a lattice-ordered group, B a generalized Boolean algebra. The Boolean extension A _B of A has been investigated in the literature; we will refer to A _B as a generalized Specker lattice-ordered group (namely, if A is the linearly ordered group of all integers, then A _B is a Specker lattice-ordered group). The paper establishes that some distributivity laws extend from A _B to both A and B, and (under certain circumstances) also conversely.     

Monotonely Cauchy locally-solid topologies

The lattice of monotonely Cauchy (=pre-Lebesgue) locally solid topologies on a given lattice-ordered group is studied. Indentifying topologies agreeing on order bounded sets this lattice becomes a complete Boolean algebra isomorphic to the subalgebra of the lattice's complemented members and realizable as a Boolean algebra of order projections. Some consequences of these results are indicated.Work done while Tim Traynor was visiting professor at University of Napoli sponsored by CNR-Italia.     

Lattice-Ordered Matrix Rings Over Totally Ordered Rings

For an n ×n matrix algebra over a totally ordered integral domain, necessary and sufficient conditions are derived such that the entrywise lattice order on it is the only lattice order (up to an isomorphism) to make it into a lattice-ordered algebra in which the identity matrix is positive. The conditions are then applied to particular integral domains. In the second part of the paper we consider n ×n matrix rings containing a positive n-cycle over totally ordered rings. Finally a characterization of lattice-ordered matrix ring with the entrywise lattice order is given.     

On generalized inverses of Boolean Matrices

Generalized inverses of Boolean Matrices are defined and the general form of matrices having generalized inverses is determined. Some structure theorems are proved, from which, some known results are obtained as corollaries. An algorithm to compute a generalized inverse of a matrix, when it exists, is given. The existence of various types of g-inverses is also investigated. All the results are obtained first for the {0,1}-Boolean algebra and then extended to an arbitrary Boolean algebra.     

Zero-separating algebras of continuous functions

Let A be a lattice-ordered algebra endowed with a topology compatible with the structure of algebra. We provide internal conditions for A to be isomorphic as lattice-ordered algebras and homeomorphic to Ck(X), the lattice-ordered algebra C(X) of real continuous functions on a completely regular and Hausdorff topological space X, endowed with the topology of uniform convergence on compact sets. As a previous step, we determine this topology among the locally m-convex topologies on C(X) with the property that each order closed interval is bounded.     

A refinement of Stone duality to skew Boolean algebras

We establish two theorems that refine the classical Stone duality between generalized Boolean algebras and locally compact Boolean spaces. In the first theorem, we prove that the category of left-handed skew Boolean algebras whose morphisms are proper skew Boolean algebra homomorphisms is equivalent to the category of étale spaces over locally compact Boolean spaces whose morphisms are étale space cohomomorphisms over continuous proper maps. In the second theorem, we prove that the category of left-handed skew Boolean -algebras whose morphisms are proper skew Boolean -algebra homomorphisms is equivalent to the category of étale spaces with compact clopen equalizers over locally compact Boolean spaces whose morphisms are injective étale space cohomomorphisms over continuous proper maps.     

Regular Unital Finite-Dimensional Lattice-Ordered Algebras

The main result in this article is to show that a regular unital finite-dimensional lattice-ordered algebra over ? with zero ?-radical is isomorphic to a finite direct sum of lattice-ordered matrix algebras of lattice-ordered group algebras of finite groups over ?.     

Algebraic aspects of generalized approximation spaces

The concept of approximation spaces is a key notion of rough set theory, which is an important tool for approximate reasoning about data. This paper concerns algebraic aspects of generalized approximation spaces. Concepts of R-open sets, R-closed sets and regular sets of a generalized approximation space (U,R) are introduced. Algebraic structures of various families of subsets of (U,R) under the set-inclusion order are investigated. Main results are: (1) The family of all R-open sets (respectively, R-closed sets, R-clopen sets) is both a completely distributive lattice and an algebraic lattice, and in addition a complete Boolean algebra if relation R is symmetric. (2) The family of definable sets is both an algebraic completely distributive lattice and a complete Boolean algebra if relation R is serial. (3) The collection of upper (respectively, lower) approximation sets is a completely distributive lattice if and only if the involved relation is regular. (4) The family of regular sets is a complete Boolean algebra if the involved relation is serial and transitive.     

On generalized Boolean functions i

In this paper we introduce the concept of generalized Boolean function. Such a function has its arguments and values in a Boolean algebra and can be written in a manner similar to the canonical disjunctive form, but instead of the product of simple or complemented variables, the product of values of certain functions is used. Every Boolean function is a generalized Boolean one but the converse is not true. The set of all generalized Boolean function “generated” by some fixed function is a Boolean algebra.     

Finite-dimensional <Emphasis Type="Italic">ℓ</Emphasis>-simple lattice-ordered algebras with a <Emphasis Type="Italic">d</Emphasis>-basis

It is shown that a unital finite-dimensional ℓ-simple ℓ-algebra with a distributive basis is isomorphic to a lattice-ordered matrix algebra with the entrywise lattice order over a lattice-ordered twisted group algebra of a finite group with the coordinatewise lattice order. It is also shown that the isomorphism is unique.     

Prime Radicals of Lattice κ-Ordered Algebras

The Kopytov order for any algebra over a field is considered. Necessary and sufficient conditions for an algebra to be a linearly ordered algebra are presented. Some results concerning the properties of ideals of linearly ordered algebras are obtained. Some examples of algebras with the Kopytov order are described. The Kopytov order for these examples induces the order on other algebraic objects. The purpose of this paper is to investigate a generalization of the concept of prime radical to lattice-ordered algebras over partially ordered fields. Prime radicals of l-algebras over partially ordered and directed fields are described. Some results concerning the properties of the lower weakly solvable l-radical of l-algebras are obtained. Necessary and sufficient conditions for the l-prime radical of an l-algebra to be equal to the lower weakly solvable l-radical of the l-algebra are presented.     

Implicative twist-structures

The twist-structure construction is used to represent algebras related to non-classical logics (e.g., Nelson algebras, bilattices) as a special kind of power of better-known algebraic structures (distributive lattices, Heyting algebras). We study a specific type of twist-structure (called implicative twist-structure) obtained as a power of a generalized Boolean algebra, focusing on the implication-negation fragment of the usual algebraic language of twist-structures. We prove that implicative twist-structures form a variety which is semisimple, congruence-distributive, finitely generated, and has equationally definable principal congruences. We characterize the congruences of each algebra in the variety in terms of the congruences of the associated generalized Boolean algebra. We classify and axiomatize the subvarieties of implicative twist-structures. We define a corresponding logic and prove that it is algebraizable with respect to our variety.     

关于蕴涵BCK—代数的伴随半群

我们证明了蕴涵BCK-代数的伴随半群是一个上半格;具有条件（s)的蕴涵BCK-代数的伴随半群是一个广义布尔代数。更进一步证明了有界蕴涵BCK-代数的伴随半群是一个布尔代数。     

On generalized circulants over a Boolean algebra

For any given positive integer n, we give a necessary and sufficient condition for an n × nr-circulant (generalized circulant) over the Boolean algebra B = {0, 1} to be idempotent, and we present an algorith to obtain all n × n indempotent r-circulants over B for r = 0, 1,…,n ? 1.     

Lattice orders on matrix algebras

We construct all the lattice orders (up to isomorphism) on a full matrix algebra over a subfield of the field of real numbers so that it becomes a lattice-ordered algebra. Received June 26, 2001; accepted in final form February 9, 2002.     

SECOND-ORDER BOOLEAN ALGEBRAS

Opgedra aan Prof. Hennie Schutte by geleentheid van sy sestigste verjaarsdag.

Abstract

A Boolean algebra is the algebraic version of a field of sets. The complex algebra C(B) of a Boolean algebra B is defined over the power set of B; it is a field of sets with extra operations. The notion of a second-order Boolean algebra is intended to be the algebraic version of the complex algebra of a Boolean algebra. To this end a representation theorem is proved.     

Lattice orders on 2 × 2 triangular matrix algebras

We construct all the lattice orders on a 2 × 2 triangular matrix algebra over a totally ordered field that make it into a lattice-ordered algebra. It is shown that every lattice order in which the identity matrix is not positive may be obtained from a lattice order in which the identity matrix is positive.     

Lattice-ordered triangular matrix algebras

In this article we give some necessary and sufficient conditions for a lattice-ordered semigroup algebra to be isomorphic to a lattice-ordered triangular matrix algebra.     

On the shape of solution sets of systems of (functional) equations

Solution sets of systems of linear equations over fields are characterized as being affine subspaces. But what can we say about the “shape” of the set of all solutions of other systems of equations? We study solution sets over arbitrary algebraic structures, and we give a necessary condition for a set of n-tuples to be the set of solutions of a system of equations in n unknowns over a given algebra. In the case of Boolean equations we obtain a complete characterization, and we also characterize solution sets of systems of Boolean functional equations.