“Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference.” - Online Test

30:00

1. What is the fundamental unit of meaning in propositional logic?

A) Term B) Predicate C) Proposition D) Clause

2. Which logical connective is represented by the symbol '∧'?

A) Disjunction B) Conjunction C) Implication D) Negation

3. The statement 'If it is raining, then the ground is wet' can be represented symbolically as P → Q, where P is 'It is raining' and Q is 'The ground is wet'. This is an example of:

A) Conjunction B) Disjunction C) Implication D) Biconditional

4. What does the symbol '∨' represent in logic?

A) AND B) OR C) NOT D) IF AND ONLY IF

5. A compound proposition that is always false, regardless of the truth values of its components, is called a:

A) Tautology B) Contradiction C) Contingency D) Equivalence

6. Which of the following is a tautology?

A) p ∧ ¬p B) p → p C) p ∨ ¬p D) p ⊕ p

7. The statement 'The sky is blue if and only if grass is green' is a:

A) Implication B) Conjunction C) Disjunction D) Biconditional

8. What is the truth value of the proposition '2 + 2 = 4'?

A) True B) False C) Undefined D) Contingent

9. If proposition P is true and proposition Q is false, what is the truth value of P ∧ Q?

A) True B) False C) Cannot be determined D) True if P or Q is true

10. What is the truth value of P ∨ Q if P is false and Q is false?

A) True B) False C) Undefined D) True only if P is true

11. The negation of 'All birds can fly' is:

A) No birds can fly B) Some birds cannot fly C) All birds cannot fly D) Some birds can fly

12. Which logical equivalence states that ¬(p ∧ q) is equivalent to ¬p ∨ ¬q?

A) Commutative Law B) Associative Law C) De Morgan's Law D) Distributive Law

13. The statement 'p → q' is logically equivalent to:

A) ¬p ∨ q B) p ∨ ¬q C) ¬p ∧ q D) p ∧ ¬q

14. What is the Conjunctive Normal Form (CNF) of the proposition (p ∨ q) ∧ r?

A) ((p ∨ q) ∧ r) B) (p ∧ r) ∨ (q ∧ r) C) (p ∨ r) ∧ (q ∨ r) D) ¬(¬p ∧ ¬q) ∧ r

15. A proposition that is either a tautology or a contradiction is called:

A) Contingent B) Equivalence C) Boolean D) Boolean Expression

16. Which normal form consists of a conjunction of clauses, where each clause is a disjunction of literals?

A) Disjunctive Normal Form (DNF) B) Conjunctive Normal Form (CNF) C) Principal Conjunctive Normal Form D) Principal Disjunctive Normal Form

17. In predicate logic, a statement about a single subject and predicate is called a:

A) Proposition B) Quantifier C) Predicate D) Formula

18. What does the symbol '∀' represent in predicate logic?

A) Existential Quantifier B) Universal Quantifier C) Negation D) Implication

19. The statement 'All humans are mortal' can be expressed in predicate logic as:

A) ∃x (Human(x) ∧ Mortal(x)) B) ∀x (Human(x) → Mortal(x)) C) ∀x (Human(x) ∨ Mortal(x)) D) ∃x (Human(x) → Mortal(x))

20. What does the symbol '∃' represent in predicate logic?

A) Universal Quantifier B) Existential Quantifier C) Conjunction D) Disjunction

21. The statement 'Some students are intelligent' can be expressed in predicate logic as:

A) ∀x (Student(x) → Intelligent(x)) B) ∃x (Student(x) ∧ Intelligent(x)) C) ∀x (Student(x) ∨ Intelligent(x)) D) ∃x (Student(x) ∨ Intelligent(x))

22. In the statement '∀x P(x)', the variable 'x' is:

A) Free B) Bound C) Undefined D) Quantified

23. In the statement '∃x P(x)', the variable 'x' is:

A) Free B) Bound C) Quantified D) Constant

24. What is the meaning of '∀x ∃y P(x, y)'?

A) For every x, there exists a y such that P(x, y) is true. B) There exists an x such that for every y, P(x, y) is true. C) For all x and all y, P(x, y) is true. D) There exists an x and there exists a y such that P(x, y) is true.

25. What is the meaning of '∃y ∀x P(x, y)'?

A) There exists a y such that for all x, P(x, y) is true. B) For all x, there exists a y such that P(x, y) is true. C) There exists an x such that for all y, P(x, y) is true. D) For all y, there exists an x such that P(x, y) is true.

26. Which of the following is NOT a valid rule of inference for propositional logic?

A) Modus Ponens B) Modus Tollens C) Hypothetical Syllogism D) Affirming the Consequent

27. Modus Ponens is a rule of inference that states if we have P and P → Q, we can conclude:

A) ¬Q B) Q C) ¬P D) P ∧ Q

