Asked by Deb
Truth tables are related to Euler circles. Arguments in the form of Euler circles can be translated into statements using the basic connectives and the negation as follows:
Let p be gthe object belongs to set Ah. Let q be gthe object belongs to set Bh
All A is B is equivalent to p ¨ q
No A is B is equivalent to p ¨ ~ q
Some A is B is equivalent to p ĩ q
Some A is not B is equivalent to p ĩ ~ q
Let p be gthe object belongs to set Ah. Let q be gthe object belongs to set Bh
All A is B is equivalent to p ¨ q
No A is B is equivalent to p ¨ ~ q
Some A is B is equivalent to p ĩ q
Some A is not B is equivalent to p ĩ ~ q