An algebraic treatment of the Barwise compactness theory

Studia Logica 50 (2):217 - 223 (1991)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An Algebraic Proof of the Barwise Compactness Theorem.Carol Karp & Jon Barwise - 1974 - Journal of Symbolic Logic 39 (2):335-335.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Notes on the Rasiowa-Sikorski lemma.Cecylia Rauszer & Bogdan Sabalski - 1975 - Studia Logica 34 (3):265 - 268.
Compactness Theorem.A. C. Paseau & Robert Leek - 2022 - Internet Encyclopedia of Philosophy.
Compactness.A. C. Paseau, and & Robert Leek - 2023 - Internet Encyclopedia of Philosophy.

Analytics

Added to PP
2009-01-28

Downloads
97 (#224,091)

6 months
7 (#469,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The mathematics of metamathematics.Helena Rasiowa - 1963 - Warszawa,: Państwowe Wydawn. Naukowe. Edited by Roman Sikorski.
Model theory for infinitary logic.H. Jerome Keisler - 1971 - Amsterdam,: North-Holland Pub. Co..
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.

View all 6 references / Add more references