# Eternity Async Tutoring **URL:** \ **Category:** Tutoring\ **Created:** [April 17, 2024, 11:22pm UTC](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932 "2024-04-17T23:22:52Z")\ **Posts on this page:** 1\ **Showing post:** 260
**Author:** ![Eternity](https://discuss.criticalfallibilism.com/user_avatar/discuss.criticalfallibilism.com/eternity/32/5930_2.png) [@Eternity](https://discuss.criticalfallibilism.com/u/Eternity)\ **Post date:** [June 23, 2024, 4:01am UTC](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932/260 "2024-06-23T04:01:16Z")
Ok so I re-worded this kind of in my head to make more sense of this: I’m looking to create logical expressions for which I can use to tell whether I have 0,1,2, or 3 inputs out of 3 be true. 0 and 3 were easy. For 0 you can use an “or” or “nor” gate. If OR outputs false, all the inputs are false. If NOR outputs true all inputs are false. Regardless you can judge that all three inputs were false. For 3 you can use an “and” or “nand” gate. If and outputs true, that means all the inputs were true. If nand outputs false that means no input was false, they were all true. Regardless you can judge that all three inputs were true. For 1 and 2 I came up with these expressions: One Input: (x∧~y∧~z)∨(~x∧y∧~z)∨(~x∧~y∧z) ![image](https://discuss.criticalfallibilism.com/uploads/default/original/2X/5/5298354e252d57a445813f6d66e58e69f883f951.png) Two Input: (x∧y∧~z)∨(~x∧y∧z)∨(x∧~y∧z) ![image](https://discuss.criticalfallibilism.com/uploads/default/original/2X/4/4acf292583640966840cfab03cb438bd505a3a6c.png) When it came out to trying different ideas for the three input ones I got tired of making truth tables and looked up for a program that makes the tables for me. It doesn’t solve anything. It just creates the tables based on my input. If this is an issue I’ll stop using it. This is the website: [https://truth-table.com/](https://truth-table.com/) --- _[View the full topic](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932)._