biconditional

If two simple statements p and q are connected by the connective 'if and only if', then the resulting compound statement is called the biconditional statement. Symbolically it is represented by p q. Example: An integer is even if and only if it is divisible by 2. It is a biconditi..

Conditional and Biconditional Statements - It is already mentioned in earlier classes that compound statements of different propositions can be obtained by conjunction, disjunction and negation of propositions. We just recall these three basic logical connectivities and their truth table ..

It is already mentioned in earlier classes that compound statements of different propositions can be obtained by conjunction, disjunction and negation of propositions. We just recall these three basic logical connectivities and their truth table and subsequently we shall learn about conditional and..

Logical Equivalence - Two propositions (simple or compound) are said to be logically equivalent if they have identical truth values. If p is logically equivalent to q, we denote p q. We have already constructed the truth table of (~p) q in earlier class. Recall the same truth table. Truth Table for..

If p and q are propositions, then the conjunction of conditionals p q and q p is called a biconditional proposition. Let us construct the truth table of (p q) (q p) The last column of above table is identical to the last column of earlier table..

; The biconditional statement 'p q' of statements p and q is true only when p and q have same truth value..

q is false only when p is true and q is false. In other cases, it is true. If p q, then the contrapositive of this proposition is -q -p. The biconditional p q is true only when both p and q are true or both p and q are false. A compound proposition which is always true for all combination ..