Skip to main content
SpringerLink
Log in

On strongly and weakly defined boolean terms

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

Abstract

A problem of Gaifman about strongly and weakly defined Boolean terms is solved by finding a Boolean algebra ℱ with a complete subalgebra ℰ such that some element of ℱ not in ℰ can be obtained from elements of ℰ by meets and joins in the normal completion of ℱ.

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. R. Sikorski,Boolean Algebras, 2nd edition, Springer-Verlag, Berlin, 1964.

    MATH  Google Scholar 

  3. J. Stavi,On strongly and weakly defined Boolean terms, Notices Amer. Math. Soc.18 (1971), 1107.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Jerusalem, Israel

    Jonathan Stavi

Authors
  1. Jonathan Stavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stavi, J. On strongly and weakly defined boolean terms. Israel J. Math. 15, 31–43 (1973). https://doi.org/10.1007/BF02771771

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation