# Question: rewrite each of these statements so that negations only appear...

###### Question details

- Rewrite each of these statements so that negations only appear
within predicates (that is, so that no negation is outside a
quantifier or an expression involving logical connectives). You
don’t need to show any work.
- ¬∀x∃y ((x> 4) ∨ P(x, y))
- ¬(∀x (P(x) → ∃y∃z (|x - y| <z)))
- ¬∃p∀w∃(x,y,z)∀i ((|w| < p) ∨ (w ∉ L) ∨ ((w = xyz) ∧ (|y| ≥
1) ∧ (|xy| ≤ p) ∧ (xy
^{i}z ∈ L)))