Computer-Networks
August 4, 2024Propositional-Logic
August 4, 2024Propositional-Logic
|
Question 19
|
Consider the following first order logic formula in which R is a binary relation symbol.
∀x∀y (R(x, y) => R(y, x))
The formula is
|
satisfiable and valid
|
|
|
satisfiable and so is its negation
|
|
|
unsatisfiable but its negation is valid
|
|
|
satisfiable but its negation is unsatisfiable
|
Question 19 Explanation:
The given relation is known to be symmetry. We have both symmetric relations possible as well as antisymmetric but neither always holds for all sets. So they both are valid but are satisfiable.
Correct Answer: B
Question 19 Explanation:
The given relation is known to be symmetry. We have both symmetric relations possible as well as antisymmetric but neither always holds for all sets. So they both are valid but are satisfiable.