Register

Discrete maths penreposition

169 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
rahul sharma 5 asked Nov 16, 2017
1,258 views
Discrete maths:- Predicate logic
Consider $F(P), Q(P), L(P)$ denotes statements Printer $P$ is out of service , Print job $P$ is queued and Print job $P$ ... $\forall j (Q(j) \wedge L(j)) \rightarrow \exists p F(P)$
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 state...
User Avatar
1 votes
1 votes
2 answers
3
rahul sharma 5 asked Jul 28, 2017
896 views
Discrete maths Predicate logic
( ∃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 is true but RHS is false?
( ∃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 cou...
User Avatar
Link Copied!