Elementary embedding between countable Boolean algebras

1991 ◽  
Vol 56 (4) ◽  
pp. 1212-1229
Author(s):  
Robert Bonnet ◽  
Matatyahu Rubin
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Complete Theory ◽  
Linear Ordering ◽  
Elementary Embedding ◽  
Linear Orderings ◽  
Partial Orderings ◽  
Atomless Boolean Algebra ◽  
Atomic Boolean Algebra ◽  
Quasi Ordering

AbstractFor a complete theory of Boolean algebras T, let MT denote the class of countable models of T. For B1, B2 ∈ MT, let B1 ≤ B2 mean that B2 is elementarily embeddable in B2. Theorem 1. For every complete theory of Boolean algebras T, if T ≠ Tω, then ‹MT, ≤› is well-quasi-ordered. ∎ We define Tω. For a Boolean algebra B, let I(B) be the ideal of all elements of the form a + s such that B ↾ a is an atomic Boolean algebra and B ↾ s is an atomless Boolean algebra. The Tarski derivative of B is defined as follows: B(0) = B and B(n + 1) = B(n)/I(B(n)). Define Tω to be the theory of all Boolean algebras such that for every n ∈ ω, B(n) ≠ {0}. By Tarski [1949], Tω is complete. Recall that ‹A, < › is partial well-quasi-ordering, it is a partial quasi-ordering and for every {ai, ⃒ i ∈ ω} ⊆ A, there are i < j < ω such that ai ≤ aj. Theorem 2. contains a subset M such that the partial orderings ‹M, ≤ ↾ M› and are isomorphic. ∎ Let M′0 denote the class of all countable Boolean algebras. For B1, B2 ∈ M′0, let B1 ≤′ B2 mean that B1 is embeddable in B2. Remark. ‹M′0, ≤′› is well-quasi-ordered. ∎ This follows from Laver's theorem [1971] that the class of countable linear orderings with the embeddability relation is well-quasi-ordered and the fact that every countable Boolean algebra is isomorphic to a Boolean algebra of a linear ordering.

Computable Boolean algebras

2000 ◽  
Vol 65 (4) ◽  
pp. 1605-1623 ◽  
Author(s):  
Julia F. Knight ◽  
Michael Stob
Keyword(s):  
Boolean Algebra ◽  
Embedding Theorem ◽  
Boolean Algebras ◽  
Linear Ordering ◽  
Isomorphism Theorem ◽  
Embedding Theorems ◽  
Trivial Case ◽  
Linear Orderings ◽  
Successor Relation

Feiner [F] showed that a Boolean algebra need not have a computable copy (see also [T2]). Downey and Jockusch [D-J] showed that every low Boolean algebra does have a computable copy. Thurber [T3], showed that every low2 Boolean algebra has a computable copy. Here we show that every Boolean algebra which is low3, or even low4, has a computable copy.The results of [D-J] and [T3] were obtained by passing to linear orderings. In [D-J], there is an embedding theorem saying that any linear ordering which is with the successor relation as an added predicate can be embedded in a slightly larger linear ordering which is computable. An isomorphism theorem of Remmel [R] is used to show that the interval algebras of the two linear orderings are isomorphic (except in a trivial case). In [T3], there is an embedding theorem saying that any linear ordering which is with certain added predicates can be embedded in one which is with successor. Again the isomorphism theorem of Remmel is used to show that the interval algebras are isomorphic (except in a trivial case).Here, instead of passing to linear orderings, we work directly with Boolean algebras. We begin with a review of the known results. We re-formulate the embedding theorems of Downey-Jockusch and Thurber in terms of Boolean algebras. We extract from Remmel's isomorphism theorem some information on complexity. In this way, we show that a low Boolean algebra is isomorphic to a computable one by an isomorphism which is , at worst, and the same is true for a low2 Boolean algebra.

scholarly journals Orthomodular generalizations of homogeneous Boolean algebras

1973 ◽  
Vol 15 (1) ◽  
pp. 94-104 ◽  
Author(s):  
C. H. Randall ◽  
M. F. Janowitz ◽  
D. J. Foulis
Keyword(s):  
Boolean Algebra ◽  
Dense Subset ◽  
Unit Interval ◽  
Boolean Algebras ◽  
Borel Sets ◽  
History Of ◽  
Atomic Boolean Algebra

