The document discusses conditional and biconditional statements. It defines conditional statements as being in the form "if p, then q" and defines the antecedent as "p" and the consequent as "q". It presents examples of identifying the antecedent and consequent of conditional statements. It also discusses writing conditionals using arrow notation, constructing truth tables for conditionals and biconditionals, and the equivalent forms and negations of conditional statements. Key topics covered include the truth tables for conditionals and biconditionals, and how to determine the truth value of statements involving these logical connectives.
The document discusses conditional and biconditional statements. It defines conditional statements as being in the form "if p, then q" and defines the antecedent as "p" and the consequent as "q". It presents examples of identifying the antecedent and consequent of conditional statements. It also discusses writing conditionals using arrow notation, constructing truth tables for conditionals and biconditionals, and the equivalent forms and negations of conditional statements. Key topics covered include the truth tables for conditionals and biconditionals, and how to determine the truth value of statements involving these logical connectives.
The document discusses conditional and biconditional statements. It defines conditional statements as being in the form "if p, then q" and defines the antecedent as "p" and the consequent as "q". It presents examples of identifying the antecedent and consequent of conditional statements. It also discusses writing conditionals using arrow notation, constructing truth tables for conditionals and biconditionals, and the equivalent forms and negations of conditional statements. Key topics covered include the truth tables for conditionals and biconditionals, and how to determine the truth value of statements involving these logical connectives.
The document discusses conditional and biconditional statements. It defines conditional statements as being in the form "if p, then q" and defines the antecedent as "p" and the consequent as "q". It presents examples of identifying the antecedent and consequent of conditional statements. It also discusses writing conditionals using arrow notation, constructing truth tables for conditionals and biconditionals, and the equivalent forms and negations of conditional statements. Key topics covered include the truth tables for conditionals and biconditionals, and how to determine the truth value of statements involving these logical connectives.
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 16
Conditional and
Biconditional statements Conditional Statements Conditional statements can be written in if p, then q form or in if p, q form. For instance, all of the following are conditional statements. a. If we order pizza, then we can have it delivered. b. If you go to the movie, you will not be able to meet us for dinner. c. If n is a prime number greater than 2, then n is an odd number.
In any conditional statement represented by “If p, then q” or by “if p,
q,” the p statement is called antecedent and the q statement is called the consequent. Identify the Antecedent and Consequent of a Conditional
1. If our school was this nice, I would go there more than
once a week. 2. If you don’t get in that plane, you’ll regret it. 3. If you strike me down, I shall become more powerful than you can possibly imagine. solution 1. Antecedent: our school was this nice Consequent: I would go there more than once a week 2. Antecedent: you don’t get in that plane Consequent: you’ll regret it 3. Antecedent: you strike me down Consequent: I shall become more powerful than you can possibly imagine Arrow Notation
The conditional statement, “if p, then q,” can be written using
the arrow notation p → q. The narrow notation p → q is read as “ if p, then q” or as “p implies q.” Truth table for Conditional p → q The conditional p → q is false if p is true and q is false. It is true in all other cases. p q p→q T T T T F F F T T F F T Determine the truth value of each of the following conditional statements.
a. If 2 is an integer, then 2 is a rational number.
b. If 3 is a negative number, then 5 > 7. c. If 5 > 3, then 2 + 7 = 4. Construct a Truth Table for statements involving conditional Construct a truth table for [ p ^ ( q ˅ ~ p) ] → ~ p.
p q [p ^ (q ˅ ~ p )] → ~p
T T T T T T F F F
T F T F F F F T F
F T F F T T T T T
F F F F F T T T T
1 6 2 5 3 7 4 Equivalent form of Conditional Statement
p→q≡~pvq Write a Conditional in its Equivalent Disjunctive Form
a. If Cam Newton cannot play, then his team will lose.
b. If I don’t move to Georgia, I will live in Houston. c. If the number is divisible by 2, then the number is even. Solution
a. Cam Newton can play or his team will lose.
b. I will move to Georgia or I will live in Houston. c. The number is not divisible by 2 or the number is even. Negation of The Conditional
The Negation of p → q ~ (p → q) ≡ p ^ ~ q Write the Negation of each conditional statement. a. If they pay me the money, I will sign the contract. b. If the lines are parallel, then they do not intersect.
Solution: a. They paid me the money and I did not sign the contract. b. The lines are parallel and they intersect. Biconditional Statement The statement ( p → q ) ^ ( q → p ) is called a Biconditional and is denoted by p ↔ q, which is read as “ p if and only if q.”
Equivalent form of the Biconditional p ↔ q
p↔q ≡ [(p→q)^(q→p)] Truth value of Biconditional p ↔ q
The Biconditional p ↔ q is true only when p and q have the same
truth value.
p q p↔q T T T T F F F T F F F T Determine the truth value of a Biconditional a. x + 4 = 7 if and only if x = 3. b. x² = 36 if and only if x = 6.
