If P is false, and Q is false, the truth-value of "P ↔Q" is (Points : 1) false. true. Cannot be determined. All of the above. 2. What is the truth value of the sentence "P & ~ P"? (Points : 1) True False Cannot be determined Not a sentence 3. If P is true, and Q is false, the truth-value of "P → Q" is (Points : 1) false. true. Cannot be determined. All of the above. 4. Truth tables can determine which of the following? (Points : 1) If an argument is valid If an argument is sound If a sentence is valid All of the above 5. The sentence "P ↔ Q" is best read as (Points : 1) If P then Q If Q then P P or Q P if and only if Q 6. "Julie and Kurt got married and had a baby" is best symbolized as (Points : 1) M v B M & B M → B M ↔ B 7. Truth tables can (Points : 1) display all the possible truth values involved with a set of sentences. determine what scientific claims are true. determine if inductive arguments are strong. determine if inductive arguments are weak. 8. In the conditional "P →Q," "P" is a (Points : 1) sufficient condition for Q. sufficient condition for P. necessary condition for P. necessary condition for Q. 9. The truth table for a valid deductive argument will show (Points : 1) wherever the premises are true, the conclusion is true. that the premises are false. that some premises are true, some premises false. wherever the premises are true, the conclusion is false. 10. A conditional sentence with a false antecedent is always (Points : 1) true. false. Cannot be determined. not a sentence.