A generalization of the three modules theorem (Q1079513)

A simple game is conceptually equivalent to a coherent system in reliability theory. The characterization of modular sets of coherent systems and simple games has been extensively investigated. In a recent paper, based on analogy with graph theory and matroids, an operation called contraction was introduced for simple games as well as coherent systems. Using contraction, a new characterization for modular sets was given by the authors [ibid. 21, 167-171 (1984; Zbl 0553.90106)]. In this paper, we again make use of contraction to obtain yet another characterization for modular sets.