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
Which of the following is an example of a pragmatic truth?
-
The sky is blue.
-
The sun is a star.
-
The Earth is flat.
-
All of the above
A
Correct answer
Explanation
The statement "The sky is blue" is a pragmatic truth. It is true in most cases, but it is not true in all cases. For example, the sky can be gray or black on a cloudy day.
Which of the following is an example of a semantic truth?
-
The sky is blue.
-
The sun is a star.
-
The Earth is flat.
-
All of the above
Correct answer
Explanation
None of the statements listed are semantic truths. The sky is not always blue, the sun is not always a star, and the Earth is not flat.
Which of the following is an example of a pragmatic truth?
-
The sky is blue.
-
The sun is a star.
-
The Earth is flat.
-
All of the above
A
Correct answer
Explanation
The statement "The sky is blue" is a pragmatic truth. It is true in most cases, but it is not true in all cases. For example, the sky can be gray or black on a cloudy day.
What is the No True Scotsman fallacy?
-
A logical fallacy that occurs when someone changes the definition of a term in order to exclude an unwanted example.
-
A logical fallacy that occurs when someone assumes that something is true because it is widely believed.
-
A logical fallacy that occurs when someone appeals to emotion in order to support their argument.
-
A logical fallacy that occurs when someone uses a circular argument.
A
Correct answer
Explanation
The No True Scotsman fallacy is a logical fallacy that occurs when someone changes the definition of a term in order to exclude an unwanted example. This fallacy is often used in response to the Gettier Problem, where someone might argue that a Gettier case is not a genuine case of knowledge because it does not meet the new definition of knowledge.
Is it possible to have a justified belief that is not true?
A
Correct answer
Explanation
It is possible to have a justified belief that is not true. For example, you might believe that your friend is going to pass their exam because they studied hard. This belief is justified because you have evidence to support it (your friend's hard work), but it is not true if your friend does not pass their exam.
Which of the following is a consequence of the Choice Axiom?
-
The Well-Ordering Principle
-
Zorn's Lemma
-
The Axiom of Infinity
-
The Continuum Hypothesis
A
Correct answer
Explanation
The Well-Ordering Principle states that every set can be well-ordered, which means it can be arranged in a sequence such that each element is either the first element or follows a unique predecessor. This principle is a consequence of the Choice Axiom.
The Choice Axiom is independent of which other axiom of set theory?
-
The Axiom of Infinity
-
The Axiom of Power Set
-
The Axiom of Extensionality
-
The Axiom of Regularity
A
Correct answer
Explanation
The Choice Axiom is independent of the Axiom of Infinity. This means that it is possible to construct models of set theory in which the Choice Axiom holds but the Axiom of Infinity does not, and vice versa.
Which of the following is a controversial implication of the Choice Axiom?
-
The Banach-Tarski Paradox
-
The Russell's Paradox
-
The Schroeder-Bernstein Theorem
-
The Cantor-Bernstein Theorem
A
Correct answer
Explanation
The Banach-Tarski Paradox is a controversial implication of the Choice Axiom. It states that it is possible to decompose a solid ball into a finite number of pieces and then reassemble them into two balls of the same size as the original ball.
Which of the following is an example of a mathematical statement that requires the Choice Axiom for its proof?
-
The existence of a well-ordering of the real numbers.
-
The existence of a maximal element in every non-empty partially ordered set.
-
The existence of a choice function for every non-empty collection of non-empty sets.
-
All of the above
D
Correct answer
Explanation
All of the above statements require the Choice Axiom for their proof.
What is the status of the Choice Axiom in modern mathematics?
-
It is generally accepted as a valid axiom of set theory.
-
It is rejected by some mathematicians due to its counterintuitive consequences.
-
Its status is still being debated among mathematicians.
-
None of the above
A
Correct answer
Explanation
Despite its controversial nature, the Choice Axiom is generally accepted as a valid axiom of set theory and is widely used in mathematical research.
What is the 'Frankfurt-style' counterexample to the principle of alternate possibilities?
-
The case of the man who is forced to choose between saving his wife or his child.
-
The case of the man who is hypnotized to believe that he is a chicken.
-
The case of the man who is given a drug that makes him unable to control his actions.
-
All of the above.
D
Correct answer
Explanation
Frankfurt-style counterexamples challenge the principle of alternate possibilities, which is often used to argue for the necessity of free will.
Which of the following is a valid formula in second-order predicate logic?
-
$\exists x \forall y P(x, y)$
-
$\forall x \exists y P(x, y)$
-
$\exists P \forall x P(x)$
-
$\forall P \exists x P(x)$
C
Correct answer
Explanation
In second-order predicate logic, it is possible to quantify over predicates. The formula $\exists P \forall x P(x)$ means that there exists a property $P$ such that for all individuals $x$, $P(x)$ is true.
What is the Completeness theorem?
-
A theorem that states that every valid formula in first-order predicate logic is provable.
-
A theorem that states that every valid formula in second-order predicate logic is provable.
-
A theorem that states that every satisfiable formula in first-order predicate logic is provable.
-
A theorem that states that every satisfiable formula in second-order predicate logic is provable.
A
Correct answer
Explanation
The Completeness theorem is a fundamental result in mathematical logic that states that every valid formula in first-order predicate logic is provable. This means that if a formula is true in every model of first-order predicate logic, then it can be proven using the rules of first-order predicate logic.
What is the Gödel's incompleteness theorem?
-
A theorem that states that every consistent first-order theory is either incomplete or unsound.
-
A theorem that states that every consistent second-order theory is either incomplete or unsound.
-
A theorem that states that every consistent first-order theory is either complete or unsound.
-
A theorem that states that every consistent second-order theory is either complete or unsound.
A
Correct answer
Explanation
Gödel's incompleteness theorem is a fundamental result in mathematical logic that states that every consistent first-order theory is either incomplete or unsound. This means that there are true statements about the natural numbers that cannot be proven using the rules of first-order logic.
What is the difference between a satisfiability and a validity in second-order predicate logic?
-
A formula is satisfiable if there exists a model in which the formula is true, and a formula is valid if it is true in all models.
-
A formula is satisfiable if there exists a model in which the formula is false, and a formula is valid if it is false in all models.
-
A formula is satisfiable if there exists a model in which the formula is true, and a formula is valid if it is false in all models.
-
A formula is satisfiable if there exists a model in which the formula is false, and a formula is valid if it is true in all models.
A
Correct answer
Explanation
In second-order predicate logic, a formula is satisfiable if there exists a model in which the formula is true, and a formula is valid if it is true in all models.