Computer Sciences > Gate 2017 Set-1 > Pridicate Calculus
Consider the first-order logic sentence
F: ∀ x (∃ y R(x,y)).
Assuming non-empty logical domains, which of the sentences below are implied by F?
I. ∃y (∃x R(x,y))
II. ∃y (∀x R(x,y))
III. ∀y (∃x R(x,y))
IV. ∼∃x (∀y R(x,y))
II. ∃y (∀x R(x,y))
III. ∀y (∃x R(x,y))
IV. ∼∃x (∀y R(x,y))
Explanation
Correct : Pridicate Calculus
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.