edited by
36,221 views
159 159 votes

Consider the following expressions:

  1. $false$
  2. $Q$
  3. $true$
  4. $P\vee Q$
  5. $\neg Q\vee P$

The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.

16 Answers

Best answer
227 227 votes

$4$ should be the correct answer.$$\begin{array}{|l|l|l|l|} \hline \textbf{P} & \textbf{Q} & \textbf{P} \implies \textbf{Q} & \textbf{P} \wedge ( \textbf{P} \implies \textbf{Q}) \\\hline \text{F} & \text{F} & \text{T} & \text{F} \\\hline \text{F} & \text{T} & \text{T} & \text{F} \\\hline \text{T} & \text{F} & \text{F} & \text{F} \\\hline \text{T} & \text{T} & \text{T} & \text{T} \\\hline \end{array}$$

Suppose $\left(P\wedge(P\implies Q)\right)\iff A$ (For notational convenience)

Thus for options, $(i),(ii),(iii),(iv),(v)$
If $(A\implies \text{option x})$ is a tautology.
then $P\wedge(P\implies Q)$ logically implies $\text{option x}$
else $P\wedge(P\implies Q)$ does not logically implies $\text{option x.}$

$$\small{\begin{array}{|c|c|c|cc|cc|cc|cc|cc|} \hline \textbf {P}& \ \textbf {Q} &\ \textbf{A}&\rlap{\textbf{Option(i)} }&& \rlap{\textbf{Option(ii)}}& &\rlap{\bf{Option(iii)} }&& \rlap{\bf {Option(iv)}}&& \rlap{\bf{Option(v)}} \\\hline &&& \text{False}&A \Rightarrow F & \text{Q}&A \Rightarrow Q&\text{True}&A\Rightarrow true&(P \vee Q)&A \Rightarrow (P \vee Q)&\neg Q \vee P&A \Rightarrow  (\neg Q \vee P))\\\hline F&F&F& & T && T && T && T && T\\\hline F & T & F && T & &T &&T &&T&&T \\\hline T & F & F && T & &T &&T &&T&&T \\\hline T & T & T &F& F & T&T &T&T &T&T&T&T \\\hline \end{array}}$$

Answer $=4$

P.S: Blank entries in the above truth table are like don't care conditions because in those rows the value of $A$ is set to False. Hence, $(A\implies \text{Anything})$ would be set to True.

edited by
114 114 votes
Without making truth table we can solve very easily

P˄(P->Q)

=P˄(~P˅Q)

=(P˄~P)˅(P˄Q)

=P˄Q

Now Check these implications whether they are right or wrong.For checking try T -> F combination if any of them generate this combination then it will be ruled out. If you see carefully  1.P˄Q -> FALSE will ruled out

1.P˄Q->FALSE

2.P˄Q->Q

3.P˄Q->TRUE

4.P˄Q->P˅Q

5.P˄Q->~Q˅P

so answer is 4
edited by
12 12 votes
ans :4

all except the option i satisfies.

P and Q -> true, P or Q,~Q or P,Q
9 9 votes

For two propositions A and B , if we can take A as true and derive B as true somehow then we can say A logically implies B $( A \implies B)$

Taking given premise A as true

Now check each option whether it is implied by given premise or not

options B, C, D, E are implied by given premise $P \land \left( P \to Q\right)$ and option A doesn’t imply it

$\therefore$ the count is 4

6 6 votes
GIVEN

P->Q

P

________

1.implies Q

2 NOW Q implies P OR Q

3.P IS TRUE so it implies P OR ~Q

4 THIS IS DIFFERENT STILL EASY....P->Q is true ..Q is true and TRUE IS TRUE (trivially)..to understand ..make table of p->T

Answer => 4
edited by
Answer:
Position:
Show:

Related questions

90 90 votes
6 answers 6 answers
26.7k
26.7k views
Akash Kanase asked Feb 12, 2016
26,706 views
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 ...
44 44 votes
4 answers 4 answers
8.7k
8.7k views
Akash Kanase asked Feb 12, 2016
8,692 views
The man who is now Municipal Commissioner worked as ________________.the security guard at a universitya security guard at the universitya security guard at universitythe...
141 141 votes
15 answers 15 answers
39.4k
39.4k views
Akash Kanase asked Feb 12, 2016
39,442 views
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...
35 35 votes
2 answers 2 answers
14.3k
14.3k views
Akash Kanase asked Feb 12, 2016
14,261 views
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remain...