A simultaneous generalization of independence and disjointness in Boolean algebras (Q1943678)

Let \(n\leq\omega\). A subset \(X\) of a Boolean algebra \(A\) is called \(n\)-independent iff for every finite subset \(R\) of \(X\) and every \(\varepsilon:R\rightarrow2\), if \(\prod_{x\in R}x^{\varepsilon(x)}=0\) then there is a subset \(R'\) of \(R\) of size at most \(n\) such that \(\varepsilon(x)=1\) for all \(x\in R'\), and \(\prod_{x\in R'}x=0\). Here \(x^0=-x\) and \(x^1=x\). This is a generalization of the notion of \(\perp\)-free due to Heindorf, which in turn is an algebraic version of supercompactness studied by M. Bell, van Mill, and others. The article investigates this notion rather thoroughly. The deepest result concerns \(i_n(A)\), which is defined to be the least size of a maximal \(n\)-independent subset of \(A\). A forcing construction is used to prove the consistency of \(i_n({\mathcal P}(\omega)/\mathrm{fin})=\omega_1<2^\omega\).