Which condition defines a valid deductive argument?
6/9 6. Testing Arguments with Truth Tables Online Quiz Questions
Use this free practice quiz with 20 questions to review 6/9 6. Testing Arguments with Truth Tables, test your knowledge, and prepare for your next test or exam.
For which valuation is the conditional p → q false?
- A
p = T and q = T
- B
p = F and q = T
- C
p = T and q = F
- D
p = F and q = F
A truth table contains three basic propositions: p, q, and r. How many rows are required for a complete table?
- A
8 rows
- B
6 rows
- C
4 rows
- D
9 rows
Which two steps are part of the joint-premise method for testing an argument? Select all correct choices.
- A
It combines all premises using conjunction.
- B
It tests each premise independently without forming a larger expression.
- C
It places the conclusion as the consequent of a conditional.
- D
It requires the conclusion to be conjoined with every premise.
Which two properties must a countervaluation have? Select all correct choices.
- A
It makes at least one premise false.
- B
It makes every premise true.
- C
It makes the conclusion true.
- D
It makes the conclusion false.
True or false: An argument is invalid if and only if a truth table contains at least one row in which every premise is true and the conclusion is false.
- A
True
- B
False
True or false: If a truth table shows that an argument is valid, it also establishes that every premise in the argument is factually true.
- A
True
- B
False
What is the technical term for a truth-table row in which every premise is true while the conclusion is false?
How many rows are needed in a complete truth table with three basic propositions?
In the joint-premise method, an argument is valid when the final conditional is a on every row of the truth table.
To test validity directly, examine rows where every premise is . The argument is invalid if the conclusion is in at least one such row.
Use the faster countervaluation procedure to test this argument: p → q; q; therefore p. State whether it is valid or invalid, and justify your answer with a valuation of p and q.
Given p = F and q = F, what is the truth value of p → q?
- A
T
- B
F
A truth table contains three basic propositions. How many rows are required for a complete table?
- A
6 rows
- B
8 rows
- C
9 rows
- D
12 rows
For which assignment of truth values is the conditional p→q false?
- A
p=F,q=F
- B
p=F,q=T
- C
p=T,q=F
- D
p=T,q=T
True or false: A single truth-table row with a false premise is sufficient to prove that an argument is invalid.
- A
True
- B
False
An argument has premises P1, P2, and P3, followed by conclusion C. Which expression represents the joint-premise method?
- A
[(P1∧P2∧P3)→C]
- B
[(P1→P2→P3)∧C]
- C
[(P1∨P2∨P3)→C]
- D
[C→(P1∧P2∧P3)]
What is the logical term for a truth-table row on which all premises are true and the conclusion is false?
A truth table for the argument p→q, p, therefore q, has only true values in the final column of [(p→q)∧p]→q. What conclusion follows?
- A
The argument is invalid because p→q is false on one row.
- B
The argument is unsound because truth tables cannot test arguments.
- C
The argument is invalid because p is false on two rows.
- D
The argument is valid because [(p→q)∧p]→q is true on every row.
What is the logical term for a compound proposition that is true on every row of its truth table?