query: Logic symbols $\forall$ and $\exists$
positive_passages.docid: 27104
positive_passages.text: Confused between Nested Quantifiers
negative_passages.docid: 157924
negative_passages.text: $\forall x\in\mathbb{N}[(\exists y\in\mathbb{N}(2\leq y\land y<x\land y\ |\ x))\to(\exists z\in\mathbb{N}(2\leq z\land z\leq\sqrt x\land z\ |\ x))]$
negative_passages.docid: 103112
negative_passages.text: Does the existential quantifier distribute over an implication?
negative_passages.docid: 78290
negative_passages.text: Countable axiom of choice: why you can't prove it from just ZF
negative_passages.docid: 93557
negative_passages.text: Intuitively, why does (B → S) ≡ (¬B ∨ S)?
negative_passages.docid: 93342
negative_passages.text: Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators.
negative_passages.docid: 78576
negative_passages.text: How to write “there exists an infinite number of”?
negative_passages.docid: 17624
negative_passages.text: Axiom of Choice iff Every set has a choice function
negative_passages.docid: 101741
negative_passages.text: Selection of logical connectives {¬,∨,∧,⇒,⇔} in set theory?
negative_passages.docid: 147556
negative_passages.text: Express logic puzzles with proposition calculus notation
negative_passages.docid: 118390
negative_passages.text: Symbol for the cardinality of the continuum
negative_passages.docid: 75381
negative_passages.text: How can we reason about "if P then Q" or "P only if Q" statements in propositional logic?
negative_passages.docid: 16187
negative_passages.text: proof of functional completeness of logical operators
negative_passages.docid: 63056
negative_passages.text: Subquery using Exists 1 or Exists *
negative_passages.docid: 79695
negative_passages.text: Logical operators OR AND in condition and order of conditions in WHERE
negative_passages.docid: 39333
negative_passages.text: The meaning of singleton and existence of $\{\varnothing, \{ \varnothing \}\}$
negative_passages.docid: 43655
negative_passages.text: Verify is tautology by using logical equivalence