It is well known that the so-called reduced Borel algebra, that is, the Boolean algebra of all Borel subsets of the unit interval modulo the meager Borel sets of this interval, can be abstractly characterized as a complete, totally non-atomic Boolean algebra containing a countable join dense subset. (For an indication of the history of this result, see, for example, ([2], p. 483, footnote 12.) From this characterization, it easily follows that the reduced Borel algebra B is “homogeneous” in the sense that every non-trivial in B is isomorphic to B.

Maximal irredundance and maximal ideal independence in Boolean algebras

2008 ◽  
Vol 73 (1) ◽  
pp. 261-275 ◽  
Author(s):  
J. Donald Monk
Keyword(s):  
Boolean Algebra ◽  
Maximal Ideal ◽  
Boolean Algebras ◽  
Independent Subset ◽  
Cardinal Invariant ◽  
Associated Functions ◽  
Atomless Boolean Algebra ◽  
Relationship Of ◽  
The Relationship ◽  
The Ideal

Recall that a subset X of an algebra A is irredundant iff x ∉ 〈X∖{x}〉 for all x ϵ X, where 〈X∖{x}) is the subalgebra generated by X∖{x}. By Zorn's lemma there is always a maximal irredundant set in an algebra. This gives rise to a natural cardinal function Irrmm(A) = min{∣X∣: X is a maximal irredundant subset of A}. The first half of this article is devoted to proving that there is an atomless Boolean algebra A of size 2ω for which Irrmm(A) = ω.A subset X of a BA A is ideal independent iff x ∉ (X∖{x}〉id for all x ϵ X, where 〈X∖{x}〉id is the ideal generated by X∖{x}. Again, by Zorn's lemma there is always a maximal ideal independent subset of any Boolean algebra. We then consider two associated functions. A spectrum functionSspect(A) = {∣X∣: X is a maximal ideal independent subset of A}and the least element of this set, smm(A). We show that many sets of infinite cardinals can appear as Sspect(A). The relationship of Smm to similar “continuum cardinals” is investigated. It is shown that it is relatively consistent that Smm/fin) < 2ω.We use the letter s here because of the relationship of ideal independence with the well-known cardinal invariant spread; see Monk [5]. Namely, sup{∣X∣: X is ideal independent in A} is the same as the spread of the Stone space Ult(A); the spread of a topological space X is the supremum of cardinalities of discrete subspaces.

On some small cardinals for Boolean algebras

2004 ◽  
Vol 69 (3) ◽  
pp. 674-682 ◽  
Author(s):  
Ralph Mckenzie ◽  
J. Donald Monk
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Atomless Boolean Algebra

Abstract.Assume that all algebras are atomless. (1) Spind(A × B) = Spind(A) ∪ Spind(B). (2) Spind(Ai). Now suppose that κ and λ are infinite cardinals, with κ uncountable and regular and with κ < λ. (3) There is an atomless Boolean algebra A such that u(A) = κ and i(A) = λ. (4) If λ is also regular, then there is an atomless Boolean algebra A such that t(A) = s(A) = κ and α (A) = λ. All results are in ZFC, and answer some problems posed in Monk [01] and Monk [∞].

On the Lattice of Primitive Convergence Structures

1971 ◽  
Vol 23 (3) ◽  
pp. 392-397
Author(s):  
C. R. Atherton
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Atomic Boolean Algebra

Let S be any set and denote by F(S) the collection of all fiters on S. The collection A(S) of all mappings from F(S) to 2s, 2s being ordered by the dual of its usual ordering, may be regarded as a product of complete Boolean algebras and is, therefore, a complete atomic Boolean algebra [4]. A(S) is called the lattice of primitive convergence structures on S. If q ∈ A(S) and , then is said to q-converge to a point x ∈ S if . The collection of all topologies on S may be identified with a subset of A(S); this subset of A(S) will be denoted by T(S). A more specialized class of primitive convergence structures, and one which properly contains T(S), is C(S), the subcomplete lattice of all convergence structures on S.

Two-dimensional partial orderings: Recursive model theory

1980 ◽  
Vol 45 (1) ◽  
pp. 121-132 ◽  
Author(s):  
Alfred B. Manaster ◽  
Joseph G. Rosenstein
Keyword(s):  
Model Theory ◽  
Companion Paper ◽  
Partial Ordering ◽  
Linear Ordering ◽  
Two Dimensional ◽  
Recursive Model ◽  
Linear Orderings ◽  
Rational Plane ◽  
Partial Orderings

In this paper and the companion paper [9] we describe a number of contrasts between the theory of linear orderings and the theory of two-dimensional partial orderings.The notion of dimensionality for partial orderings was introduced by Dushnik and Miller [3], who defined a partial ordering 〈A, R〉 to be n-dimensional if there are n linear orderings of A, 〈A, L1〉, 〈A, L2〉 …, 〈A, Ln〉 such that R = L1 ∩ L2 ∩ … ∩ Ln. Thus, for example, if Q is the linear ordering of the rationals, then the (rational) plane Q × Q with the product ordering (〈x1, y1〉 ≤Q×Q 〈x2, y2, if and only if x1 ≤ x2 and y1 ≤ y2) is 2-dimensional, since ≤Q×Q is the intersection of the two lexicographic orderings of Q × Q. In fact, as shown by Dushnik and Miller, a countable partial ordering is n-dimensional if and only if it can be embedded as a subordering of Qn.Two-dimensional partial orderings have attracted the attention of a number of combinatorialists in recent years. A basis result recently obtained, independently, by Kelly [7] and Trotter and Moore [10], describes explicitly a collection of finite partial orderings such that a partial ordering is a 2dpo if and only if it contains no element of as a subordering.

