(a) Uses Modus ponens (A, A ⇒ |= B) or resolution to show that the following…
PYQ GATE 1992Modified — slightly modified from the official paper; see the solution
(a) Uses Modus ponens (A, A ⇒ |= B) or resolution to show that the following set is inconsistent:
(1) Q(x) → P(x) ∨ ¬R(a)
(2) R(a) ↔ Q(a)
(3) Q(a)
(4) ¬P(y)
Where x and y are universally quantified variables, a is a constant and P, Q, R are monadic predicates.
(b) Let S be the set of all integers and let n > 1 be a fixed integer. Define for a, b ∈ S, a R b iff a-b is a multiple of n. Show that R is an equivalence relation and finds its equivalence classes for n = 5.
Sign up free to check your answer
Sign up freeLoading lesson…

