Reasoning

Logic and Fallacies

1,716 Questions

Understand the fundamentals of propositional logic, logical inference rules, and paradoxes. This set includes identifying logical fallacies, including those found in classical Nyaya logic. Strong grasp of these concepts is crucial for scoring well in the reasoning sections of competitive tests.

Propositional logic modelsLogical inference rulesTypes of logical fallaciesParadoxes and contingent truthsNyaya logic concepts

Logic and Fallacies Questions

Multiple choice

What is the basic unit of meaning in Searle's theory?

  1. The word

  2. The sentence

  3. The proposition

  4. The speech act
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Searle argues that the basic unit of meaning is the proposition, which is a unit of information that can be true or false.

Multiple choice

Which of the following is a valid syntax for a first-order predicate logic statement?

  1. ∀x(Px → Qx)

  2. ∃x(Px ∧ Qx)

  3. (Px ∨ Qx) → ∀x(Px ∨ Qx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The correct syntax for a first-order predicate logic statement is ∀x(Px → Qx), which represents "For all x, if x has property P, then x has property Q".

Multiple choice

What is the meaning of the predicate symbol 'P(x)' in first-order predicate logic?

  1. It represents a property that can be true or false for an object x.

  2. It represents a set of objects that satisfy a certain condition.

  3. It represents a function that maps an object x to a truth value.

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

In first-order predicate logic, a predicate symbol P(x) represents a property that can be true or false for an object x.

Multiple choice

Which of the following is a valid inference rule in first-order predicate logic?

  1. Modus ponens

  2. Modus tollens

  3. Hypothetical syllogism

  4. All of the above
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Modus ponens, modus tollens, and hypothetical syllogism are all valid inference rules in first-order predicate logic.

Multiple choice

What is the negation of the statement "∀x(Px → Qx)" in first-order predicate logic?

  1. ∃x(Px ∧ ¬Qx)

  2. ∃x(¬Px ∨ Qx)

  3. ∀x(¬Px ∨ Qx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The negation of the statement "∀x(Px → Qx)" is "∃x(Px ∧ ¬Qx)", which represents "There exists an object x such that x has property P and x does not have property Q".

Multiple choice

Which of the following is a valid first-order predicate logic statement?

  1. ∀x(Px → Qx) ∧ ∃x(¬Px)

  2. ∀x(Px → Qx) → ∃x(¬Qx)

  3. ∃x(Px ∧ Qx) → ∀x(Px ∨ Qx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The statement "∀x(Px → Qx) ∧ ∃x(¬Px)" is a valid first-order predicate logic statement because it represents "For all x, if x has property P, then x has property Q, and there exists an object x that does not have property P".

Multiple choice

What is the domain of discourse in first-order predicate logic?

  1. The set of all objects under consideration.

  2. The set of all properties under consideration.

  3. The set of all statements under consideration.

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The domain of discourse in first-order predicate logic is the set of all objects under consideration.

Multiple choice

Which of the following is a valid first-order predicate logic statement?

  1. ∀x(Px ∨ Qx) → (∀xPx ∨ ∀xQx)

  2. ∃x(Px ∧ Qx) → (∃xPx ∧ ∃xQx)

  3. ∀x(Px → Qx) → (∃xPx → ∃xQx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The statement "∀x(Px ∨ Qx) → (∀xPx ∨ ∀xQx)" is a valid first-order predicate logic statement because it represents "For all x, if x has property P or x has property Q, then either all x have property P or all x have property Q".

Multiple choice

Which of the following is a valid first-order predicate logic statement?

  1. ∀x(Px → Qx) → (∃xPx → ∃xQx)

  2. ∃x(Px ∧ Qx) → (∃xPx ∨ ∃xQx)

  3. ∀x(Px ∨ Qx) → (∃xPx ∧ ∃xQx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The statement "∀x(Px → Qx) → (∃xPx → ∃xQx)" is a valid first-order predicate logic statement because it represents "For all x, if x has property P, then x has property Q. Therefore, if there exists an object x that has property P, then there exists an object x that has property Q".

Multiple choice

Which of the following is a valid first-order predicate logic statement?

  1. ∀x(Px → Qx) → (∀xPx → ∀xQx)

  2. ∃x(Px ∧ Qx) → (∃xPx ∧ ∃xQx)

  3. ∀x(Px ∨ Qx) → (∀xPx ∨ ∃xQx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The statement "∀x(Px → Qx) → (∀xPx → ∀xQx)" is a valid first-order predicate logic statement because it represents "For all x, if x has property P, then x has property Q. Therefore, if all x have property P, then all x have property Q".

Multiple choice

Which of the following is a valid first-order predicate logic statement?

  1. ∀x(Px ∨ Qx) → (∀xPx ∨ ∃xQx)

  2. ∃x(Px ∧ Qx) → (∃xPx ∨ ∀xQx)

  3. ∀x(Px → Qx) → (∃xPx ∨ ∀xQx)

  4. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

The statement "∀x(Px ∨ Qx) → (∀xPx ∨ ∃xQx)" is a valid first-order predicate logic statement because it represents "For all x, if x has property P or x has property Q, then either all x have property P or there exists an object x that has property Q".

Multiple choice

Which of the following statements is true about a valid argument?

  1. It is always true.

  2. It is sometimes true.

  3. It is never true.

  4. It depends on the interpretation of the premises.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A valid argument is one in which the conclusion follows logically from the premises. This means that if the premises are true, then the conclusion must also be true.

Multiple choice

Which of the following formulas is satisfiable?

  1. ¬(P ∨ Q)

  2. ¬(P ∧ Q)

  3. (P ∨ ¬P)

  4. (P ∧ ¬P)
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A formula is satisfiable if there is an interpretation that makes it true. The formula (P ∨ ¬P) is satisfiable because it is true in any interpretation where either P or ¬P is true.

Multiple choice

What is a model of a formula?

  1. An interpretation that makes the formula true.

  2. An interpretation that makes the formula false.

  3. An interpretation that makes the formula neither true nor false.

  4. None of the above.
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A model of a formula is an interpretation that makes the formula true. In other words, it is an assignment of values to the variables in the formula such that the formula evaluates to true.

Multiple choice

Which of the following is a logical consequence of the formula (P ∨ Q)?

  1. P

  2. Q

  3. ¬P

  4. ¬Q
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A logical consequence of a formula is a formula that is true in every model of the original formula. The formula (P ∨ Q) is true in any model where either P or Q is true. Therefore, P is a logical consequence of (P ∨ Q).