Computer Sciences > GATE 2025 SET-1 > Predicate Logic
Which of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: "Everyone has exactly one mother"?
The meanings of the predicates used are:
mother(y, x): y is the mother of x
noteq(x, y): x and y are not equal
A
∀x∃y∃z(mother(y,x)&land;¬mother(z,x))
B
∀x∃y[mother(y,x)&land;∀z(noteq(z,y)→¬mother(z,x))]
C
∀x∀y[mother(y,x)→∃z(mother(z,x)&land;¬noteq(z,y))]
D
∀x∃y[mother(y,x)&land;¬∃z(noteq(z,y)&land;mother(z,x))]

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science