Logic MCQs (Set-2)

From P → Q and ¬Q, infer ¬P; this rule is

A Modus ponens
B Modus tollens
C Affirming consequent
D Denying antecedent

From P → Q and Q, inferring P commits

A Modus tollens
B Valid conversion
C Affirming the consequent
D Conjunction elimination

From P → Q and ¬P, inferring ¬Q commits

A Modus ponens
B Disjunctive syllogism
C Valid contraposition
D Denying the antecedent

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

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

The negation of P ∧ Q is equivalent to

A ¬P ∧ ¬Q
B P ∨ Q
C ¬P ∨ ¬Q
D P → Q

Two formulas true on exactly the same assignments are

A Contradictory
B Inconsistent
C Independent
D Logically equivalent

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

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

“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

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

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

From ∀x P(x), concluding P(a) for a named object is

A Existential generalization
B Universal instantiation
C Conjunction introduction
D Disjunction elimination

From P(a), concluding ∃x P(x) is

A Universal instantiation
B Negation introduction
C Existential generalization
D Conditional proof

A truth table for three independent variables has

A Four rows
B Six rows
C Nine rows
D Eight rows

From P ∨ Q and ¬P, concluding Q is

A Disjunctive syllogism
B Modus ponens
C Affirming consequent
D Conjunction introduction

From P and Q, inferring P ∧ Q is

A Disjunctive syllogism
B Conjunction introduction
C Modus tollens
D Universal instantiation

From P ∧ Q, inferring P is

A Disjunction introduction
B Modus ponens
C Conjunction elimination
D Existential generalization

From P alone, inferring P ∨ Q is

A Conjunction elimination
B Modus tollens
C Conditional proof
D Disjunction introduction

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

The inference from P → Q to Q → P is generally

A A tautology
B Invalid
C Modus ponens
D A biconditional

A formula and its negation cannot both be true; they are

A Equivalent
B Contingent
C Contradictory
D Independent

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

A standard categorical syllogism contains how many terms??

A Three
B Two
C Four
D Five

A syllogism with an undistributed middle term may commit

A Modus tollens
B Undistributed middle
C False dilemma
D Existential import