Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Decide the truth value of each statement. Then count the true ones.
For each false statement, say which part makes it false. Statement 1 sounds silly. Explain carefully why logic still gives it a truth value.
is false only when is true and is false, and . ' only if ' means . . is true when and agree.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Plan. Find the truth value of each part, then apply the table.
Step 1. Statement 1. The hypothesis is false. A conditional with a false hypothesis is true, whatever the conclusion. So it is T.
Step 2. Statement 2. is odd (T) and is prime (T). T T is T.
Step 3. Statement 3. is odd (T) but is not prime (F). T F is F. The conclusion makes it false.
Step 4. Statement 4. Both parts are true, so the biconditional is T.
Step 5. Statement 5. " is prime" is F and " is even" is T. The parts differ, so it is F.
Count. Statements 1, 2 and 4 are true: in all.
Why statement 1 has a value. A conditional only promises in the cases where holds. When never holds, the promise is never broken, so the statement is true.
Answer: true statements.
Log in to join the discussion.
Loading…