Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-25T00:08:16.135Z Has data issue: false hasContentIssue false

An algebraic characterization of power set in countable standard models of ZF1

Published online by Cambridge University Press:  12 March 2014

George Metakides
Affiliation:
University of Rochester, Rochester, New York 14627
J. M. Plotkin
Affiliation:
Michigan State University, East Lansing, Michigan 48824

Extract

The following is a classical result:

Theorem 1.1. A complete atomic Boolean algebra is isomorphic to a power set algebra [2, p. 70].

One of the consequences of [3] is: If M is a countable standard model of ZF and is a countable (in M) model of a complete ℵ0-categorical theory T, then there is a countable standard model N of ZF and a Λ ∈ N such that the Boolean algebra of definable (in T with parameters from ) subsets of is isomorphic to the power set algebra of Λ in N. In particular if and T the theory of equality with additional axioms asserting the existence of at least n distinct elements for each n < ω, then there is an N and Λ ∈ N with 〈PN(Λ), ⊆〉 isomorphic to the countable, atomic, incomplete Boolean algebra of the finite and cofinite subsets of ω.

From the above we see that some incomplete Boolean algebras can be realized as power sets in standard models of ZF.

Definition 1.1. A countable Boolean algebra 〈B, ≤〉 is a pseudo-power set if there is a countable standard model of ZF, N and a set Λ ∈ N such that

It is clear that a pseudo-power set is atomic.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1975

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.)

Footnotes

1

This work was partially supported by NSF grants GP-22719 and GP-38025. The authors wish to express their gratitude to Anil Nerode for numerous conversations.

References

REFERENCES

[1]Felgner, U., Models of ZF-set theory, Lecture Notes in Mathematics, Vol. 223, Springer-Verlag, Berlin-Heidelberg-New York, 1971.Google Scholar
[2]Halmos, P. R., Lectures on Boolean algebras, Van Nostrand, Englewood Cliffs, N.J., 1963.Google Scholar
[3]Plotkin, J. M., Generic embeddings, this Journal, vol. 34 (1969), pp. 388394.Google Scholar
[4]Weglorz, B., A model of set theory over a given Boolean algebra, Bulletin de L'Académie Polonaise des Sciences, vol. 17 (1969), pp. 201202.Google Scholar