Decomposable collections of sets (Q794641)

\textit{C. Green} and \textit{G. Takeuti} [J. Fac. Sci., Univ. Tokyo, Sect. I A 24, 23-28 (1977; Zbl 0358.05020)] gave sufficient conditions which enable a Boolean polynomial to be factored into a statement in which no atom appears more than once. In this paper, the author presents a new proof of the Green-Takeuti result, and extends the proof to cover the case where the Boolean polynomial is infinitary. The notion of a ''weave'' is used. A weave is a set-theoretic object that corresponds to a two-person game in which each player presents a choice of moves from a set of possibilities, rather than a single move. In the new proof, the given polynomial is factored into a new polynomial, using an ''algorithm'' with infinitely many iterations. The use of such algorithms will be explored by the author in a subsequent paper.