Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by amanboii
6
answers
1
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
Which one of the following well-formed formulae in predicate calculus is NOT valid ?$(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee ...
17.1k
views
commented
Oct 31, 2023
Mathematical Logic
gatecse-2016-set2
mathematical-logic
first-order-logic
normal
+
–
7
answers
2
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...
65.3k
views
commented
Oct 26, 2023
Graph Theory
gatecse-2008
graph-theory
normal
graph-planarity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register