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.     

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.     

Conglomerability of probability measures on Boolean algebras

For the case where is a Boolean algebra of events and P is a probability (finitely additive) [23.] considered the question of conglomerability of P and found that in many circumstances this natural notion was equivalent to countable additivity of P. [32.] pursued these investigations on the connection between countable additivity and conglomerability in greater detail for the case where is a σ-algebra. [29.] and [37.] give alternative proofs. This article is an extension (for the most part) of Schervish, Seidenfeld, and Kadane's work to the case where is an arbitrary Boolean algebra. The more restrictive notion of positive conglomerability for a class of algebras, including the countable algebras, σ-complete algebras, and inifinite product algebras is treated completely. This class is described by the requirement that a {0, 1}-valued measure be countably additive if every countable family of negligible sets is contained within a negligible set (i.e., corresponds to a P-point of of the Stone space). In general positive conglomerability fails to be equivalent to countable additivity though the degree of failure is minor. Building on techniques of Hill, Lane, and Zame, we obtain partial results on conglomerability for non-σ-complete algebras.     

The completeness of the isomorphism relation for countable Boolean algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen's classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an essential way. We also give a stronger form of the Vaught conjecture for Boolean algebras which states that, for any complete first-order theory of Boolean algebras that has more than one countable model up to isomorphism, the class of countable models for the theory is Borel complete. The results are applied to settle many other classification problems related to countable Boolean algebras and separable Boolean spaces. In particular, we will show that the following equivalence relations are Borel complete: the translation equivalence between closed subsets of the Cantor space, the isomorphism relation between ideals of the countable atomless Boolean algebra, the conjugacy equivalence of the autohomeomorphisms of the Cantor space, etc. Another corollary of our results is the Borel completeness of the commutative AF -algebras, which in turn gives rise to similar results for Bratteli diagrams and dimension groups.

     

Monadic Algebras with finite degree

A monadic algebraA has finite degreen ifA/M has at most 2 ⁿ elements for every maximal idealM ofA and this bound is obtained for someM. Every countable monadic algebra with a finite degree is isomorphic to an algebra Γ(X, S) whereX is a Boolean space andS is a subsheaf of a constant sheaf with a finite simple stalk. This representation is used to prove that every proper equational class of monadic algebras has a decidable first-order theory.     

效应代数的表示

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

Recursive Homogeneous Boolean Algebras

Isomorphism types of countable homogeneous Boolean algebras are described in [1], in which too is settled the question of whether such algebras are decidable. Precisely, a countable homogeneous Boolean algebra has a decidable presentation iff the set by which an isomorphism type of that algebra is characterized belongs to a class of the arithmetic hierarchy. The problem of obtaining a characterization for homogeneous Boolean algebras which have a recursive presentation remained open. Partially, here we resolve this problem, viz., estimate an exact upper and an exact lower bounds for the set which an isomorphism type of such any algebra is characterized by in terms of the Feiner hierarchy.     

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.     

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)     

Finiteness conditions and distributive laws for Boolean algebras

We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Lie Algebras in which Every Subspace s Its Subalgebra

In this paper, we study the Lie algebras in which every subspace is its subalgebra (denoted by HB Lie algebras). We get that a nonabelian Lie algebra is an HB Lie algebra if and only if it is isomorphic to g+Cidg, where g is an abelian Lie algebra. Moreover we show that the derivation algebra and the holomorph of a nonabelian HB Lie algebra are complete.     

The Lie Algebras in which Every Subspace Is Its Subalgebra

In this paper, we study the Lie algebras in which every subspace is its subalgebra (denoted by HB Lie algebras). We get that a nonabelian Lie algebra is an HB Lie algebra if and only if it is isomorphic to $g\dot{+}\mathbb{C}id_g$, where $g$ is an abelian Lie algebra. Moreover we show that the derivation algebra and the holomorph of a nonabelian HB Lie algebra are complete.     

Composition algebras of the second kind

The concept of a composition algebra of the second kind is introduced. We prove that such algebras are non-degenerate monocomposition algebras without unity. A big number of these algebras in any finite dimension are constructed, as well as two algebras in a countable dimension. The constructed algebras each contains a non-isotropic idempotent e² = e. We describe all orthogonally non-isomorphic composition algebras of the second kind in the following forms: (1) a two-dimensional algebra (which has turned out to be unique); (2) three-dimensional algebras in the constructed series. For every algebra A, the group Ortaut A of orthogonal automorphisms is specified. __________ Translated from Algebra i Logika, Vol. 46, No. 4, pp. 428–447, July–August, 2007.     

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

Locally finite dimensional lie algebras and their derivation algebras

The derivation algebras of all locally finite dimensional locally simple Lie algebras over a field of characteristic 0 are determined. Every locally finite dimensional Lie algebra of countable dimension is a subalgebra of the outer derivation algebra outder (ℒ) for every Lie algebra ℒ, which is the direct limit of diagonally embedded classical Lie algebras. These outer derivation algebras have dimension ℒ and are never locally finite dimensional. Dedicated to Prof. H. Petersson on the occasion of his 60th birthday     

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.     

The category of complete Boolean algebras is not an intersection of reflective subcategories of the category of frames

We answer a question of J. Rosický and W. Tholen by showing that the class of complete Boolean algebras (which is a prereflective subcategory of the category of frames) is not an intersection of reflective subcategories of the category of frames. In order to deduce this result, we first prove the following observation (using some basic facts about congruence frames): the three-element chain belongs to every reflective subcategory of the category of frames which contains the class of complete Boolean algebras.Supported by the Categorical Topology Research Group at the University of Cape Town, under funding from the Foundation for Research Development and the University of Cape Town.     

Boolean-like algebras

Using Vaggione’s concept of central element in a double-pointed algebra, we introduce the notion of Boolean-like variety as a generalisation of Boolean algebras to an arbitrary similarity type. Appropriately relaxing the requirement that every element be central in any member of the variety, we obtain the more general class of semi-Boolean-like varieties, which still retain many of the pleasing properties of Boolean algebras. We prove that a double-pointed variety is discriminator if and only if it is semi-Boolean-like, idempotent, and 0-regular. This theorem yields a new Maltsev-style characterisation of double-pointed discriminator varieties.