Loading Web-Font TeX/Math/Italic

1.5 Quantifiers & Predicate Logic

Satisfiability

Select all of the options that guarantee that predicate $P(x)$ is satisfiable:

$\forall x. P(x)$

$\exists x. P(x)$

$\forall x. \text{NOT}(P(x))$

$\text{NOT}(\forall x. \text{NOT}(P(x)))$

$\exists x. \text{NOT}(P(x))$

$\text{NOT}(\exists x. \text{NOT}(P(x))$

MathJax Math Υ 