# LMD Async Tutoring

**URL:** <https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933>\
**Category:** Tutoring\
**Created:** [April 23, 2024, 12:05am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933 "2024-04-23T00:05:39Z")\
**Posts on this page:** 1\
**Showing post:** 353

<div class="post-metadata">

**Author:** ![LMD](https://discuss.criticalfallibilism.com/user_avatar/discuss.criticalfallibilism.com/lmd/32/3213_2.png) [@LMD](https://discuss.criticalfallibilism.com/u/LMD)\
**Post date:** [July 10, 2024, 1:50am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/353 "2024-07-10T01:50:55Z")

</div>

From Eternity’s thread:

> [@Eternity Async Tutoring](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932/264):
>
> Can you define xor(x,y,z) now (for odd number of true inputs meaning of xor, not exactly one true input meaning)?

I already knew that xor(x xor(y z)) was another way to write xor(x, y, z), but I used the approach that Eternity used with English xor and tried:

(x^y^z)v(x^~y^~z)v(~x^y^~z)v(~x^~y^z)

In english: all of them true or x true or y true or z true. So all possible odd combinations of inputs. This makes it easy to see what inputs it will allow and still be true. I used the truth table generator to save me time making a big truth table for this when I just wanted to check if it did give the right outputs, and it does:

 ![Screenshot 2024-07-10 at 11.10.47 AM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/4/44250b6a670bd2bb3d49a09a12c2e4faa4621a70.png)

---

_[View the full topic](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933)._