Computable Homogeneous Boolean Algebras and a Metatheorem

We consider computable homogeneous Boolean algebras. Previously, countable homogeneous Boolean algebras have been described up to isomorphism and a simple criterion has been found for the existence of a strongly constructive (decidable) isomorphic copy for such. We propose a natural criterion for the existence of a constructive (computable) isomorphic copy. For this, a new hierarchy of -computable functions and sets is introduced, which is more delicate than Feiner's. Also, a metatheorem is proved connecting computable Boolean algebras and their hyperarithmetical quotient 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.

     

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.     

L_{\infty _\omega }free algebras

In this paper the study of which varieties, in a countable similarity type, have non-free (or equivalently ₁-free) algebras is completed. It was previously known that if a variety satisfies a property known as the construction principle then there are such algebras. If a variety does not satisfy the construction principle then either every -free algebra is free or for every infinite cardinalk, there is a k⁺-free algebra of cardinality k⁺ which is not free. Under the set theoretic assumption V=L, for any varietyV in a countable similarity type, either the class of free algebras is definable in or it is not definable in any .In Memory of Evelyn NelsonPresented by Ralph McKenzie.Research partially supported by NSERC of Canada Grant #A8948.Research partially supported by NSERC of Canada. The research for this paper was begun while the second author was visiting Simon Fraser University.     

Comparison of Boolean algebras

In this work, some results related to superatomic Boolean interval algebras are presented, and proved in a topological way. Let x be an uncountable cardinal. To each I x, we can associate a superatomic interval Boolean algebra B _I of cardinality x in such a way that the following properties are equivalent: (i) I I x, (ii) B _I is a quotient algebra of B _J, and (iii) there is an homomorphism f from B _J into B _I such that for every atom b of B _I, there is an atom a of B _J satisfying f(a)=b. As a corollary, there are 2 ^x isomorphism types of superatomic interval Boolean algebras of cardinality x. This case is quite different from the countable one.     

Iterative Algebras without Projections

We deal with iterative algebras of functions of -valued logic lacking projections, which we call algebras without projections. It is shown that a partially ordered set of algebras of functions of -valued logic, for , without projections contains an interval isomorphic to the lattice of all iterative algebras of functions of -valued logic. It is found out that every algebra without projections is contained in some maximal algebra without projections, which is the stabilizer of a semigroup of non-surjective transformations of the basic set. It is proved that the stabilizer of a semigroup of all monotone non-surjective transformations of a linearly ordered 3-element set is not a maximal algebra without projections, but the stabilizer of a semigroup of all transformations preserving an arbitrary non one-element subset of the basic set is.     

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.     

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.     

On maximal subalgebras of the algebras of unary recursive functions

Under consideration are the algebras of unary functions with supports in countable primitively recursively closed classes and composition operation. Each algebra of this type is proved to have continuum many maximal subalgebras including the set of all unary functions of the class ε ² of the Grzegorczyk hierarchy.     

Equationally distinct countable simple Q-relation algebras

Relation algebras were conceived by Tarski as the means to capture the algebra of binary relations. In this paper, we prove that a Maddux Style Representation preserves well-foundedness of relations, which is not in general true for a relation algebra isomorphism. This theorem enables us to construct equationally distinct countable simple Q-relation algebras using the method of forcing.     

Definability of Boolean Algebras in \mathbb{H}\mathbb{F} -Superstructures

Within the frames of the -definability approach propounded by Yu. L. Ershov, we study into the definability of Boolean algebras and their Frechet ranks in hereditarily finite superstructures. Examples are constructed of a superatomic Boolean algebra whose Frechet rank is not -definable in the hereditarily finite superstructure over that algebra, and of an admissible set in which the atomless Boolean algebra is not autostable.     

Lo spazio duale di un prodotto di algebre di Boole e le compattificazioni di Stone

Summary This paper is concerned with the Stone space X of a direct product of infinitely many Boolean algebras. In paragraph 2, after recalling that X is the Stone-ech compactification of the sum (disjoint union) of the Stone spaces of the algebras B_i, we exhibit a compactification of which is not a Stone space and we give a method to construct all the «Stone compactifications» of (the corresponding Boolean algebras are easily characterised). In paragraph 3, a set of ultrafilters of B (the «decomposable» ultrafilters) are introduced: this set properly contains , but, as is shown in paragraph 5, there are direct products that admit nondeeomposable ultrafilters (this is the case iff the set {Card B_i: i I } is not bounded by a natural number). In paragraph 4, among other things, we prove, for the set of decomposable ultrafilters, a weak form of countable compactness, in the sense that every countable clopen cover has a finite subcover; then, we deduce that the set of decomposable ultrafilters is pseudocompact, while obviously is not. Lastly, in paragraph 6, we give a second characterisation of the Stone space of B, showing that every ultrafilter of B can be obtained by iterating in a suitable way the procedure which leads to the construction of decomposable ultrafilters.

---

---

Lavoro eseguito nell'ambito dell'attività del Comitato Nazionale per le Scienze Matematiche del C.N.R.     

On generating countable sets of endomorphisms

Sierpiski proved that every countable set of mappings on an infinite set X is contained in a 2-generated subsemigroup of the semigroup of all mappings on X. In this paper we prove that every countable set of endomorphisms of an algebra which has an infinite basis (independent generating set) is contained in a 2-generated subsemigroup of the semigroup of all endomorphisms of .     

Effect Algebras as Presheaves on Finite Boolean Algebras

For an effect algebra A, we examine the category of all morphisms from finite Boolean algebras into A. This category can be described as a category of elements of a presheaf R(A) on the category of finite Boolean algebras. We prove that some properties (being an orthoalgebra, the Riesz decomposition property, being a Boolean algebra) of an effect algebra A can be characterized in terms of some properties of the category of elements of the presheaf R(A). We prove that the tensor product of effect algebras arises as a left Kan extension of the free product of finite Boolean algebras along the inclusion functor. The tensor product of effect algebras can be expressed by means of the Day convolution of presheaves on finite Boolean algebras.     

Classification of Cuntz-Krieger algebras

A classification is given of the simple Cuntz-Krieger algebras . It is proved that these algebras are classified up to stable isomorphism by their K₀-group. Thus the sign of the determinant of 1 —A is not an isomorphism invariant. The (non-stabilized) isomorphism type of is determined by K₀( ) together with the position of the class of the unit of .     

THE TENSOR CATEGORY OF LINEAR MAPS AND LEIBNIZ ALGEBRAS

We equip the category of linear maps of vector spaces with a tensor product which makes it suitable for various constructions related to Leibniz algebras. In particular, a Leibniz algebra becomes a Lie object in and the universal enveloping algebra functor UL from Leibniz algebras to associative algebras factors through the category of cocommutative Hopf algebras in . This enables us to prove a Milnor-Moore type theorem for Leibniz algebras.     

On Vaught’s Conjecture and finitely valued MV algebras

We show that the complete first order theory of an MV algebra has $2^{\aleph _0}$ countable models unless the MV algebra is finitely valued. So, Vaught's Conjecture holds for all MV algebras except, possibly, for finitely valued ones. Additionally, we show that the complete theories of finitely valued MV algebras are $2^{\aleph _0}$ and that all ω‐categorical complete theories of MV algebras are finitely axiomatizable and decidable. As a final result we prove that the free algebra on countably many generators of any locally finite variety of MV algebras is ω‐categorical.     

完备布尔代数商格的注

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

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.