Computer Sciences > Gate 2014 Set-1 > Pridicate Calculus
Consider the statement

“Not all that glitters is gold”

Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is gold. Which one of the following logical formulae represents the above statement?
A
∃x: gold(x) => ¬ glitters(x)
B
∃x: glitters(x) => ¬ gold(x)
C
∀x: gold(x) => glitters(x)
D
∀x: glitters(x) =>¬ gold(x)

Explanation

Correct : Pridicate Calculus

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