• edited by
17,358 views
50 50 votes

Which one of these first-order logic formulae is valid?

  1. $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$
  2. $\exists x\left(P\left(x\right) \vee Q\left(x\right)\right)\implies \left(\exists xP\left(x\right)\implies \exists xQ\left(x\right)\right)$
  3. $\exists x\left(P\left(x\right) \wedge Q\left(x\right)\right) \iff \left(\exists xP\left(x\right) \wedge \exists xQ\left(x\right)\right)$
  4. $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$

5 Answers

Best answer
66 66 votes

(A) is the answer

  1. LHS: For every x, if P holds then Q holds
    RHS: If P(x) holds for all x, then Q(x) holds for all x.
    LHS implies RHS but RHS does not imply LHS.
     
  2. LHS: An x exist for which either P(x) is true or Q(x) is true.
    RHS: If an x exist for which P(x) is true then another x exist for which Q(x) is true.
    LHS does not imply RHS, but on RHS if we change ∃xP(x) to ~∃xP(x), implication becomes TRUE.
     
  3. LHS: There exist an x for which both P(x) and Q(x) are true.
    RHS: There exist an x for which P(x) is true and there exist an x for which Q(x) is true.
    LHS implies RHS but RHS does not imply LHS as the 'x' for P and Q can be different on the RHS
     
  4. LHS: For every x, there exist a y such that P(x, y) holds.
    RHS: There exist a y such that for all x P(x, y) holds.
    Here RHS implies LHS but LHS does not imply RHS as the y on LHS can be different for each x.
• edited by
13 13 votes

(A) LHS= if anyone is robbed then he is searched

RHS= if anyone are robbed then anyone is searched'

Both are not true.

(B) LHS=there is some wrestler or batminton player

RHS= if there is some wrestler then there also have some batminton player

Both are not similar

(C)LHS=there is some player who is wrestler and batminton player

RHS=there is a player who is wrestler and there also has a batminton player

it is true in unidirection but not both direction. like

∃x(P(x) ∧ Q(x)) => (∃xP(x) ∧ ∃xQ(x))

(D)LHS= For all wrestler there is a trainer

RHS= There is same trainer for all wrestler

not true always

• edited by
12 12 votes

For the options, I treat x for boy, y for girl.
P(x) means, he flirts. Q(x) means he loves.
P(x,y) means the boy & girls both are in relationship.     (Prefer this trick or build your own example)

Option A:   For all boys ( a boy flirts -> he loves too)      ->     (all boys flirts -> all boys love)      It is valid.
Option B:   For Some boys ( either flirts or loves)    ->   ( if a guy flirts he loves too)      No way, its not valid.
Option C:   For Some boys ( both flirts and loves)   < ->   ( a guy is there who flirts & a guy is there who loves)    I think it should be ->  not  <->            Hence not valid.
Option D:  For all boys there are some girlfriends -> there are some girls for which all the boys are boy friends.   (Not valid.)

8 8 votes

option A

Let P(x)=All are multiple of 4

     Q(X)= All are even numbers

if a ∈ P(X) then a must  ∈ Q(X) 

3 3 votes

1. If there exist x for which P is true then for all such x Q will be true. 

Hence is P is true for all x then Q is true for all x (Correct)

2. there exist x for which either of P or Q is true. Then if for all x if P is true then for all x Q is true.

Not Necessary  :  consider a case when Q is false for all x , and P is true for all x.

3. here operator is <====> , we can consider any of LHS or RHS first. 

lets consider RHS first If there some x for which P is true and there is some other value of x (Note we are not using same value of x for both) for which Q is true . Then it is not necessary  that  there exist common value of x for which P and Q both are true.

4.    

 

For every value in X there exist some value in Y to which it is related to.

But there does not exist any value for Y which is related to all values of X

Answer:
Position:
Show:

Related questions

86 86 votes
9 answers 9 answers
25.0k
25.0k views
Ishrat Jahan asked Oct 31, 2014
24,950 views
Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfiable ...
61 61 votes
5 answers 5 answers
35.9k
35.9k views
Ishrat Jahan asked Oct 30, 2014
35,932 views
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that orde...
67 67 votes
5 answers 5 answers
26.1k
26.1k views
Ishrat Jahan asked Oct 30, 2014
26,060 views
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....
139 139 votes
18 answers 18 answers
44.4k
44.4k views
Ishrat Jahan asked Oct 30, 2014
44,381 views
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...