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 a theorem of higher-order predicate logic?
-
The law of identity
-
The law of non-contradiction
-
The law of the excluded middle
-
All of the above
D
Correct answer
Explanation
The law of identity, the law of non-contradiction, and the law of the excluded middle are all theorems of higher-order predicate logic. These laws are fundamental principles of logic, and they are used to derive other logical truths.
Which of the following is a valid inference rule in higher-order predicate logic?
-
Modus ponens
-
Modus tollens
-
Hypothetical syllogism
-
Disjunctive syllogism
A
Correct answer
Explanation
Modus ponens is a valid inference rule in higher-order predicate logic. It states that if you have a formula of the form P → Q, and you also have a formula of the form P, then you can infer a formula of the form Q. This rule is used to derive new formulas from given formulas.
Which of the following is a decidable theory in higher-order predicate logic?
-
Peano arithmetic
-
Zermelo-Fraenkel set theory
-
First-order predicate logic
-
Second-order predicate logic
C
Correct answer
Explanation
First-order predicate logic is a decidable theory in higher-order predicate logic. This means that there is an algorithm that can determine whether or not a given formula in first-order predicate logic is true or false. Peano arithmetic, Zermelo-Fraenkel set theory, and second-order predicate logic are all undecidable theories.
Which of the following is a limitation of higher-order predicate logic?
-
It is undecidable.
-
It is incomplete.
-
It is inconsistent.
-
It is too complex to be used in practice.
A
Correct answer
Explanation
Higher-order predicate logic is undecidable. This means that there is no algorithm that can determine whether or not a given formula in higher-order predicate logic is true or false. This is a limitation of higher-order predicate logic, as it means that there are some questions that cannot be answered using higher-order predicate logic.
Which of the following is an application of higher-order predicate logic?
-
Formalizing mathematical theories
-
Reasoning about computer programs
-
Verifying hardware designs
-
All of the above
D
Correct answer
Explanation
Higher-order predicate logic is used in a variety of applications, including formalizing mathematical theories, reasoning about computer programs, and verifying hardware designs. This is because higher-order predicate logic is a powerful tool for representing and reasoning about complex concepts.
Which of the following is an example of a modal logic operator?
C
Correct answer
Explanation
□ is an example of a modal logic operator. It is the necessity operator, which is used to express that a proposition is true in all possible worlds.
In the context of number theory, what is the significance of the concept of 'proof'?
-
Establishing the validity of mathematical statements
-
Providing a logical foundation for number theory
-
Demonstrating the practical applications of number theory
-
Verifying the accuracy of numerical calculations
A
Correct answer
Explanation
Proofs in number theory serve to establish the validity of mathematical statements, ensuring their logical consistency and correctness within the framework of accepted axioms and definitions.
In predicate logic, what is the term used to represent a property or characteristic of an object?
-
Predicate
-
Subject
-
Quantifier
-
Constant
A
Correct answer
Explanation
In predicate logic, a predicate is a term that expresses a property or characteristic of an object.
What is the symbol used to represent the universal quantifier in predicate logic?
A
Correct answer
Explanation
The symbol ∀ is used to represent the universal quantifier in predicate logic.
What is the symbol used to represent the existential quantifier in predicate logic?
B
Correct answer
Explanation
The symbol ∃ is used to represent the existential quantifier in predicate logic.
Which of the following statements is a valid deduction from the premises "All squares have four sides" and "This shape has four sides"?
-
This shape is a square.
-
This shape is not a square.
-
This shape has four corners.
-
This shape is a rectangle.
A
Correct answer
Explanation
The correct answer is "This shape is a square." This is a valid deduction because the premises establish that all squares have four sides and this shape has four sides. Therefore, it can be logically concluded that this shape is a square.
Which of the following statements is a valid deduction from the premises "If I study hard, then I will pass the exam" and "I studied hard"?
-
I will pass the exam.
-
I will not pass the exam.
-
I did not study hard.
-
I am not sure if I will pass the exam.
A
Correct answer
Explanation
The correct answer is "I will pass the exam." This is a valid deduction because the premises establish that if I study hard, then I will pass the exam, and I studied hard. Therefore, it can be logically concluded that I will pass the exam.
Which of the following statements is a valid deduction from the premises "All triangles have three sides" and "This shape has three sides"?
-
This shape is a triangle.
-
This shape is not a triangle.
-
All shapes with three sides are triangles.
-
All triangles are shapes with three sides.
A
Correct answer
Explanation
The correct answer is "This shape is a triangle." This is a valid deduction because the premises establish that all triangles have three sides and this shape has three sides. Therefore, it can be logically concluded that this shape is a triangle.
Which of the following is an example of a formal operational child's hypothetical-deductive reasoning?
-
Using trial and error to solve a problem
-
Formulating hypotheses and testing them systematically
-
Reversing the order of operations to solve a problem
-
Using concrete objects to represent abstract concepts
B
Correct answer
Explanation
Hypothetical-deductive reasoning is a characteristic of the Formal Operational stage. Formal operational children can formulate hypotheses and test them systematically to solve problems and draw conclusions.
Which of the following is an example of a formal operational child's hypothetical-deductive reasoning?
-
Using trial and error to solve a problem
-
Formulating hypotheses and testing them systematically
-
Reversing the order of operations to solve a problem
-
Using concrete objects to represent abstract concepts
B
Correct answer
Explanation
Hypothetical-deductive reasoning is a characteristic of the Formal Operational stage. Formal operational children can formulate hypotheses and test them systematically to solve problems and draw conclusions.