Posted by
**Anymous** on
.

The sentence "P → Q" is read as (3)

P or Q

P and Q

If P then Q

Q if and only P

2. In the truth table for an invalid argument, (2)

on at least one row, where the premises are all true, the conclusion is true.

on at least one row, where the premises are all true, the conclusion is false.

on all the rows where the premises are all true, the conclusion is true.

on most of the rows, where the premises are all true, the conclusion is true.

3. Truth tables can (1 0R 2)

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.

4. Truth tables can determine which of the following? (1)

If an argument is valid

If an argument is sound

If a sentence is valid

All of the above

5. If P is false, and Q is false, the truth-value of "P ↔Q" is (1)

false.

true.

Cannot be determined.

All of the above.

6. What is the truth value of the sentence "P v ~ P"? (Points : 1)

True

False

Cannot be determined

Not a sentence

7. If P is true, and Q is false, the truth-value of "P v Q" is (1)

false.

true.

Cannot be determined

All of the above

8. The sentence "P ↔ Q" is best read as

(4)

If P then Q

If Q then P

P or Q

P if and only if Q

9. What is the truth value of the sentence "P & ~ P"? (3)

True

False

Cannot be determined

Not a sentence

10. In the conditional "P →Q," "P" is a (3)

sufficient condition for Q.

sufficient condition for P.

necessary condition for P.

necessary condition for Q.