• edited by
2,522 views
2 2 votes

Consider $F(P), Q(P), L(P)$ denotes statements “Printer $P$ is out of service”, “Print job $P$ is queued” and “Print job $P$ is lost” respectively. Then statement “If a job is queued and lost then some printer are out of service” is represented by

  1. $\exists j (Q(j) \wedge L(j)) \rightarrow \forall p F(P)$
  2. $\exists j (Q(j) \vee L(j)) \rightarrow \exists p F(P)$
  3. $\exists j (Q(j) \wedge L(j)) \rightarrow \exists p F(P)$
  4. $\forall j (Q(j) \wedge L(j)) \rightarrow \exists p F(P)$

2 Answers

1 1 vote
sir one request to you please do not post test series question , because of you , when we get same question in test series we skip to solve that particular question and save our time 

sorry to say you sir but its request from gate overflow family 

0 0 votes
Answer would be $C$.

A Job is Queued and lost = $\exists_j(Q(j) \wedge L(j))$

Some Printer are Out of service = $\exists_p(F(p))$

Hence, If "A Job is Queued and lost" then "Some Printer are Out of service" =  $\exists_j(Q(j) \wedge L(j))$ $\rightarrow$  $\exists_p(F(p))$
Position:
Show:

Related questions

3 3 votes
1 1 answer
767
767 views
rahul sharma 5 asked Jan 24, 2018
767 views
Which of the following is true about below predicate logic P?A) P is satisfiableB) P is tautologyC) P is contradictionD) NoneThis expression in the end reduces to:-~ ∀z {...
1 1 vote
2 answers 2 answers
1.5k
1.5k views
rahul sharma 5 asked Jul 28, 2017
1,453 views
( ∃x(P(x))→∃x(Q(x)) ) → ( ∃x(P(x)→Q(x)) )( ∃x(P(x)→Q(x)) ) → ( ∃x(P(x))→∃x(Q(x)) )Which of the above is valid and for not valid please give me counter example where LHS i...
0 0 votes
1 1 answer
1.7k
1.7k views
rahul sharma 5 asked Jun 18, 2017
1,726 views
Represent using logic connectives :- 1. "Whenever there is an active alert, all queued messages are transmitted."Given answer is :-∃x(Alert(x)∧Active(x))→∀y((Message(y)∧Q...
1 1 vote
1 answers 1 answer
1.9k
1.9k views