Name

Symbol Read as Explanation Examples

Category

A ⇒ B is true only in the case that either A is false

⇒ or B is true.

→ may mean the same as ⇒ (the symbol may

also indicate the domain and codomain of
→ a function; see table of mathematical symbols).

⊃ ⊃ may mean the same as ⇒ (the symbol may also mean superset).
material implication
implies; if .. then

propositional logic, Heyting x = 2 ⇒ x2 = 4 is true, but x2 = 4 ⇒ x = 2

algebra is in general false (since xcould be −2).

⇔
≡
↔ material equivalence
if and only if; iff; means the
same as
A ⇔ B is true only if both A and B are false, or
propositional logic both A and B are true. x+5=y+2 ⇔ x+3=y

¬ The statement ¬A is true if and only if A is false. ¬(¬A) ⇔ A

negation
 x ≠ y ⇔ ¬(x = y)

A slash placed through another operator is the

˜ negation same as "¬" placed in front.
not
! propositional logic

∧
· logical conjunction
and

propositional logic, Boolean The statement A ∧ B is true if A and B are both

& algebra true; else it is false. n < 4 ∧ n >2 ⇔ n = 3 when n is a natural number.

+ logical (inclusive) disjunction

or

propositional logic, Boolean The statement A ∨ B is true if A or B (or both) are

∥ algebra true; if both are false, the statement is false. n ≥ 4 ∨ n ≤ 2 ⇔ n ≠ 3 when n is a natural number.

⊕ exclusive disjunction
xor

propositional logic, Boolean The statement A ⊕ B is true when either A or B,

⊻ algebra but not both, are true. A ⊻ B means the same. (¬A) ⊕ A is always true, and A ⊕ Aalways false, if vacuous truth is excluded

⊤
Tautology
T Tautology
top, verum

propositional logic, Boolean

1 algebra The statement ⊤ is unconditionally true. A ⇒ ⊤ is always true.

⊥
F Contradiction

bottom, falsum, falsity

propositional logic, Boolean

0 algebra The statement ⊥ is unconditionally false. (The symbol ⊥⊥may
⇒ Aalso refer to true.
is always perpendicular lines.)

∀ universal quantification
for all; for any; for each

() first-order logic ∀ x: P(x) or (x) P(x) means P(x) is true for all x. ∀ n ∈ ℕ: n2 ≥ n.

existential quantification
there exists
∃ x: P(x) means there is at least one x such
∃ first-order logic that P(x) is true. ∃ n ∈ ℕ: n is even.

uniqueness quantification

there exists exactly one

∃! x: P(x) means there is exactly one x such

∃! that P(x) is true. ∃! n ∈ ℕ: n + 5 = 2n.
 ∃! x: P(x) means there is exactly one x such
∃! first-order logic that P(x) is true. ∃! n ∈ ℕ: n + 5 = 2n.

≔ x ≔ y or x ≡ y means x is defined to be another name forcosh

y (but
x≔ note that ≡ can
(1/2)(exp x +also
expmean
(−x))other things, such as congruence).

≡ P :⇔ Q means P is defined to be logically equivalento Q.A XOR B :⇔ (A ∨ B) ∧ ¬(A ∧ B)

definition

:⇔ is defined as
everywhere

precedence grouping
parentheses, brackets
Perform the operations inside the parentheses (8 ÷ 4) ÷ 2 = 2 ÷ 2 = 1, but 8 ÷ (4 ÷ 2) = 8 ÷
() everywhere first. 2 = 4.

Turnstile
provable

propositional logic, first- x ⊢ y means y is provable from x (in some

⊢ order logic specified formal system). A → B ⊢ ¬B → ¬A
double turnstile
entails

⊨ x ⊨ y means x semantically entails y A → B ⊨ ¬B → ¬A

 propositional logic, first-
⊨ order logic x ⊨ y means x semantically entails y A → B ⊨ ¬B → ¬A