Hi There!

I'm Dan Schlegel, an Associate Professor in the Computer Science Department at SUNY Oswego

CSC221 Symbols

Logical Symbols

SymbolNameExplanation
Universal Quantification∀x P(x) means P(x) is True for all x.
Existential Quantification∃x P(x) means there is at least one x such that P(x) is True.
∧, &, ·ConjunctionA ∧ B is True if A and B are both True, otherwise it is False.
∨, |, +DisjunctionA ∨ B is True if A or B (or both) are True, otherwise it is False.
⇒, →, ⊃Material Implication A ⇒ B is False only when A is True and B is False, otherwise it is True.
⇔, ≡, ↔Material Equivalence (Biconditional)A ⇔ B is True only when both A and B are False, or both A and B are True.
¬, ~, !Negation¬A is True if and only if A is False.
Exclusive DisjunctionA ⊕ B is True when either A or B is True, but not both.
Derivesx ⊢ y means y is provable from x

Set Symbols

SymbolNameExplanation
{ }SetAn unordered collection of elements
|Such thatUsed in set builder notation to stand for "such that"
A∩BIntersectionElements in both sets A and B.
A∪BUnionElements in set A or set B (inclusively).
A⊆BSubsetEvery element in A is in B.
A⊂BProper SubsetEvery element in A is in B, and A is smaller than B.
P(A)Power SetAll subsets of A
A=BEqualityBoth A and B have the same elements.
A-B or A\BDifference (Relative Complement)Elements in A which are not in B
a∈AElement ofa is in the set A
a∉ANot element ofa is not in the set A
|A|CardinalityThe number of elements of the set A
A×BCartesian ProductThe set of all ordered pairs where the first element is from A, and the second is from B