Finiteness conditions and distributive laws for Boolean algebras
نویسنده
چکیده
Klaus Ambos-Spies, Heidelberg Klaus Meer, Cottbus Marat M. Arslanov, Kazan Wolfram Pohlers, Münster Günter Asser, Greifswald Pavel Pudlak, Prague John T. Baldwin, Chicago Andrzej Rosłanowski, Omaha Douglas S. Bridges, Canterbury Jörg Rothe, Düsseldorf Ramon Jansana, Barcelona Wilfried Sieg, Pittsburgh Carl G. Jockusch, Urbana Stephen G. Simpson, State College, PA Alexander Kechris, Pasadena Martin Weese, Potsdam Ulrich Kohlenbach, Darmstadt Klaus Weihrauch, Hagen H. Dugald Macpherson, Leeds W. Hugh Woodin, Berkeley
منابع مشابه
The hyper-weak distributive law and a related game in Boolean algebras
We discuss the relationship between various weak distributive laws and games in Boolean algebras. In the first part we give some game characterizations for certain forms of Prikry’s “hyper-weak distributive laws”, and in the second part we construct Suslin algebras in which neither player wins a certain hyper-weak distributivity game. We conclude that in the constructible universe L , all the d...
متن کاملΚ-stationary Subsets of Pκ+λ, Infinitary Games, and Distributive Laws in Boolean Algebras
We characterize the (κ, λ,< μ)-distributive law in Boolean algebras in terms of cut and choose games G <μ(λ), when μ ≤ κ ≤ λ and κ <κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, λ, μ with μ ≤ λ, under GCH. In the case when μ ≤ κ ≤ λ and κ = κ, we show that it is necessary to consider whether the κ-statio...
متن کاملON THE REPRESENTATION OF <r-COMPLETE BOOLEAN ALGEBRAS
A <r-complete Boolean algebra is a Boolean algebra in which for every sequence of elements a$-, i = l, • • • , there is an element U?an, the countable union of the a», such that aiQU?an for every i, and such that if diQx for every i then U?anQx. The dual operation, countable intersection, can be introduced through complementation, and the distributive law afMJi*'a» = Uf {aC\an) and its dual can...
متن کاملProfinite Heyting Algebras and Profinite Completions of Heyting Algebras
This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...
متن کاملGames and General Distributive Laws in Boolean Algebras
The games G 1 (κ) and G η <λ(κ) are played by two players in η +complete and max(η+ , λ)-complete Boolean algebras, respectively. For cardinals η, κ such that κ<η = η or κ<η = κ, the (η, κ)-distributive law holds in a Boolean algebra B iff Player 1 does not have a winning strategy in G 1 (κ). Furthermore, for all cardinals κ, the (η,∞)-distributive law holds in B iff Player 1 does not have a wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 55 شماره
صفحات -
تاریخ انتشار 2009