Initial Chain Algebras on Pseudotrees

We investigate a new class of Boolean algebra, called initial chain algebras on pseudotrees. We discuss the relationship between this class and other classes of Boolean algebras. Every interval algebra, and hence every countable Boolean algebra, is an initial chain algebra. Every initial chain algebra on a tree is a superatomic Boolean algebra, and every initial chain algebra on a pseudotree is a minimally-generated Boolean algebra.We show that a free product of two infinite Boolean algebras is an initial chain algebra if and only if both factors are countable.     

布尔代数的Fuzzy子代数和Fuzzy理想

引入了布尔代数的Fuzzy子代数、Fuzzy理想和Fuzzy商布尔代数的概念,给出了布尔代数的Fuzzy集是Fuzzy子代数(Fuzzy理想)的充要条件,讨论了布尔代数的Fuzzy子代数(Fuzzy理想)在布尔代数同态下的像和逆像,得到了布尔代数的Fuzzy子代数的同态基本定理。     

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.     

布尔代数上的Fuzzy同余关系

引入了布尔代数上的Fuzzy同余关系的概念,讨论了布尔代数上的Fuzzy同余关系与布尔代数的Fuzzy理想之间的关系,给出了商布尔代数的同构定理。     

完备布尔代数商格的注

本文研究了完备布尔代数L的商格Q(L),建立 L上q-集构成的集合Q′(L)与Q(L)之间的同构,得出了完备布尔代数的商格仍是完备布尔代数,并给出了完备布尔代数范畴的某些性质.     

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

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

Eine Charakterisierung der Boole'schen Algebra zu einer co -direkten Zerlegung

In this paper nuclear Boolean Algebras of projections in a locally convex space are considered. This are Boolean Algebras with special continuity properties, which are shared, for instance, by each bounded Boolean Algebra of projections in an ?^∞-space and by the algebra of each equicontinuos spectral measure in a nuclear space. It will be shown that a ?-complete nuclear Boolean Algebra leads to a c_o-direct sum of locally convex spaces and all the projections of the algebra belong to the complete algebra of projections of this c_o-direct partition. On the other hand if in a given locally convex space E there exists a nuclear complete Boolean Algebra of projections which has multiplicity one then each equicontinuos Boolean Algebra of projections in E is nuclear.     

Generalized Boolean Algebras in Lattice-Ordered Groups

In this paper, characterizations are given for the free lattice-ordered group over a generalized Boolean algebra and the freel -module of a totally ordered integral domain with unit over a generalized Boolean algebra. Extensions of lattice-ordered groups using generalized Boolean algebras are defined and their properties studied.     

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.     

关于Robbins代数与Heyting代数的类似性质

Ｓ．Ｗｉｎｋｅｒ在文〔１〕中给出了Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的一个较弱的条件。本文将讨论Ｈｅｙｔｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件，我们发现Ｈｅｙｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件与Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的条件相似，从而提示了Ｈｅｙｔｉｎｇ代数与Ｒｏｂｂｉｎｓ代数之间具有一定的关系。     

BOOLEAN ALGEBRAS IN AST

In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set. At the end of the paper we show that the sentence “There is no non-trivial free group which is a set” is consistent with AST.     

Order Continuity of Locally Compact Boolean Algebras

The main purpose of this paper is to exhibit the decisive role that order continuity plays in the structure of locally compact Boolean algebras as well as in that of atomic topological Boolean algebras. We prove that the following three conditions are equivalent for a topological Boolean algebra B: (1) B is compact; (2) B is locally compact, Boolean complete, order continuous; (3) B is Boolean complete, atomic and order continuous. Note that under the discrete topology any Boolean algebra is locally compact.     

Order topology in vector lattices with closure by one step

An order topology in vector lattices and Boolean algebras is studied under the additional condition of “closure by one step” that generalizes the well-known “regularity” property of Boolean algebras and K-spaces. It is proved that in a vector lattice or a Boolean algebra possessing such a property there exists a basis of solid neighborhoods of zero with respect to an order topology. An example of a Boolean algebra without basis of solid neighborhoods of zero (an algebra of regular open subsets of the interval (0, 1)) is given. Bibliography: 3 titles. Translated fromProblemy Matematicheskogo Analiza, No. 15 1995, pp. 213–220.     

布尔代数的直觉T-S模糊子代数及理想

在布尔代数中引入了的直觉T-S模糊子代数和直觉T-S模糊理想的概念,给出了布尔代数的直觉T-S模糊子代数的两个等价定义,进一步讨论了它们的性质.证明了布尔代数的两个直觉T-S模糊子代数(理想)的模交与直积也是直觉T-S模糊子代数(理想).     

σ‐short Boolean algebras

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Complexity of Boolean algebras and their Scott rank

We deal with problems associated with Scott ranks of Boolean algebras. The Scott rank can be treated as some measure of complexity of an algebraic system. Our aim is to propound and justify the procedure which, given any countable Boolean algebra, will allow us to construct a Boolean algebra of a small Scott rank that has the same natural algebraic complexity as has the initial algebra. In particular, we show that the Scott rank does not always serve as a good measure of complexity for the class of Boolean algebras. We also study into the question as to whether or not a Boolean algebra of a big Scott rank can be decomposed into direct summands with intermediate ranks. Examples are furnished in which Boolean algebras have an arbitrarily big Scott rank such that direct summands in them either have a same rank or a fixed small one, and summands of intermediate ranks are altogether missing. This series of examples indicates, in particular, that there may be no nontrivial mutual evaluations for the Scott and Frechet ranks on a class of countable Boolean algebras. Supported by RFFR grant No. 99-01-00485, by a grant for Young Scientists from SO RAN, 1997, and by the Federal Research Program (FRP) “Integration”. Translated fromAlgebra i Logika, Vol. 38, No. 6, pp. 643–666, November–December, 1999.     

Bool阵的逆阵

We give a characterization of a regular Boolean matrix and prove that AB = I Implies that BA = I, where A and B are Boolean matrices whose elements belong to a Boolean algebra of a set with more than two elements.     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Boolean topological orthomodular poset

Wilce introduced the notion of a topological orthomodular poset and proved any compact topological orthomodular poset whose underlying orthomodular poset is a Boolean algebra is a topological Boolean algebra in the usual sense. Wilce asked whether the compactness assumption was necessary for this result. We provide an example to show the compactness assumption is necessary.