28. Modus Tollens is a rule of inference that states if we have ¬Q and P → Q, we can conclude:

A) Q B) P C) ¬P D) ¬Q

29. The rule of inference known as Hypothetical Syllogism states that if P → Q and Q → R, then we can conclude:

A) P → R B) ¬P → R C) P → ¬R D) ¬P → ¬R

30. Which rule of inference allows us to conclude P ∨ Q from P?

A) Addition B) Simplification C) Disjunctive Syllogism D) Resolution

31. Disjunctive Syllogism allows us to conclude Q from P ∨ Q and:

A) P B) ¬P C) Q D) ¬Q

32. The rule of inference that states if P ∧ Q is true, then P is true, is called:

A) Conjunction B) Simplification C) Addition D) Modus Ponens

33. If we have P and Q, what rule of inference allows us to conclude P ∧ Q?

A) Conjunction B) Simplification C) Addition D) Modus Ponens

34. In predicate logic, the rule of Universal Instantiation states that if ∀x P(x) is true, then for any specific element 'a' in the domain, we can conclude:

A) P(a) B) ∃x P(x) C) ¬P(a) D) ∀x ¬P(x)

35. The rule of Existential Generalization states that if P(a) is true for some element 'a', then we can conclude:

A) ∀x P(x) B) ∃x P(x) C) ¬∃x P(x) D) ¬∀x P(x)

36. What is the negation of ∀x P(x)?

A) ∃x ¬P(x) B) ∀x ¬P(x) C) ¬∀x P(x) D) ¬∃x P(x)

37. What is the negation of ∃x P(x)?

A) ∀x ¬P(x) B) ∃x ¬P(x) C) ¬∃x P(x) D) ¬∀x P(x)

38. Consider the statement: 'If it is sunny (S), then I will go to the beach (B)'. Symbolically: S → B. If it is not sunny (¬S), what can we conclude?

A) I will go to the beach (B) B) I will not go to the beach (¬B) C) Nothing can be concluded about going to the beach D) I will definitely go to the beach

39. Which logical equivalence is used to convert an implication into a disjunction?

A) Commutative Law B) Implication Law (p → q ≡ ¬p ∨ q) C) Associative Law D) De Morgan's Law

40. What is the main purpose of Normal Forms (CNF and DNF)?

A) To simplify complex logical expressions. B) To standardize the representation of logical formulas, especially for automated reasoning. C) To increase the number of variables in a formula. D) To introduce more quantifiers into a formula.

41. A proposition that is true for all possible truth assignments of its propositional variables is called:

A) Contradiction B) Contingency C) Tautology D) Satisfiable

42. The statement 'There is a number that is even and prime' can be represented as:

A) ∀x (Even(x) ∧ Prime(x)) B) ∃x (Even(x) ∨ Prime(x)) C) ∃x (Even(x) ∧ Prime(x)) D) ∀x (Even(x) → Prime(x))

43. Which of the following is an example of affirming the consequent, a logical fallacy?

A) P → Q, P ⊢ Q B) P → Q, ¬Q ⊢ ¬P C) P → Q, Q ⊢ P D) P → Q, P ⊢ ¬Q

44. The logical equivalence (p ∧ q) ∨ r ≡ (p ∨ r) ∧ (q ∨ r) is known as the:

A) Commutative Law B) Associative Law C) Distributive Law D) Absorption Law

45. What is the domain of discourse for the statement '∀x (x is a dog → x has fur)'?

A) All animals B) All mammals C) All dogs D) The set of all entities being considered (e.g., all living beings)

46. The statement 'x > 5' is an example of a:

A) Proposition B) Predicate C) Quantifier D) Logical connective

47. Which rule of inference is used to prove statements of the form P → Q by assuming P and deriving Q?

A) Modus Tollens B) Hypothetical Syllogism C) Conditional Proof (or Assumption) D) Modus Ponens

48. The statement 'All men are mortal. Socrates is a man. Therefore, Socrates is mortal.' is an example of deductive reasoning using:

A) Fallacy of the Undistributed Middle B) Modus Ponens C) Universal Instantiation and Modus Ponens D) Disjunctive Syllogism

49. What is the Disjunctive Normal Form (DNF) of ¬(p ∧ q)?

A) ¬p ∧ ¬q B) ¬p ∨ ¬q C) (¬p ∧ q) ∨ (p ∧ ¬q) ∨ (¬p ∧ ¬q) D) (¬p ∨ q) ∧ (p ∨ ¬q)

50. Which of the following is a valid argument form?

A) p → q, q ⊢ p B) p → q, ¬p ⊢ ¬q C) p → q, q ⊢ ¬p D) p → q, ¬q ⊢ p

Test Results

0/0

All Online Tests

E-Book “Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference.” One Line Questions “Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference.” Question Bank “Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference.”