hey I have a question |
11000∧(01011∨11011)
how do I evaluate something like that???
This refers to a mapping of propositional logic to binary
operations in whichF->0, T->1.
In this set up p∧q=1 iff p=q=1, p∨q=0 iff p=q=0 and
-p=0 iff p=1. These operations extend to binary strings
pointwise, so that e.g. pqr∧stu=(p∧s)(q∧t)(r∧u), and
101∨011=(1∨0)(0∨1)(1∨1)=111.
operations in whichF->0, T->1.
In this set up p∧q=1 iff p=q=1, p∨q=0 iff p=q=0 and
-p=0 iff p=1. These operations extend to binary strings
pointwise, so that e.g. pqr∧stu=(p∧s)(q∧t)(r∧u), and
101∨011=(1∨0)(0∨1)(1∨1)=111.
No comments:
Post a Comment