Journal of Symbolic Logic 56 (4):1212-1229 (1991)

For 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 B1 is elementarily embeddable in B2. Theorem 1. For every complete theory of Boolean algebras T, if T ≠ Tω, then $\langle M_T, \leq\rangle$ 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\upharpoonright a$ is an atomic Boolean algebra and $B\upharpoonright 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 $\langle A, \leq\rangle$ is a partial well-quasi-ordering, if it is a partial quasi-ordering and for every $\{a_i\mid i \in \omega\} \subseteq A$ , there are $i < j < \omega$ such that ai ≤ aj. Theorem 2. $\langle M_{T_\omega}, \leq\rangle$ contains a subset M such that the partial orderings $\langle M, \leq \upharpoonright M \rangle$ and $\langle\mathscr{P}(\omega), \subseteq\rangle$ 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. $\langle M'_0, \leq'\rangle$ 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
Keywords Model theory   Boolean algebras   ordered sets   well-quasi-ordering   better-quasi-orderin
Categories (categorize this paper)
DOI 10.2307/2275469
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,901
Through your library

References found in this work BETA

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
67 ( #155,560 of 60,859 )

Recent downloads (6 months)
1 ( #434,440 of 60,859 )

How can I increase my downloads?


My notes