Patent ID: 6959314

Claim:
A method implemented by a computer for translating Boolean algebra into basic algebra, comprising: (a) assigning signal values s 0 and s 1 to variables, preferably {s 0 ,s 1 }={0,1}; and (b) substituting respectively the words “s 0 +(a−s 0 )(b−s 0 )/(s 1 −s 0 )”, “s 1 −(a−s 1 )(b−s 1 )/(s 1 −s 0 )”, and “s 0 +s 1 −a” written in basic algebra for the words “intersection of A and B”, “union of A and B”, and “complement of A” written in Boolean algebra, so as to translate expressions of Boolean algebra into expressions of basic algebra, which can then be simplified and evaluated in the usual straightforward manner.