Skip to main content
SpringerLink
Log in

A model of ZF with an infinite free complete Boolean algebra

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

By a theorem of Gaifman and Hales no model of ZF+AC (Zermelo-Fraenkel set theory plus the axiom of choice) contains an infinite free complete Boolean algebra. We construct a model of ZF in which an infinite free c.B.a. exists.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Gaifman,Infinite Boolean polynomials I, Fund. Math.54 (1964), 229–250.

    MathSciNet  Google Scholar 

  2. J. Gregory,Incompleteness of a formal system for infinitary finite-quantifier formulas, J. Symbolic Logic36 (1971), 445–455.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. W. Hales,On the non-existence of free complete Boolean algebras, Fund, Math.54 (1964), 45–66.

    MATH  MathSciNet  Google Scholar 

  4. T. J. Jech,The Axiom of Choice, North-Holland, Amsterdam (American Elsevier-New York), 1973.

    MATH  Google Scholar 

  5. C. R. Karp,Languages with Expressions of Infinite Length, Nort-Holland, Amsterdam, 1964.

    MATH  Google Scholar 

  6. S. Kripke,An extension of a theorem of Gaifman-Hales-Solovay, Fund. Math.61 (1967), 29–32.

    MATH  MathSciNet  Google Scholar 

  7. A. Levy,A hierarchy of formulas in set theory, Mem. Amer. Math. Soc.57 (1965).

  8. R. M. Solovay,New proof of a theorem of Gaifman and Hales, Bull. Amer. Math. Soc.72 (1966), 282–284.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Stavi,On strongly and weakly defined Boolean terms, Israel J. Math.15 (1973), 31–43.

    MATH  MathSciNet  Google Scholar 

  10. J. Stavi,Extensions of Kripke’s embedding theorem, to appear in Ann. Math. Logic.

  11. J. Stavi,Free complete Boolean algebras and first order structures, Notices Amer. Math. Soc.22 (1975), A-326.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Jerusalem, Israel

    Jonathan Stavi

  2. Stanford University, 94305, Stanford, CA, U.S.A.

    Jonathan Stavi

Authors
  1. Jonathan Stavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Preparation of this paper was partially supported by NSF Grant No. 43901.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stavi, J. A model of ZF with an infinite free complete Boolean algebra. Israel J. Math. 20, 149–163 (1975). https://doi.org/10.1007/BF02757883

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02757883

Keywords

Search

Navigation