Editing User:Anisomorphism
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 51: | Line 51: | ||
| 1 || 1 || 0 | | 1 || 1 || 0 | ||
|} | |} | ||
XOR is only "true" or 1 when x or y but not both, are 1. Disjunctive normal form says that we can view the x, y entries as unary operators which return the input with no change, combine these as given on the lines which evaluate to 1, and take the OR of all of them for the total connective form of the truth table. Here is the | XOR is only "true" or 1 when x or y but not both, are 1. Disjunctive normal form says that we can view the x, y entries as unary operators which return the input with no change, combine these as given on the lines which evaluate to 1, and take the OR of all of them for the total connective form of the truth table. Here is the second line: <math> x\and\neg y</math>. The total is:<math> (x\and\neg y)\or (\neg x\and y)=(x\or(\neg x\and y))\and(\neg y(\neg x\and y))</math>, which can be viewed as a sum of "elementary functions" which are only 1 on one line, and building a general function/table that way. | ||
<math> | |||
= | |||
</math> Β | |||
= Read prototype = | = Read prototype = | ||