Skip to main content
Log in

An algebraic treatment of the barwise compactness theory

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

A theorem on the extendability of certain subsets of a Boolean algebra to ultrafilters which preserve countably many infinite meets (generalizing Rasiowa-Sikorski) is used to pinpoint the mechanism of the Barwise proof in a way which bypasses the set theoretical elaborations.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Barwise, Admissible Sets and Structures. Springer Berlin, 1975.

    Google Scholar 

  2. C. R. Karp, Languages with Expressions of Infinite Length, North Holland, Amsterdam, 1964.

    Google Scholar 

  3. H. J. Keisler, Model Theory for Infinitary Logic, North Holland, Amsterdam, 1971.

    Google Scholar 

  4. H. Rasiowa and R. Sikorski, The Mathematics of Meta-Mathematics, Polish Academy of Sciences, Warszawa, 1963.

    Google Scholar 

  5. M. Makkai, Admissible sets and infinitary logic, in Handbook of Mathematical Logic, J. Barwise (ed.), North Holland, Amsterdam, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

During the preparation of this work the second author was a postdoctoral visitor at the C. R. M. supported by a National Council of Canada operating grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fleischer, I., Scott, P. An algebraic treatment of the barwise compactness theory. Stud Logica 50, 217–223 (1991). https://doi.org/10.1007/BF00370183

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation