Bounding, splitting, and almost disjointness
نویسندگان
چکیده
منابع مشابه
Bounding, splitting, and almost disjointness
We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, splitting number, and the existence of certain kinds of splitting families.
متن کاملSplitting, Bounding, and Almost Disjointness Can Be Quite Different
We prove the consistency of add(N ) < cov(N ) < p = s < add(M) = cof(M) < a = non(N ) = c with ZFC where each of these cardinal invariants assume arbitrary uncountable regular
متن کاملAlmost Splitting Sets and Agcd Domains
Let D be an integral domain. A multiplicative set S of D is an almost splitting set if for each 0 6= d ∈ D, there exists an n = n(d) with dn = st where s ∈ S and t is v-coprime to each element of S. An integral domain D is an almost GCD (AGCD) domain if for every x, y ∈ D, there exists a positive integer n = n(x, y) such that xnD ∩ ynD is a principal ideal. We prove that the polynomial ring D[X...
متن کاملFrom Almost Gaussian to Gaussian Bounding Differences of Differential Entropies
We consider lower and upper bounds on the difference of differential entropies of a Gaussian random vector and an almost Gaussian random vector after both are “smoothed” by an arbitrarily distributed random vector of finite power. These bounds are important to prove the optimality of corner points in the capacity region of Gaussian interference channels. The upper bound, presented in MaxEnt-201...
متن کاملLearning Disjointness
An increasing number of applications benefits from light-weight ontologies, or to put it differently “a little semantics goes a long way”. However, our experience indicates that more expressiveness can offer significant advantages. Introducing disjointness axioms, for instance, greatly facilitates consistency checking and the automatic evaluation of ontologies. In an extensive user study we dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2014
ISSN: 0168-0072
DOI: 10.1016/j.apal.2013.09.002