An argument is invalid if some case has true premises and a
A True conclusion
B Clear definition
C False conclusion
D Relevant example
Answer: C. False conclusion. One countermodel is enough to show invalidity.
A structure assigning true premises and a false conclusion is a
A Tautology
B Proof
C Definition
D Countermodel
Answer: D. Countermodel. A countermodel demonstrates that the conclusion does not follow.
A formal proof system is sound when every provable argument is
A Semantically valid
B Historically true
C Inductively strong
D Morally good
Answer: A. Semantically valid. Soundness means the rules do not prove invalid arguments.
A proof system is complete when every valid argument is
A Popular with readers
B Provable within it
C True by definition
D A tautology only
Answer: B. Provable within it. Completeness means all semantic consequences can be derived.
A set of formulas that can all be true together is
A Contradictory
B Invalid
C Consistent
D Unsound
Answer: C. Consistent. Consistency means there is at least one satisfying assignment.
A set containing P and ¬P is
A Equivalent
B Sufficient
C Contingent
D Inconsistent
Answer: D. Inconsistent. A proposition and its negation cannot both be true.
In a categorical statement, “All S are P” is traditionally labeled
A Universal affirmative
B Universal negative
C Particular affirmative
D Particular negative
Answer: A. Universal affirmative. The statement affirms a predicate of every subject.
“No S are P” is traditionally a
A Universal affirmative
B Universal negative
C Particular affirmative
D Particular negative
Answer: B. Universal negative. It denies the predicate of every subject.
In “All S are P,” the subject term is
A Undistributed
B A conclusion
C Distributed
D A middle term
Answer: C. Distributed. The claim covers every member of the subject class.
Swapping subject and predicate in “All cats are animals” to conclude all animals are cats is
A Modus ponens
B Universal instantiation
C Logical equivalence
D Invalid conversion
Answer: D. Invalid conversion. The original inclusion does not reverse its direction.
The scope of a quantifier determines which variables it
A Governs
B Negates automatically
C Makes true
D Turns into premises
Answer: A. Governs. Quantifier scope identifies the part of a formula it binds.
The negation of ∀x P(x) is
A ∀x ¬P(x)
B ∃x ¬P(x)
C ∃x P(x)
D ¬∃x ¬P(x)
Answer: B. ∃x ¬P(x). Not every object has P means some object lacks P.
The negation of ∃x P(x) is
A ∃x ¬P(x)
B ∀x P(x)
C ∀x ¬P(x)
D ¬∀x ¬P(x)
Answer: C. ∀x ¬P(x). No object has P means every object lacks P.
Negating “Every reader finished” yields
A No reader finished
B Every reader stopped
C Some reader finished
D Some reader did not finish
Answer: D. Some reader did not finish. The universal claim is denied by one nonexample.
An individual satisfying an existential claim is its
A Witness
B Predicate
C Domain
D Connective
Answer: A. Witness. A witness is an object for which the predicate holds.
The order of nested quantifiers can affect
A Truth tables only
B Meaning
C Term spelling
D Argument length
Answer: B. Meaning. Changing quantifier order can change what a formula asserts.
A predicate with two argument places expresses a
A Single property
B Truth table
C Relation
D Quantifier only
Answer: C. Relation. A two-place predicate can express a relation between objects.
“Every student admires someone” differs from “Someone is admired by every student” because
A Both are tautologies
B Neither has variables
C Their predicates differ
D Quantifier scope differs
Answer: D. Quantifier scope differs. The order and scope of quantifiers affect the meaning.
A syllogism is invalid when its middle term fails to connect the other terms; this can be
A Undistributed middle
B Valid conversion
C Universal instantiation
D Sound inference
Answer: A. Undistributed middle. The middle term must be distributed in at least one premise.
An inductive generalization is stronger when its sample is
A Convenient only
B Representative
C Very small
D Unrelated
Answer: B. Representative. A representative sample better supports generalization.
Inferring the best explanation from available evidence is
A Deduction
B Conjunction
C Abduction
D Conversion
Answer: C. Abduction. Abduction selects a plausible explanatory hypothesis.
A formal argument can be evaluated without knowing the topic because logic tracks its
A Popularity
B Historical setting
C Moral status
D Form
Answer: D. Form. Formal validity depends on structure rather than subject matter.
An argument can be valid even if its conclusion is
A Actually false
B A premise
C A question
D A definition
Answer: A. Actually false. Validity concerns truth preservation, not whether premises are in fact true.
A formula true under every interpretation is logically
A Inconsistent
B Valid
C Unsatisfiable
D Ambiguous
Answer: B. Valid. Logical validity holds under all admissible assignments.
A formula true under at least one interpretation is
A Contradictory
B Invalid by definition
C Satisfiable
D A false premise
Answer: C. Satisfiable. Satisfiability requires at least one model.