You are on page 1of 2

Converse, Contrapositive, and Inverse There are some other common ways to

express p⟷q:
We can form some new conditional "p is necessary and sufficient for q"
statements starting with a conditional "if p then q , and conversely"
statement p⟶q. In particular, there are three
related conditional statements that occur so If p = "You can take the flight."
often that they have special names. The q = "You buy a ticket."
proposition q⟶p is called the converse of Then p⟷q is the statement;
p⟶q. The contrapositive of p⟶q is the "You can take the flight if and only if you buy
proposition ¬q⟶ ¬p. The proposition a ticket."
¬p⟶ ¬q is called the inverse of p⟶q. We
will see that of these three conditional Translating English Sentences into Logical
statements formed from p⟶q, only the Expression
contrapositive always has the same truth Example 1:
value as p⟶q. "You can access the Internet from campus
only if you are a computer science major or
BICONDITIONALS you are not a freshman."
We will use propositional variables to
Let p and q be propositions. The bi- represent each sentence part and determine
conditional statement p⟷q is the proposition the appropriate logical connectives between
"p if and only if q." The bi-conditional them. In particular, we let a="You can access
statement p⟷q is true when p and q have the the Internet from campus", c="You are a
same truth values, and is false otherwise. Bi- computer science major", and f="You are a
conditional statements are also called bi- freshman". Noting that "only if" is one way a
implications. conditional statement can be expressed, this
sentence can be represented as;
The truth table for p⟷q is shown below. a ⟶ (c ∨ ¬f)

Example 2:
"You cannot ride the roller coaster if you are
under 4 feet tall unless you are older than
1 6 years old."
Let q="You can ride the roller coaster",
Note that the statement p⟷q is true when r="You are under 4 feet tall" and s="You are
both the conditional statements p⟶q and older than 1 6 years old". Then the sentence
q⟶p are true and is false otherwise. That is can be translated to;
why we use the words "if and only if" to (r ∧ ¬s) ⟶ ¬q
express this logical connective and why it is
symbolically written by combining the
symbols ⟶ and ⟵.
Logical Equivalences Logical Equivalence
Compound propositions that have the same
truth values in all possible cases are called
logically equivalent.
One way to determine whether two
compound propositions are equivalent is to
use a truth table. In particular, the compound
propositions p and q are equivalent if and
only if the columns giving their truth values
agree.

Example 1:
Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically
equivalent.

Example 2:
Show that p⟶q and ¬p ∨ q are logically Logical Equivalence Involving
Conditional Statements
equivalent.

Example 3:
Show that p ∨ (q ∧ r) and (p ∨ q) ∧ (p ∨ r) are
logically equivalent.
Logical Equivalence
Involving Bi-conditional

You might also like