Quiz-2

What are the main logical operators used in predicate logic?

• Existential, Universal, Conditional

• Addition, Subtraction, Multiplication

• Truth, Falsity, Certainty

• Conjunction, Disjunction, Negation, Implication, Biconditional

Define the universal quantifier and provide an example.

• ∀x (x < 0) means for all x, x is less than 0.

• ∃x (x > 0) means there exists an x such that x is greater than 0.

• ∀x (x = 0) means for all x, x is equal to 0.

• ∀x (x > 0) means for all x, x is greater than 0.

What is the difference between existential and universal quantifiers?

• Existential quantifiers (∀) indicate existence, while universal quantifiers (∃) indicate universality.

• Existential quantifiers (∃) indicate existence, while universal quantifiers (∀) indicate universality.

• Both existential and universal quantifiers are used to express the same concept in logic.

• Existential quantifiers (∃) are used only in mathematical proofs, while universal quantifiers (∀) are used in programming.

Construct a truth table for the expression (P ∧ Q) → R.

• | P | Q | R | P ∧ Q | (P ∧ Q) → R | |---|---|---|-------|--------------| | T | T | T | T | F | | T | F | T | T | F | | F | T | F | F | F | | F | F | T | F | F |

• | P | Q | R | P ∧ Q | (P ∧ Q) → R | |---|---|---|-------|--------------| | T | T | T | T | T | | T | T | F | T | F | | T | F | T | F | T | | T | F | F | F | T | | F | T | T | F | T | | F | T | F | F | T | | F | F | T | F | T | | F | F | F | F | T |

• | P | Q | R | P ∧ Q | (P ∧ Q) → R | |---|---|---|-------|--------------| | T | T | F | T | T | | T | F | F | F | F | | F | T | T | F | F | | F | F | F | F | F |

• | P | Q | R | P ∧ Q | (P ∧ Q) → R | |---|---|---|-------|--------------| | T | T | T | T | T | | T | F | T | F | F | | F | T | F | F | F | | F | F | T | F | F |

Explain the difference between predicate logic and propositional logic.

• Predicate logic includes quantifiers and predicates, while propositional logic only deals with whole propositions.

• Predicate logic is a subset of propositional logic that deals with specific cases.

• Propositional logic includes quantifiers and predicates like 'for all' and 'there exists'.

• Predicate logic only uses simple statements without any structure.

What is a logical equivalence? Provide an example.

• 'P ∧ Q' is equivalent to 'P ∨ Q'.

• '¬P' is equivalent to 'P' when P is true.

• An example of logical equivalence is: 'P → Q' is equivalent to '¬Q → ¬P'.

• 'P ↔ Q' is equivalent to 'P → Q'.

How can predicate logic be applied in computer science?

• Predicate logic is used for hardware design only.

• Predicate logic is primarily for graphic design applications.

• Predicate logic is irrelevant to programming languages.

• Predicate logic is used for formal verification, reasoning about program correctness, optimizing database queries, and knowledge representation in AI.

What does the symbol ∀ represent in predicate logic?

• A logical operator representing 'and'.

• A symbol for negation in logic.

• The universal quantifier, meaning 'for all'.

• The existential quantifier, meaning 'there exists'.

Create a truth table for the expression ¬(P ∨ Q).

• | F | F | T | F |

• | T | F | F | T |

• | T | T | F | T |

• | P | Q | P ∨ Q | ¬(P ∨ Q) | |---|---|-------|----------| | T | T | T | F | | T | F | T | F | | F | T | T | F | | F | F | F | T |

What is the significance of quantifiers in logical statements?

• Quantifiers are irrelevant to the truth of logical statements.

• Quantifiers eliminate the need for variables in logic.

• Quantifiers are only used in mathematical equations.

• Quantifiers specify the scope of variables in logical statements, enabling precise expressions of generality and existence.