Let be a regular cardinal, a ring, and a left -module. We prove that for every ordinal there is a set of size at most such that every parameter-free formula of rank at most is equivalent in to an infinitary Boolean combination of cosets , where and is an infinitary positive existential formula of rank at most . The main ingredient in the proof is a combinatorial lemma which says that given subgroups of an abelian group, there is a set of at most points which tests whether any family in which each member is either empty or a coset of the corresponding subgroup covers the whole group. The proof proceeds by applying this lemma fiberwise to show that the relevant complete Boolean algebras of positive-existentially definable cosets are closed under projections.

生成讲解博客的中文版本

生成AI智能校验的中文版本