What is a proposition in logic?
Correct answer:
A) A declarative statement that is either true or false
Explanation: A proposition is a declarative sentence that has a definite truth value, either true or false but not both.
What is a proposition in logic?
Correct answer:
A) A declarative statement that is either true or false
Explanation: A proposition is a declarative sentence that has a definite truth value, either true or false but not both.
What does the logical conjunction (AND, ∧) require to be true?
Correct answer:
B) Both operands must be true
Explanation: A conjunction p ∧ q is true only when both p and q are true; otherwise it is false.
What does the logical disjunction (OR, ∨) require to be true?
Correct answer:
C) At least one operand must be true
Explanation: A disjunction p ∨ q is true when at least one of p or q is true, and false only when both are false.
What does negation (NOT, ¬) do to a proposition?
Correct answer:
D) Reverses its truth value
Explanation: Negation ¬p is true when p is false and false when p is true, reversing the truth value.
When is the conditional p → q false?
Correct answer:
A) When p is true and q is false
Explanation: The conditional p → q is false only in the single case where the hypothesis p is true but the conclusion q is false.
What is the converse of the conditional p → q?
Correct answer:
B) q → p
Explanation: The converse of p → q is q → p, obtained by swapping the hypothesis and conclusion.
What is the contrapositive of p → q?
Correct answer:
C) ¬q → ¬p
Explanation: The contrapositive is ¬q → ¬p. A conditional and its contrapositive are logically equivalent.
A conditional statement is logically equivalent to its:
Correct answer:
D) Contrapositive
Explanation: A conditional is logically equivalent to its contrapositive but not to its converse or inverse.
What is a biconditional p ↔ q true?
Correct answer:
A) When p and q have the same truth value
Explanation: The biconditional p ↔ q is true exactly when p and q share the same truth value, both true or both false.
What is a tautology?
Correct answer:
B) A statement that is always true
Explanation: A tautology is a compound proposition that is true for every possible assignment of truth values to its variables.
What is a contradiction in logic?
Correct answer:
C) A statement that is always false
Explanation: A contradiction is a compound proposition that is false under every possible truth assignment.
According to De Morgan's laws, ¬(p ∧ q) is equivalent to:
Correct answer:
D) ¬p ∨ ¬q
Explanation: De Morgan's law states that the negation of a conjunction is the disjunction of the negations: ¬(p ∧ q) = ¬p ∨ ¬q.
How many rows does a truth table with n propositional variables have?
Correct answer:
B) 2^n
Explanation: Each variable has two possible truth values, so n variables produce 2^n combinations, one per row.
What does the universal quantifier (∀) mean?
Correct answer:
C) For all elements
Explanation: The universal quantifier ∀x means the statement holds for every element x in the domain.
What does the existential quantifier (∃) mean?
Correct answer:
D) There exists at least one element
Explanation: The existential quantifier ∃x means there is at least one element x in the domain for which the statement is true.
What is the negation of the statement 'for all x, P(x)'?
Correct answer:
A) There exists x such that not P(x)
Explanation: Negating a universal statement gives an existential one: ¬∀x P(x) is equivalent to ∃x ¬P(x).
What is the negation of 'there exists x such that P(x)'?
Correct answer:
B) For all x, not P(x)
Explanation: Negating an existential statement gives a universal one: ¬∃x P(x) is equivalent to ∀x ¬P(x).
What is a direct proof?
Correct answer:
C) Assuming the hypothesis and deriving the conclusion through logical steps
Explanation: A direct proof starts from the hypothesis and applies definitions and known results step by step to reach the conclusion.
What is a proof by contradiction?
Correct answer:
D) Assuming the statement is false and deriving a contradiction
Explanation: In proof by contradiction, one assumes the negation of the statement and shows this leads to a logical impossibility, so the original must be true.
What is a proof by contraposition?
Correct answer:
A) Proving ¬q → ¬p to establish p → q
Explanation: Since a conditional equals its contrapositive, proving ¬q → ¬p establishes the original p → q.
What is a counterexample used for?
Correct answer:
B) Disproving a universal statement
Explanation: A single counterexample disproves a universally quantified statement by exhibiting one case where it fails.
What is the principle of mathematical induction used to prove?
Correct answer:
C) Statements about all natural numbers
Explanation: Mathematical induction proves a statement holds for all natural numbers by establishing a base case and an inductive step.
What are the two steps of a proof by induction?
Correct answer:
D) Base case and inductive step
Explanation: Induction requires proving the base case (usually n = 1) and the inductive step (if it holds for n = k, it holds for n = k + 1).
In the inductive step, what is assumed?
Correct answer:
A) The statement holds for n = k (the inductive hypothesis)
Explanation: The inductive step assumes the inductive hypothesis, that the statement holds for some n = k, and then proves it for n = k + 1.
What is the sum 1 + 2 + 3 + ... + n equal to?
Correct answer:
B) n(n + 1)/2
Explanation: The sum of the first n positive integers is n(n + 1)/2, a classic result often proven by induction.
What is 1 + 2 + 3 + ... + 10?
Correct answer:
C) 55
Explanation: Using n(n + 1)/2 with n = 10 gives 10 × 11 / 2 = 55.
Which logical equivalence describes the double negation law?
Correct answer:
D) ¬(¬p) is equivalent to p
Explanation: Double negation states that negating a proposition twice returns the original: ¬(¬p) = p.
What is the truth value of p ∨ ¬p for any proposition p?
Correct answer:
A) Always true
Explanation: The expression p ∨ ¬p, called the law of the excluded middle, is a tautology because either p or its negation must be true.
What is the truth value of p ∧ ¬p?
Correct answer:
B) Always false
Explanation: The expression p ∧ ¬p is a contradiction, always false, since a proposition and its negation cannot both be true.
The conditional p → q is logically equivalent to which disjunction?
Correct answer:
C) ¬p ∨ q
Explanation: The conditional p → q is equivalent to ¬p ∨ q, a frequently used identity in logic.
What is a predicate?
Correct answer:
D) A statement involving variables that becomes a proposition when values are assigned
Explanation: A predicate is a statement containing variables, such as P(x), that has a truth value once the variables are given specific values.
What does the modus ponens rule of inference state?
Correct answer:
A) From p and p → q, conclude q
Explanation: Modus ponens allows concluding q when both p and the conditional p → q are known to be true.
What does modus tollens state?
Correct answer:
B) From ¬q and p → q, conclude ¬p
Explanation: Modus tollens allows concluding ¬p when the conditional p → q holds and q is false.
What is the domain of discourse in predicate logic?
Correct answer:
C) The set of values that variables can take
Explanation: The domain of discourse (universe) is the set of all values over which the quantified variables range.
What is a vacuously true statement?
Correct answer:
D) A conditional whose hypothesis is always false
Explanation: A conditional with a false hypothesis is vacuously true, since p → q is automatically true when p is false.
Which connective is represented by the symbol ⊕?
Correct answer:
A) Exclusive or (XOR)
Explanation: The symbol ⊕ denotes exclusive or, which is true when exactly one of the two operands is true.
When is p ⊕ q (exclusive or) true?
Correct answer:
B) When exactly one of p, q is true
Explanation: Exclusive or is true precisely when the two operands have different truth values.
What is the inverse of the conditional p → q?
Correct answer:
C) ¬p → ¬q
Explanation: The inverse of p → q is ¬p → ¬q, negating both the hypothesis and conclusion without swapping them.
The converse and inverse of a conditional are:
Correct answer:
D) Logically equivalent to each other
Explanation: The converse (q → p) and inverse (¬p → ¬q) are contrapositives of each other, so they are logically equivalent.
What does it mean for two propositions to be logically equivalent?
Correct answer:
A) They have identical truth values in every case
Explanation: Two propositions are logically equivalent when they have the same truth value for every possible assignment of their variables.
What is the distributive law for ∧ over ∨?
Correct answer:
B) p ∧ (q ∨ r) equals (p ∧ q) ∨ (p ∧ r)
Explanation: The distributive law states p ∧ (q ∨ r) = (p ∧ q) ∨ (p ∧ r), mirroring distribution in algebra.
What is the identity law for conjunction?
Correct answer:
C) p ∧ true equals p
Explanation: The identity law states that conjoining a proposition with true leaves it unchanged: p ∧ T = p.
What is the domination (annihilator) law for disjunction?
Correct answer:
D) p ∨ true equals true
Explanation: The domination law states p ∨ T = T, since a disjunction with true is always true regardless of p.
A nested quantifier ∀x ∃y P(x, y) means:
Correct answer:
A) For every x there exists a y making P(x, y) true
Explanation: ∀x ∃y P(x, y) means for each x, some y (possibly depending on x) makes the predicate true.
Does ∀x ∃y P(x, y) generally have the same meaning as ∃y ∀x P(x, y)?
Correct answer:
B) No, the order of quantifiers matters
Explanation: The order of mixed quantifiers matters: ∃y ∀x requires a single y working for all x, a stronger claim than ∀x ∃y.
What is an argument in logic?
Correct answer:
C) A sequence of premises followed by a conclusion
Explanation: An argument consists of premises and a conclusion. It is valid if the conclusion follows necessarily from the premises.
When is an argument valid?
Correct answer:
D) When the conclusion is true whenever all premises are true
Explanation: An argument is valid when it is impossible for all premises to be true while the conclusion is false, regardless of actual truth.
What is the difference between validity and soundness of an argument?
Correct answer:
A) Sound means valid and all premises are actually true
Explanation: A valid argument has correct logical form; a sound argument is valid and additionally has all true premises, guaranteeing a true conclusion.
What is the primary purpose of formal logic in mathematics?
Correct answer:
B) To rigorously establish the truth of statements through valid reasoning
Explanation: Formal logic provides the rigorous framework of definitions, inference rules, and proofs used to establish mathematical truth with certainty.
A relation R on a set A is reflexive when:
Correct answer:
A) (a, a) is in R for every element a in A
Explanation: Reflexive relations relate every element to itself. A relation that is reflexive, symmetric and transitive is an equivalence relation.
If this exam is giving you a hard time, let us be your helping hand. Contact us, and we'll provide the assistance you need to pass and move forward.