GATE CS 2015: Which Predicate Logic Formula is a Tautology? Q57

```

Computer Sciences > GATE 2015 SET-2 > Logic

Which one of the following well-formed formulae is a tautology?

A

∀x∃y R(x, y) ↔ ∃y∀x R(x, y)

B

(∀x[∃y R(x, y) → S(x, y)]) → ∀x∃y S(x, y)

C

[∀x∃y(P(x, y) → R(x, y))] ↔ [∀x∃y(¬P(x, y) ∨ R(x, y))]

D

∀x∀y P(x, y) → ∀x∀y P(y, x)

Correct : c

Similar Questions

A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...

#1 MCQ

Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64

#4 MCQ

Choose the word that is opposite in meaning to the word “coherent”.

#5 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......