Cigol is a student who dislikes truth tables. Cigol is considering statements that are made out of statements P and Q (possibly repeated), together with the symbols ∨, ∧, and ∼. Cigol will call two statements “related” if they agree in at least three of the four columns of a truth table. For example: the statements P ∨Q and (P ∨Q)∧ ∼ (P ∧Q) agree in three cases (P and Q both false; P true and Q false; P false and Q true), so Cigol calls them related.

Show that Cigol’s relation is not an equivalence relation.
asked Nov 17, 2016 in Other Math Topics by anonymous

Have no proof of an answer. sad

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:

To avoid this verification in future, please log in or register.

1 Answer

answered Jan 1 by Mathical Level 10 User (55,420 points)

Related questions

0 answers
asked Sep 18, 2013 in Algebra 2 Answers by anonymous | 83 views
1 answer
asked Oct 26, 2014 in Geometry Answers by anonymous | 125 views
0 answers
asked Dec 20, 2011 in Geometry Answers by anonymous | 104 views
2 answers
asked Dec 6, 2011 in Geometry Answers by anonymous | 1,266 views
Welcome to, where students, teachers and math enthusiasts can ask and answer any math question. Get help and answers to any math problem including algebra, trigonometry, geometry, calculus, trigonometry, fractions, solving expression, simplifying expressions and more. Get answers to math questions. Help is always 100% free!
78,519 questions
82,359 answers
63,346 users