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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have