A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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
a. satisfiable and valid
b. satisfiable and so is its negation
c. unsatisfiable but its negation is valid
d. satisfiable but its negation is unsatisfiable
Answer:satisfiable and so is its negation
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: