GATE CSE 2007 | Mathematical Logic Question 39 | Discrete Mathematics

$$\forall x\left( {P\left( x \right) \Rightarrow Q\left( x \right)} \right) \Rightarrow \left( {\left( {\forall xP\left( x \right)} \right) \Rightarrow \left( {\forall xQ\left( x \right)} \right)} \right)$$

$$\exists x\left( {P\left( x \right) \vee Q\left( x \right)} \right) \Rightarrow \left( {\left( {\exists xP\left( x \right)} \right) \Rightarrow \left( {\exists xQ\left( x \right)} \right)} \right)$$

$$\exists x\left( {P\left( x \right) \wedge Q\left( x \right)} \right) \Leftrightarrow \left( {\left( {\exists xP\left( x \right)} \right) \wedge \left( {\exists xQ\left( x \right)} \right)} \right)$$

$$\forall x\exists yP\left( {x,y} \right) \Rightarrow \exists y\forall xP\left( {x,y} \right)$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Which one of the first order predicate calculus statements given below correctly expresses the following English statement?

Tigers and lion attack if they are hungry of threatened.

$$\forall x[(tiger(x) \wedge lion(x)) \to $$$$\{ (hungry(x) \vee threatened(x)) \to attacks(x)\} ]$$

$$\forall x[(tiger(x) \vee lion(x)) \to $$$$\{ (hungry(x) \wedge threatened(x)) \to attacks(x)\} ]$$

$$\forall x[(tiger(x) \vee lion(x)) \to $$$$\{ attacks(x) \to (hungry(x)) \vee threatened(x))\} ]$$

$$\forall x[(tiger(x) \vee lion(x)) \to $$$$\{ (hungry(x) \vee threatened(x)) \to attacks(x)\} ]$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Consider the following propositional statements:

$${\rm P}1:\,\,\left( {\left( {A \wedge B} \right) \to C} \right) \equiv \left( {\left( {A \to C} \right) \wedge \left( {B \to C} \right)} \right)$$
$${\rm P}2:\,\,\left( {\left( {A \vee B} \right) \to C} \right) \equiv \left( {\left( {A \to C} \right) \vee \left( {B \to C} \right)} \right)$$ Which one of the following is true?

$$P1$$ is tautology, but not $$P2$$

$$P2$$ is tautology, but not $$P1$$

$$P1$$ and $$P2$$ are both tautologies

Both $$P1$$ and $$P2$$ are not tautologies

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

A logical binary relation $$ \odot $$, is defined as follows: GATE CSE 2006 Discrete Mathematics - Mathematical Logic Question 41 English

Let ~ be the unary negation (NOT) operator, with higher precedence then $$ \odot $$. Which one of the following is equivalent to $$A \wedge B?$$

$$\left( { \sim A \odot B} \right)$$

$$\left( { \sim A \odot \sim B} \right)$$

$$ \sim \left( { \sim A \odot \sim B} \right)$$

$$ \sim \left( { \sim A \odot B} \right)$$

Previous Next

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Digital Logic

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages

Computer Organization