On the weak distributivity game

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Distributivity implying Distributivity

Let B be a complete Boolean algebra. We show that if λ is an infinite cardinal and B is weakly (λ, ω)-distributive, then B is (λ, 2)-distributive. Using a similar argument, we show that if κ is a weakly compact cardinal such that B is weakly (2, κ)distributive and B is (α, 2)-distributive for each α < κ, then B is (κ, 2)-distributive.

متن کامل

Weak Σ-distributivity of Lattice Ordered Groups

In this paper we prove that the collection of all weakly distributive lattice ordered groups is a radical class and that it fails to be a torsion class.

متن کامل

Completeness of MLL proof-nets w.r.t. weak distributivity

We examine ‘weak-distributivity’ as a rewriting rule ; WD defined on multiplicative proof-structures (so, in particular, on multiplicative proof-nets: MLL). This rewriting does not preserve the type of proofsnets, but does nevertheless preserve their correctness. The specific contribution of this paper, is to give a direct proof of completeness for ; WD : starting from a set of simple generator...

متن کامل

On the Weak Index Problem for Game Automata

Game automata are known to recognise languages arbitrarily high in both the non-deterministic and alternating Rabin–Mostowski index hierarchies. Recently it was shown that for this class both hierarchies are decidable. Here we complete the picture by showing that the weak index hierarchy is decidable as well. We also provide a procedure computing for a game automaton an equivalent weak alternat...

متن کامل

Weak Distributivity, a Problem of von Neumann and the Mystery of Measurability

This article investigates the weak distributivity of Boolean ó-algebras satisfying the countable chain condition. It addresses primarily the question when such algebras carry a ó-additive measure. We use as a starting point the problem of John von Neumann stated in 1937 in the Scottish Book. He asked if the countable chain condition and weak distributivity are sufficient for the existence of su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1994

ISSN: 0168-0072

DOI: 10.1016/0168-0072(94)90077-9