ExamLookup
Menu mobile
Home
Current Affairs
General Knowledge
Computer
Python
HTML
GATE
: Computer Science and IT
Which one of the following well-formed formulae in predicate calculus is NOT valid? , Which one of the following well-formed formulae in predicate calculus is NOT valid?
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))
(∀x p(x) ⇒ ∀x q(x)) ⇒ (∃x ¬ p(x) ∨ ∀x q(x))
B.
(∃x p(x) ∨ ∃x q(x)) ⇒ ∃x ( p(x) ∨ q(x))
(∃x p(x) ∨ ∃x q(x)) ⇒ ∃x ( p(x) ∨ q(x))
C.
∃x ( p(x) ∧ q(x)) ⇒ (∃x p(x) ∧ ∃x q(x))
∃x ( p(x) ∧ q(x)) ⇒ (∃x p(x) ∧ ∃x q(x))
D.
∀x ( p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x))
∀x ( p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x))
Solution
D. ∀x ( p(x) ∨ q(x)) ⇒ (∀x p(x) ∨ ∀x q(x))
Explanation
For every x , p or q is true. It can not imply that Either for every x, p is true OR for every x, q is true. So last option is wrong.
CCC Online Test 2021
CCC Practice Test Hindi
Python Programming Tutorials
Best Computer Training Institute in Prayagraj (Allahabad)
O Level NIELIT Study material and Quiz
Bank SSC Railway TET UPTET Question Bank
career counselling in allahabad
Sarkari Exam Quiz
Website development Company in Allahabad