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 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.     

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.     

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.     

Cayley-like representations are for all algebras, not merely groups

Cayley 's Theorem represents an arbitrary group as a set of permutations with the group operation captured by the composition of permutations. A few other examples with related representations are monoids, Boolean algebras and Menger algebras, permutations now being replaced by functions with one or more arguments. Although Cayley-like representations appear to be rare, this article shows that they are not. The idea is to represent the elements of an arbitrary algebra by multivariable functions, and its operations by particular compositions of these functions. Any finite algebra can be so represented,and so can any variety generated by one finite subdirectly irreducible algebra. It will follow that these varieties are Cayley-like: semilattices, distributive lattices, median algebras, elementary Abelian p -groups (for fixed p), and those generated by a primal algebra. If the definition of Cayley-like is stretched to allow the representing functions to have an infinite number of arguments, then all algebras are Cayley-like.     

Decomposition of ℓ-group-valued measures

We deal with decomposition theorems for modular measures µ: L → G defined on a D-lattice with values in a Dedekind complete ?-group. Using the celebrated band decomposition theorem of Riesz in Dedekind complete ?-groups, several decomposition theorems including the Lebesgue decomposition theorem, the Hewitt-Yosida decomposition theorem and the Alexandroff decomposition theorem are derived. Our main result—also based on the band decomposition theorem of Riesz—is the Hammer-Sobczyk decomposition for ?-group-valued modular measures on D-lattices. Recall that D-lattices (or equivalently lattice ordered effect algebras) are a common generalization of orthomodular lattices and of MV-algebras, and therefore of Boolean algebras. If L is an MV-algebra, in particular if L is a Boolean algebra, then the modular measures on L are exactly the finitely additive measures in the usual sense, and thus our results contain results for finitely additive G-valued measures defined on Boolean algebras.     

On mixed Hessians and the Lefschetz properties

We introduce a new type of Hessian matrix, that we call Mixed Hessian. The mixed Hessian is used to compute the rank of a multiplication map by a power of a linear form in a standard graded Artinian Gorenstein algebra. In particular we recover the main result of a paper by Maeno and Watanabe for identifying Strong Lefschetz elements, generalizing it also for Weak Lefschetz elements. This criterion is also used to give a new proof that Boolean algebras have the Strong Lefschetz Property. We also construct new examples of Artinian Gorenstein algebras presented by quadrics that does not satisfy the Weak Lefschetz Property; we construct minimal examples of such algebras and we give bounds, depending on the degree, for their existence. Artinian Gorenstein algebras presented by quadrics were conjectured to satisfy WLP in two papers by Migliore and Nagel, and in a previous paper we constructed the first counter-examples.     

σ‐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)     

Some Boolean algebras with finitely many distinguished ideals II

We describe the countably saturated models and prime models (up to isomorphism) of the theory Th_prin of Boolean algebras with a principal ideal, the theory Th_max of Boolean algebras with a maximal ideal, the theory Th_ac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Th_sa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the theory of Boolean algebras with a distinguished ideal that do not have a countably saturated model. Also, we give a sufficient condition for a model of the theory T_X of Boolean algebras with distinguished ideals to be elementarily equivalent to a countably saturated model of T_X.     

Downward closure of depth in countable Boolean algebras

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.     

Non-Pointed Strongly Protomodular Theories

We give criterions for strong protomodularity and prove that the strong protomodularity of an algebraic theory is inherited by its models in a category with finite limits. We give examples of strongly protomodular theories with several constants: C ^*-algebras, rings, Heyting algebras and Boolean algebras.     

Kites and pseudo BL-algebras

We investigate a construction of a pseudo BL-algebra out of an ?-group called a kite. We show that many well-known examples of algebras related to fuzzy logics can be obtained in that way. We describe subdirectly irreducible kites. As another application, we exhibit a new countably infinite family of varieties of pseudo BL-algebras covering the variety of Boolean algebras.     

Component partially ordered sets

