Computer Sciences > Gate 2016 Set-2 > Pridicate Calculus
Which one of the following well-formed formulae in predicate calculus is NOT valid?
A
(∀x p(x) ⇒ ∀x q(x)) ⇒ (∃x¬p(x) ∨ ∀x q(x))
B
(∃x p(x) ∨ ∃x q(x)) ⇒ ∃x (p(x) ∨ q(x))
C
∃x (p(x) ∧ q(x)) ⇒ (∃x p(x) ∧ ∃x q(x))
D
∀x (p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x))

Correct : Pridicate Calculus

Similar Questions

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 th...
#19 MCQ
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 (...
#208 MCQ
The statement (¬ p) → (¬ q) is logically equivalent to which of the statements below? I. p → q II. q → p III. (¬ q) ∨ p IV. (¬ p) ∨ q
#210 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: