Given that XOR is defined by [itex]((X \wedge \neg Y) \vee (\neg X \wedge Y))[/itex], in order to prove that XOR is commutative is it sufficient to prove that(adsbygoogle = window.adsbygoogle || []).push({});

[itex]((X \wedge \neg Y) \vee (\neg X \wedge Y)) \supset ((Y \wedge \neg X) \vee (\neg Y \wedge X))[/itex]

is a tautology?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Logic proof

Loading...

Similar Threads for Logic proof |
---|

A About the “Axiom of Dependent Choice” |

B Linear logic, what is it? |

Logic & science |

B What is the usefulness of formal logic theory? |

B Conditional Probability, Independence, and Dependence |

**Physics Forums | Science Articles, Homework Help, Discussion**