Properties of component partially ordered sets (i.e., dense subsets of Boolean algebras) are used to construct mappings of Boolean algebras generalizing the idea of homomorphisms; the properties of a minimal Boolean algebra generated by a given component partially ordered set are investigated.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 275–283, March, 1971.     

广义模糊幂零矩阵

路代数是加法幂等的半环,它包括了布尔代数,模糊代数,分配格及斜坡.因此布尔矩阵,模糊矩阵,格矩阵及斜矩阵都是路代数上的典型矩阵.广义模糊幂零矩阵指的就是路代数上的幂零矩阵.在2010年,Tan研究了路代数上矩阵的幂零性.在Tan的基础上继续讨论了路代数上幂零矩阵的幂零指数.     

Completely Simple Semigroups,Lie Algebras,and the Road Coloring Problem

Consider a semigroup generated by matrices associated with an edge-coloring of a strongly connected, aperiodic digraph. We call the semigroup Lie-solvable if the Lie algebra generated by its elements is solvable. We show that if the semigroup is Lie-solvable then its kernel is a right group. Next, we study the Lie algebra generated by the kernel. Lie algebras generated by two idempotents are analyzed in detail. We find that these have homomorphic images that are generalized quaternion algebras. We show that if the kernel is not a direct product, then the Lie algebra generated by the kernel is not solvable by describing the structure of these algebras. Finally, we discuss an infinite class of examples that are shown to always produce strongly connected aperiodic digraphs having kernels that are not right groups.     

并素元有限生成格的弱直积分解

本文建立了并素元有限生成格的弱直积分解,并给出一个解决并素元生成的完全Heyting代数的直积分解问题的新方法;作为弱直积分解的应用,证明了并素元有限生成的完全Heyting代数必然同构于有限个既约的完全Heyting代数的直积,证明了并素元有限生成格是Boole代数的充要条件是它同构于某有限集的幂集格.     

Elementary Equivalence of Linear Groups Over Rings with a Finite Number of Central Idempotents and Over Boolean Rings

In the present paper, we start with a criterion of elementary equivalence of linear groups over rings with just a finite number of central idempotents. Then we study elementary equivalence of linear groups over Boolean algebras. We prove that two linear groups over Boolean algebras are elementarily equivalent if and only if their dimensions coincide and these Boolean algebras are elementarily equivalent.     

Metric Boolean algebras and constructive measure theory

 This work concerns constructive aspects of measure theory. By considering metric completions of Boolean algebras – an approach first suggested by Kolmogorov – one can give a very simple construction of e.g. the Lebesgue measure on the unit interval. The integration spaces of Bishop and Cheng turn out to give examples of such Boolean algebras. We analyse next the notion of Borel subsets. We show that the algebra of such subsets can be characterised in a pointfree and constructive way by an initiality condition. We then use our work to define in a purely inductive way the measure of Borel subsets. Received: 9 November 2000 / Revised version: 23 March 2001 / Published online: 12 July 2002     

效应代数的表示

本文讨论了抽象效应代数的表示问题. 对于一个抽象效应代数(E,⊕, 0, 1), 如果存在一个Hilbert 空间 H 和一个单态射 φ:E →ε(H), 那么称 E 为可表示的且称(φ,H) 是E 的一个表示, 其中ε(H) 表示 H 上所有正压缩算子构成的效应代数. 给出了一些可表示的和不可表示的效应代数的例子, 证 明了非空集 X 上的任一模糊集系统 F 和Boolean 代数B_X 都是可表示的效应代数.     

Amalgamation of Ortholattices

We show that the variety of ortholattices has the strong amalgamation property and that the variety of orthomodular lattices has the strong Boolean amalgamation property, i.e. that two orthomodular lattices can be strongly amalgamated over a common Boolean subalgebra. We give examples to show that the variety orthomodular lattices does not have the amalgamation property and that the variety of modular ortholattices does not even have the Boolean amalgamation property. We further show that no non-Boolean variety of orthomodular lattices which is generated by orthomodular lattices of bounded height can have the Boolean amalgamation property.