Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-25T03:30:59.427Z Has data issue: false hasContentIssue false
  • English
  • Français

The Boolean algebras of abelian groups and well-orders

Published online by Cambridge University Press:  12 March 2014

Dale Myers
Dale Myers*
Affiliation:
University of Hawaii, Honolulu, Hawaii 96822
Get access Rights & Permissions [Opens in a new window]

Extract

For any linear order type τ with first element let be the Boolean set algebra generated by the left-closed right-open (including [x, ∞)) intervals of some linear order of type τ. Let η and ω be the order types of the rationals and natural numbers respectively (when not used as an order type, ω will, as usual, be the set of nonnegative integers). We show that the Boolean algebra of the elementary theory of well-orders, i.e., the Boolean algebra of elementary classes of well-orders or, equivalently, the algebra of equivalence classes of sentences of the elementary theory of well-orders, is isomorphic to and that the Boolean algebra of the elementary theory of abelian groups is isomorphic to . Both results are obtained by applying Hanf's structure diagram technique to the work of Mostowski, Tarski, and Szmielew. One may formalize discussion of algebras of proper classes by assuming the classes are included in a universe which is a set in a larger universe.Given a Boolean algebra, let 0 be its zero and 1 its unit, let ≤ be its associated partial ordering, and, for any elements a, b, and c of the algebra, let “a + b = c ” be the assertion that c is the disjoint sum of a and b. A subset of the algebra disjointly generates the algebra iff each of the algebra's elements is a disjoint sum of a finite number of the subset's elements.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 39 , Issue 3 , September 1974 , pp. 452 - 458
Copyright
Copyright © Association for Symbolic Logic 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Dyson, Verena Huber, On the decision problem for theories of finite models, Israel Journal of Mathematics, vol. 2 (1964), pp. 55–70.CrossRefGoogle Scholar
[2]Hanf, William, Primitive Boolean algebras, Proceedings of the Symposium in Honor of Alfred Tarski (Berkeley, 1971), vol. 25, American Mathematical Society, Providence, R.I., 1974, pp. 75–90.Google Scholar
[3]Hanf, William and Simons, Roger, Boolean algebras of some elementary theories, Notices of the American Mathematical Society, vol. 17 (1970), p. 84. Abstract #670–13.Google Scholar
[4]Henkin, L., Monk, J. D. and Tarski, A., Cylindric algebras, North-Holland, Amsterdam, 1971, 508 pp.Google Scholar
[5]Mostowski, Andrzej and Tarski, Alfred, Arithmetical classes of types of well-ordered systems, Bulletin of the American Mathematical Society, vol. 55 (1949), p. 65; Errata, p. 1192.Google Scholar
[6]Myers, Dale, The Boolean algebras of two elementary theories, Notices of the American Mathematical Society, vol. 18 (1971), p. 564. Abstract #71T–E34.Google Scholar
[7]Simons, Roger, The Boolean algebra of sentences of the theory of a function, Ph.D. Thesis, University of California, Berkeley, 1972.Google Scholar
[8]Szmielew, Wanda, Arithmetical classes and types of abelian groups, Bulletin of the American Mathematical Society, vol. 55 (1949), p. 65.Google Scholar
[9]Szmielew, Wanda, Elementary properties of abelian groups, Fundamenta Mathematicae, vol. 41 (1955), pp. 203–271.CrossRefGoogle Scholar