What is a Biconditional Statement?
A two way statement that uses "If and only if."
How can we prove that a conditional statement is false?
How do we know when a conditional is false in a truth table?
For Sentence-based problems: When we can locate a counter-example (different q)
Using Truth Tables: When p is true and q is false (TF)
What is a Statement?
A declarative statement that is either true or false, but not both true and false
Truth Tables that involve three statements use the letters ____, ____, and ____ AND the table has ___ rows instead of 4.
p, q, r, 8
What words match the following symbols?
~ =
^ =
V =
-> =
<-> =
Not
And
OR
If, then
If and only if
Create a Truth table for ~pvq
p- t,t,f,f q- t,f,t,f ¬p- f,f,t,t ¬pvq- t,f,t,t
Create a truth table for (p v r) ∧ q
p- t,t,t,t,f,f,f,f q- t,t,f,f,t,t,f,f r- t,f,t,f,t,f,t,f (p v r)- t,t,t,f,t,t,t,f (p v r) ∧ q- t,t,f,f,t,t,f,t
If p is "I will go out with my family" and q is "I have money." Write p<=>~q.
I will go out with my family, if and only if i do not have money.
Which of the following are Statements A) Do we have school tomorrow B) 100 x 5 = 250 x 2 C) Your hair is black
B and C
Create a Truth table for (p v q)=>(p ∧ q)
p- t,t,f,f q- t,f,t,f pvq- t,t,t,f p∧q- t,f,f,f (pvq)=>(p∧q)- t,f,f,t
Create a truth table for (p => q) v (r v p)
p- t,t,t,t,f,f,f,f q- t,t,f,f,t,t,f,f r- t,f,t,f,t,f,t,f (p => q)- t,t,f,f,t,t,t,t (r v p)- t,t,t,t,t,f,t,f (p => q) v (r v p)- t,t,t,t,t,t,t,t
If p is "I will play soccer" and q is "Its shining outside." Write ~p<=>~q
I will not play soccer, if and only if it not shining outside.
What is the negation of p->q
"If I go to Miami, then I will be at the beach"
Negation p^~q
I am at Miami and I am not at the beach
What letters are use for statements? A) p,q, and t B) r,p, and f C) p,q, and r D) r,p and a
C
Create a Truth table for ~p<=>~q
p- t,t,f,f q- t,f,t,f ¬p- f,f,t,t ¬q- f,t,f,t ¬p<=>¬q- t,f,f,t
Create a truth table for p=>[(~q v r) <=> (q ∧ p)]
p- t,t,t,t,f,f,f,f q- t,t,f,f,t,t,f,f r- t,f,t,f,t,f,t,f
~q- f,f,t,t,f,f,t,t (~q v r)- t,f,t,t,t,f,t,t
(q ∧ p)- t,t,f,f,f,f,f,f
[(~q v r) <=> (q ∧ p)]- t,f,f,f,f,t,f,f
p=>[(~q v r) <=> (q ∧ p)]- t,f,f,f,t,t,t,t
I will not go to school, if and only if I sleep late. Write the symbols only.
~p<=>q
Write the negation of
"All students are A students"
SOME students are NOT A students
Create a Truth table for (~p<=>~q)=> (pvq)
p- t,t,f,f q- t,f,t,f ¬p- f,f,t,t ¬q- f,t,f,t (¬p<=>¬q)- t,f,f,t (pvq)- t,f,f,t (¬p<=>¬q)=> (pvq)- t,t,t,t
Create a truth table for [~(p ∧ q) v (p ∧ r)] ∧ [(~p v ~q) => ~r]
p- t,t,t,t,f,f,f,f q- t,t,f,f,t,t,f,f r- t,f,t,f,t,f,t,f
~p- f,f,f,f,t,t,t,t ~q- f,f,t,t,f,f,t,t ~r- f,t,f,t,f,t,f,t
(p ∧ q)- t,t,f,f,f,f,f,f ~(p ∧ q)-f,f,t,t,t,t,t,t
(p ∧ r)- t,f,t,f,f,f,f,f ~(p ∧ q) v (p ∧ r)- t,f,t,t,t,t,t,t
(~p v ~q)- f,f,t,t,t,t,t,t (~p v ~q) => ~r- t,t,t,f,t,f,t,f
[~(p ∧ q) v (p ∧ r)] ∧ [(~p v ~q) => ~r]- t,f,t,f,t,f,t,f