Replace each row and column with one if any of value in that row or column is zero. A Boolean Matrix Question. 0 Theorem 2.2 shows that the projection network is the most accurate binary network upper bound for a relation. A Boolean function is an algebraic expression formed using binary constants, binary variables and Boolean logic operations symbols. This network is called the minimal network. In order to support logical operations wherein 0 would be assigned True (e.g. Indeed, the next proposition immediately follows from Theorem 2.3. For example, to see the elements of x that satisfy both the conditions (x