1
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
Consider the first-order logic sentence
$$\varphi \equiv \,\,\,\,\,\,\,\exists s\exists t\exists u\forall v\forall w$$ $$\forall x\forall y\psi \left( {s,t,u,v,w,x,y} \right)$$
where $$\psi $$ $$(๐ ,๐ก, ๐ข, ๐ฃ, ๐ค, ๐ฅ, ๐ฆ)$$ is a quantifier-free first-order logic formula using only predicate symbols, and possibly equality, but no function symbols. Suppose $$\varphi $$ has a model with a universe containing $$7$$ elements.
$$\varphi \equiv \,\,\,\,\,\,\,\exists s\exists t\exists u\forall v\forall w$$ $$\forall x\forall y\psi \left( {s,t,u,v,w,x,y} \right)$$
where $$\psi $$ $$(๐ ,๐ก, ๐ข, ๐ฃ, ๐ค, ๐ฅ, ๐ฆ)$$ is a quantifier-free first-order logic formula using only predicate symbols, and possibly equality, but no function symbols. Suppose $$\varphi $$ has a model with a universe containing $$7$$ elements.
Which one of the following statements is necessarily true?
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following well-formed formulae in predicate calculus is NOT valid?
3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following well formed formulae is a tautology?
4
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following Boolean expressions is NOT A tautology?
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages