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.
Similar content being viewed by others
References
J. Barwise, Admissible Sets and Structures. Springer Berlin, 1975.
C. R. Karp, Languages with Expressions of Infinite Length, North Holland, Amsterdam, 1964.
H. J. Keisler, Model Theory for Infinitary Logic, North Holland, Amsterdam, 1971.
H. Rasiowa and R. Sikorski, The Mathematics of Meta-Mathematics, Polish Academy of Sciences, Warszawa, 1963.
M. Makkai, Admissible sets and infinitary logic, in Handbook of Mathematical Logic, J. Barwise (ed.), North Holland, Amsterdam, 1977.
Author information
Authors and Affiliations
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
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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370183