scholarly journals THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS

2002 ◽  
Vol 02 (02) ◽  
pp. 145-225 ◽  
Author(s):  
STEFFEN LEMPP ◽  
MIKHAIL PERETYAT'KIN ◽  
REED SOLOMON
Keyword(s):  
Boolean Algebra ◽  
Order Theory ◽  
Boolean Algebras ◽  
Quotient Algebra ◽  
First Order ◽  
Finite Models ◽  
First Order Theory ◽  
Recursive Isomorphism ◽  
Atomic Boolean Algebra

In this paper, we investigate the Lindenbaum algebra ℒ(T fin ) of the theory T fin = Th (M fin ) of the class M fin of all finite models of a finite rich signature. We prove that this algebra is an atomic Boolean algebra while its Gödel numeration γ is a [Formula: see text]-numeration. Moreover, the quotient algebra (ℒ(T fin )/ℱ, γ/ℱ) modulo the Fréchet ideal ℱ is a [Formula: see text]-algebra, which is universal over the class of all [Formula: see text] Boolean algebras. These conditions characterize uniquely the algebra ℒ(T fin ); moreover, these conditions characterize up to recursive isomorphism the numerated Boolean quotient algebra (ℒ(T fin )/ℱ, γ/ℱ). These results extend the work of Trakhtenbrot [17] and Vaught [18] on the first order theory of the class of all finite models of a finite rich signature.

scholarly journals Concerning intrinsic topologies on Boolean algebras and certain bicompactly generated lattices

1970 ◽  
Vol 11 (2) ◽  
pp. 156-161 ◽  
Author(s):  
C. R. Atherton
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Order Topology ◽  
Complete Lattices ◽  
Ideal Topology ◽  
Atomic Boolean Algebra ◽  
The Ideal

This paper may be regarded as a continuation of the investigations begun in [2]; certain intrinsic lattice topologies are studied, especially the order and ideal topologies in Boolean algebras, bicompactly generated lattices, and other more general structures. The results of [1], [2], and [3] are shown to be closely related. It is proved that the ideal topology on any Boolean algebra has a closed subbase consisting of all sublattices, whereas the order topology on an atomic Boolean algebra has a closed subbase consisting of all sub-complete lattices. It is also shown that the order topology on an atomic Boolean algebra is autouniformizable (in the sense defined by Rema [3]) and, if the ground set is infinite, strictly coarser than the ideal topology. The conditions Cl and C3 on a lattice, introduced by Kent [1], are shown to be slightly stronger than the condition “ bicompactly generated ”, and in complete lattices, where these conditions are satisfied, the order topology is shown to be coarser than the ideal topology.

scholarly journals Recursive Embeddings of Partial Orderings

1977 ◽  
Vol 29 (2) ◽  
pp. 349-359 ◽  
Author(s):  
K. R. Apt
Keyword(s):  
Boolean Algebra ◽  
Partial Ordering ◽  
Partial Orderings ◽  
Atomless Boolean Algebra

Let be a countable atomless Boolean algebra and let X be a countable partial ordering. We prove that there exists an embedding of X into which is recursive in X, and which destroys all suprema and infima of X which can be destroyed. We show that the above theorem is false when we try to preserve all suprema and infima of X instead of destroying them.

An Outline of a Theory of Propositional Vagueness

2018 ◽  
Author(s):  
Andrew Bacon
Keyword(s):  
Boolean Algebra ◽  
Total Evidence ◽  
Coarse Grained ◽  
Atomic Boolean Algebra

This chapter presents a series questions in the philosophy of vagueness that will constitute the primary subjects of this book. The stance this book takes on these questions is outlined, and some preliminary ramifications are explored. These include the idea that (i) propositional vagueness is more fundamental than linguistic vagueness; (ii) propositions are not themselves sentence-like; they are coarse grained, and form a complete atomic Boolean algebra; (iii) vague propositions are, moreover, not simply linguistic constructions either such as sets of world-precisification pairs; and (iv) propositional vagueness is to be understood by its role in thought. Specific theses relating to the last idea include the thesis that one’s total evidence can be vague, and that there are vague propositions occupying every evidential role, that disagreements about the vague ultimately boil down to disagreements in the precise, and that one should not care intrinsically about vague matters.

Sign in / Sign up

Export Citation Format

Share Document