Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity.
Previous lesson: Conditional Operator
Your Last Operator!Edit
The biconditional operator looks like this:
It is a dyadic operator. You'll learn about what it does in the next section.
Compound Propositions and Logical EquivalenceEdit
Now you will be introduced to the concepts of logical equivalence and compound propositions.
- Compound propositions involve the assembly of multiple statements, using multiple operators.
- Logical equivalence means that the truth tables of two statements are the same.
The biconditional operator is sometimes called the "if and only if" operator. = TRUE means that the truth values of p and q are the same. "You will see the notes for this class if and only if someone shows them to you" is an example of a biconditional statement.
- If someone shows you the notes and you see them, the statement is true.
- If someone shows you the notes and you do not see them, the biconditional statement is violated. Therefore, a value of "false" is returned.
- If no one shows you the notes and you see them, the biconditional statement is violated. Therefore, a value of "false" is returned.
- If no one shows you the notes and you do not see them, a value of true is returned.
- The biconditional statement is logically equivalent to !
Truth Table for the BiconditionalEdit
The next lesson is called Compound Propositions and Useful Rules.