- ∃x P(x)
- ∀x P(x)
- ∃x ¬P(x)
- ∀x ¬P(x)
- ¬∃x P(x)
- ¬∀x P(x)

This answer is restricted. Please login to view the answer of this question.

Login Now*Division and Remainder Algorithm:*

Let a be an integer and ‘d’ be positive integer then there exists two unique integer q and r with 0 < r < d such that a = dq + r

where

a = dividend

d = divisior

q = quotient

r = remainder

i.e.

dividend = divisor * quotient + Remainder

For Example:

let a = 19, d = 3

3 ) 19 ( 6 -18 ----- 1 19 = 3 x 6 + 1

**Second Part:**

As we know that Universal Quantifier can be expressed as conjunctions and Existential Quantifier can be expressed as Disjunctions, given functions can be written as following:

a) ∃x P(x) = P(0) ∨ P(1) ∨ P(2) ∨ P(3) ∨ P(4)

b) ∀x P(x) = P(0) ∧ P(1) ∧ P(2) ∧ P(3) ∧ P(4)

c) ∃x ¬P(x) = ¬P(0) ∨ ¬P(1) ∨ ¬P(2) ∨ ¬P(3) ∨ ¬P(4)

d) ∀x ¬P(x) = ¬P(0) ∧ ¬P(1) ∧ ¬P(2) ∧ ¬P(3) ∧ ¬P(4)

e) ¬∃x P(x) = ¬ (P(0) ∨ P(1) ∨ P(2) ∨ P(3) ∨ P(4))

f) ¬∀x P(x) = ¬ (P(0) ∧ P(1) ∧ P(2) ∧ P(3) ∧ P(4))

If you found any type of error on the answer then please mention on the comment or report an answer or submit your new answer.

Click here to submit your answer.

HAMROCSIT.COM

## Discussion