Conditions have been given elsewhere which guarantee that binary decision procedures have a simple structure. Here we show that a continuity requirement together with some weak algebraic regularity conditions ensures that a binary procedure is locally simple. Additional topological assumptions are given which require that the binary procedure is a simple game
