June 2007 On sets not belonging to algebras
L. Š. Grinblat
J. Symbolic Logic 72(2): 483-500 (June 2007). DOI: 10.2178/jsl/1185803620

Abstract

Let $\mathcal{A}_1,..., \mathcal{A}_n, \mathcal{A}_{n+1}$ be a finite sequence of algebras of sets given on a set $X, \cup^n_{k=1}\mathcal{A}_k \neq \mathfrak{B}(X)$, with more than $\frac{4}{3}n$ pairwise disjoint sets not belonging to $\mathcal{A}_n$. It was shown in [4] and [5] that in this case $\cup^{n+1}_{k=1}\mathcal{A}_k \neq \mathfrak{B}(X)$. Let us consider, instead $\mathcal{A}_{n+1}$, a finite sequence of algebras $\mathcal{A}_{n+1},..., \mathcal{A}_{n+1}$. It turns out that if for each natural $i \leq l$ there exist no less than $\frac{4}{3}(n+l)-\frac{l}{24}$ pairwise disjoint sets not belonging to $\mathcal{A}_{n+i}$, then $\cup^{n+1}_{k=1}\mathcal{A}_k \neq \mathfrak{B}(X)$. But if $l \geq$ 195 and if for each natural $i \leq l$ there exist no less than $\frac{4}{3}(n+l)-\frac{l}{15}$ pairwise disjoint sets not belonging to $\mathcal{A}_{n+i}$, then $\cup^{n+1}_{k=1}\mathcal{A}_k \neq \mathfrak{B}(X)$. After consideration of finite sequences of algebras, it is natural to consider countable sequences of algebras. We obtained two essentially important theorems on a countable sequence of almost $\sigma$-algebras (the concept of almost $\sigma$-algebra was introduced in [4]).

Citation

Download Citation

L. Š. Grinblat. "On sets not belonging to algebras." J. Symbolic Logic 72 (2) 483 - 500, June 2007. https://doi.org/10.2178/jsl/1185803620

Information

Published: June 2007
First available in Project Euclid: 30 July 2007

zbMATH: 1127.03038
MathSciNet: MR2320287
Digital Object Identifier: 10.2178/jsl/1185803620

Subjects:
Primary: 03E05
Secondary: 54D35

Keywords: Algebra of sets , almost σ-algebra , pairwise disjoint sets , Ultrafilter

Rights: Copyright © 2007 Association for Symbolic Logic

JOURNAL ARTICLE
18 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.72 • No. 2 • June 2007
Back to Top