From P → Q and ¬Q, infer ¬P; this rule is
A Modus ponens
B Modus tollens
C Affirming consequent
D Denying antecedent
Answer: B. Modus tollens. Modus tollens rejects the antecedent when the consequent is false.
From P → Q and Q, inferring P commits
A Modus tollens
B Valid conversion
C Affirming the consequent
D Conjunction elimination
Answer: C. Affirming the consequent. The consequent may be true for another reason.
From P → Q and ¬P, inferring ¬Q commits
A Modus ponens
B Disjunctive syllogism
C Valid contraposition
D Denying the antecedent
Answer: D. Denying the antecedent. The conditional does not rule out Q when P is false.
A conditional P → Q is false only when
A P true and Q false
B P false and Q true
C Both P and Q true
D Both P and Q false
Answer: A. P true and Q false. The only falsifying case has a true antecedent and false consequent.
For inclusive P ∨ Q, the formula is false when
A Either part is true
B Both parts are false
C Both parts are true
D Exactly one is true
Answer: B. Both parts are false. Inclusive disjunction is false only if neither disjunct is true.
The negation of P ∧ Q is equivalent to
A ¬P ∧ ¬Q
B P ∨ Q
C ¬P ∨ ¬Q
D P → Q
Answer: C. ¬P ∨ ¬Q. De Morgan's law changes and to or while negating both parts.
Two formulas true on exactly the same assignments are
A Contradictory
B Inconsistent
C Independent
D Logically equivalent
Answer: D. Logically equivalent. Logical equivalence means matching truth values in every assignment.
The negation of “All A are B” is
A Some A are not B
B No A are B
C All B are A
D Some B are A
Answer: A. Some A are not B. One counterexample is enough to deny the universal claim.
The negation of “Some A are B” is
A Some A are not B
B No A are B
C All A are B
D All B are A
Answer: B. No A are B. Denying that any A is B yields no A are B.
“Some A are not B” asserts at least
A Every A outside B
B No A in B
C One A outside B
D Every B is A
Answer: C. One A outside B. Some means at least one instance.
The formula ∀x P(x) says that
A Some x has property P
B No x has property P
C Exactly one x has P
D Every x has property P
Answer: D. Every x has property P. The universal quantifier applies the predicate to every domain member.
The formula ∃x P(x) says that
A Some x has P
B Every x has property P
C No x has property P
D Exactly two x have P
Answer: A. Some x has P. An existential claim requires one or more witnesses.
From ∀x P(x), concluding P(a) for a named object is
A Existential generalization
B Universal instantiation
C Conjunction introduction
D Disjunction elimination
Answer: B. Universal instantiation. A universal statement applies to any chosen domain member.
From P(a), concluding ∃x P(x) is
A Universal instantiation
B Negation introduction
C Existential generalization
D Conditional proof
Answer: C. Existential generalization. A named instance establishes that at least one instance exists.
A truth table for three independent variables has
A Four rows
B Six rows
C Nine rows
D Eight rows
Answer: D. Eight rows. Three binary variables create 2³ possible assignments.
From P ∨ Q and ¬P, concluding Q is
A Disjunctive syllogism
B Modus ponens
C Affirming consequent
D Conjunction introduction
Answer: A. Disjunctive syllogism. If one disjunct is false, the other must hold.
From P and Q, inferring P ∧ Q is
A Disjunctive syllogism
B Conjunction introduction
C Modus tollens
D Universal instantiation
Answer: B. Conjunction introduction. Both conjuncts support their conjunction.
From P ∧ Q, inferring P is
A Disjunction introduction
B Modus ponens
C Conjunction elimination
D Existential generalization
Answer: C. Conjunction elimination. A true conjunction entails each conjunct.
From P alone, inferring P ∨ Q is
A Conjunction elimination
B Modus tollens
C Conditional proof
D Disjunction introduction
Answer: D. Disjunction introduction. A true disjunct makes an inclusive disjunction true.
In P → Q, P is sufficient for Q and Q is
A Necessary for P
B Sufficient for P
C Contradictory to P
D Independent of P
Answer: A. Necessary for P. The consequent is required whenever the antecedent holds.
The inference from P → Q to Q → P is generally
A A tautology
B Invalid
C Modus ponens
D A biconditional
Answer: B. Invalid. The converse does not follow from the original conditional.
A formula and its negation cannot both be true; they are
A Equivalent
B Contingent
C Contradictory
D Independent
Answer: C. Contradictory. A proposition and its negation have opposite truth values.
If P ↔ Q is true, P and Q have
A Opposite truth values
B No truth value
C Unrelated meanings
D The same truth value
Answer: D. The same truth value. A biconditional is true when both sides match in truth value.
A standard categorical syllogism contains how many terms??
A Three
B Two
C Four
D Five
Answer: A. Three. The classic form uses major, minor, and middle terms.
A syllogism with an undistributed middle term may commit
A Modus tollens
B Undistributed middle
C False dilemma
D Existential import
Answer: B. Undistributed middle. The middle term must link the subject and predicate appropriately.