 List of Logic Symbols
Browse the List of Logic Symbols below. View Videos or join the discussion on this topic. Add List of Logic Symbols to your PopFlock.com topic list for future reference or share this resource on social media.
List of Logic Symbols

In logic, a set of symbols is commonly used to express logical representation. The following table lists many common symbols, together with their name, how they should be read out loud, and the related field of mathematics. Additionally, the subsequent columns contains an informal explanation, a short example, the Unicode location, the name for use in HTML documents, and the LaTeX symbol.

## Basic logic symbols

Symbol Name Read as Category Explanation Examples Unicode
value
HTML
value
(decimal)
HTML
entity
(named)
LaTeX
symbol
=>
->
?
material implication implies; if ... then propositional logic, Heyting algebra $A\Rightarrow B$ is false when A is true and B is false but true otherwise.[circular reference]

$\rightarrow$ may mean the same as $\Rightarrow$ (the symbol may also indicate the domain and codomain of a function; see table of mathematical symbols).

$\supset$ may mean the same as $\Rightarrow$ (the symbol may also mean superset).
$x=2\Rightarrow x^{2}=4$ is true, but $x^{2}=4\Rightarrow x=2$ is in general false (since x could be -2). U+21D2

U+2192

U+2283
&#8658;

&#8594;

&#8835;
&rArr;

&rarr;

&sup;
$\Rightarrow$ \Rightarrow
$\to$ \to or \rightarrow
$\supset$ \supset
$\implies$ \implies

?
material equivalence if and only if; iff; means the same as propositional logic $A\Leftrightarrow B$ is true only if both A and B are false, or both A and B are true. $x+5=y+2\Leftrightarrow x+3=y$ U+21D4

U+2261

U+27F7
&#8660;

&#8801;

&#10231;
&hArr;

&equiv;

&#10231;
$\Leftrightarrow$ \Leftrightarrow
$\equiv$ \equiv
$\leftrightarrow$ \leftrightarrow
$\iff$ \iff
¬
~
!
negation not propositional logic The statement $\lnot A$ is true if and only if A is false.

A slash placed through another operator is the same as $\neg$ placed in front.
$\neg (\neg A)\Leftrightarrow A$ $x\neq y\Leftrightarrow \neg (x=y)$ U+00AC

U+02DC

U+0021
&#172;

&#732;

&#33;
&not;

&tilde;

&excl;
$\neg$ \lnot or \neg

$\sim$ \sim

$\mathbb {D}$ Domain of discourse Domain of predicate Predicate (mathematical logic) $\mathbb {D} \mathbb {:} \mathbb {R}$ U+1D53B &#120123; &Dopf; \mathbb{D}
?
·
&
logical conjunction and propositional logic, Boolean algebra The statement A ? B is true if A and B are both true; otherwise, it is false. n < 4  ?  n >2    n = 3 when n is a natural number. U+2227

U+00B7

U+0026
&#8743;

&#183;

&#38;
&and;

&middot;

&amp;
$\wedge$ \wedge or \land
$\cdot$ \cdot $\&$ \&
?
+
?
logical (inclusive) disjunction or propositional logic, Boolean algebra The statement A ? B is true if A or B (or both) are true; if both are false, the statement is false. n >= 4  ?  n  n ? 3 when n is a natural number. U+2228

U+002B

U+2225
&#8744;

&#43;

&#8741;
&or;

&plus;

&parallel;

$\lor$ \lor or \vee

$\parallel$ \parallel

$\nleftrightarrow$ ?
?
?
exclusive disjunction xor; either ... or propositional logic, Boolean algebra The statement A $\nleftrightarrow$ B is true when either A or B, but not both, are true. A ? B means the same. A) $\nleftrightarrow$ A is always true, and A $\nleftrightarrow$ A always false, if vacuous truth is excluded. U+2295

U+22BB

U+2262

&#8853;

&#8891;

&#8802;

&oplus;

&veebar;

&nequiv;

$\oplus$ \oplus

$\veebar$ \veebar

$\not \equiv$ \not\equiv

?
T
1
?
Tautology top, truth, full clause propositional logic, Boolean algebra, first-order logic The statement ? is unconditionally true. ?(A) => A is always true. U+22A4

U+25A0

&#8868;

&top;

$\top$ \top

?
F
0
?
Contradiction bottom, falsum, falsity, empty clause propositional logic, Boolean algebra, first-order logic The statement ? is unconditionally false. (The symbol ? may also refer to perpendicular lines.) ?(A) => A is always false. U+22A5

U+25A1

&#8869;

&perp;

$\bot$ \bot
?
universal quantification for all; for any; for each first-order logic xP(x) or (xP(x) means P(x) is true for all x. $\forall n\in \mathbb {N} :n^{2}\geq n.$ U+2200

&#8704;

&forall;

$\forall$ \forall
?
existential quantification there exists first-order logic x: P(x) means there is at least one x such that P(x) is true. $\exists n\in \mathbb {N} :$ n is even. U+2203 &#8707; &exist; $\exists$ \exists
?!
uniqueness quantification there exists exactly one first-order logic ?! x: P(x) means there is exactly one x such that P(x) is true. $\exists !n\in \mathbb {N} :n+5=2n.$ U+2203 U+0021 &#8707; &#33; &exist;! $\exists !$ \exists !
?
?
:
definition is defined as everywhere x ? y or x ? y means x is defined to be another name for y (but note that ? can also mean other things, such as congruence).

P : Q means P is defined to be logically equivalent to Q.
$\cosh x:={\frac {e^{x}+e^{-x}}{2}}$ A XOR B : (A ? B) ? ¬(A ? B)
U+2254 (U+003A U+003D)

U+2261

U+003A U+229C
&#8788; (&#58; &#61;)

&#8801;

&#8860;

&coloneq;

&equiv;

&hArr;

$:=$ :=

$\equiv$ \equiv

$:\Leftrightarrow$ :\Leftrightarrow

( )
precedence grouping parentheses; brackets everywhere Perform the operations inside the parentheses first. (8 ÷ 4) ÷ 2 = 2 ÷ 2 = 1, but 8 ÷ (4 ÷ 2) = 8 ÷ 2 = 4. U+0028 U+0029 &#40; &#41; &lpar;

&rpar;

$(~)$ ( )
?
turnstile proves propositional logic, first-order logic x ? y means x proves (syntactically entails) y (A -> B) ? (¬B -> ¬A) U+22A2 &#8866; &vdash; $\vdash$ \vdash
?
double turnstile models propositional logic, first-order logic x ? y means x models (semantically entails) y (A -> B) ? (¬B -> ¬A) U+22A8 &#8872; &vDash; $\vDash$ \vDash, \models

## Advanced and rarely used logical symbols

These symbols are sorted by their Unicode value:

•  ̅  COMBINING OVERLINE, used as abbreviation for standard numerals (Typographical Number Theory). For example, using HTML style "4̅" is a shorthand for the standard numeral "SSSS0".
• Overline is also a rarely used format for denoting Gödel numbers: for example, "A ? B" says the Gödel number of "(A ? B)".
• Overline is also a way for denoting negation used primarily in electronics: for example, "A ? B" is the same as "¬(A ? B)".
• UPWARDS ARROW or | VERTICAL LINE: Sheffer stroke, the sign for the NAND operator (negation of conjunction).
• DOWNWARDS ARROW Peirce Arrow, the sign for the NOR operator (negation of disjunction).
• CIRCLED DOT OPERATOR the sign for the XNOR operator (negation of exclusive disjunction).
• COMPLEMENT
• THERE DOES NOT EXIST: strike out existential quantifier, same as "¬?"
• THEREFORE: Therefore
• BECAUSE: because
• MODELS: is a model of (or "is a valuation satisfying")
• TRUE: is true of
• DOES NOT PROVE: negated ?, the sign for "does not prove", for example T ? P says "P is not a theorem of T"
• NOT TRUE: is not true of
• DAGGER: Affirmation operator (read 'it is true that ...')
• NAND: NAND operator.
• NOR: NOR operator.
• WHITE DIAMOND: modal operator for "it is possible that", "it is not necessarily not" or rarely "it is not probably not" (in most modal logics it is defined as "¬?¬")
• STAR OPERATOR: usually used for ad-hoc operators
• UP TACK or DOWNWARDS ARROW: Webb-operator or Peirce arrow, the sign for NOR. Confusingly, "?" is also the sign for contradiction or absurdity.
• REVERSED NOT SIGN
• TOP LEFT CORNER and TOP RIGHT CORNER: corner quotes, also called "Quine quotes"; for quasi-quotation, i.e. quoting specific context of unspecified ("variable") expressions; also used for denoting Gödel number; for example "?G?" denotes the Gödel number of G. (Typographical note: although the quotes appears as a "pair" in unicode (231C and 231D), they are not symmetrical in some fonts. And in some fonts (for example Arial) they are only symmetrical in certain sizes. Alternatively the quotes can be rendered as ? and ? (U+2308 and U+2309) or by using a negation symbol and a reversed negation symbol ? ¬ in superscript mode. )
• WHITE MEDIUM SQUARE or WHITE SQUARE: modal operator for "it is necessary that" (in modal logic), or "it is provable that" (in provability logic), or "it is obligatory that" (in deontic logic), or "it is believed that" (in doxastic logic); also as empty clause (alternatives: $\emptyset$ and ?).
• LEFT AND RIGHT TACK: semantic equivalent

The following operators are rarely supported by natively installed fonts.

• WHITE CONCAVE-SIDED DIAMOND: modal operator for never
• WHITE CONCAVE-SIDED DIAMOND WITH LEFTWARDS TICK: modal operator for was never
• WHITE CONCAVE-SIDED DIAMOND WITH RIGHTWARDS TICK: modal operator for will never be
• WHITE SQUARE: modal operator for always
• WHITE SQUARE WITH LEFTWARDS TICK: modal operator for was always
• WHITE SQUARE WITH RIGHTWARDS TICK: modal operator for will always be
• RIGHT FISH TAIL: sometimes used for "relation", also used for denoting various ad hoc relations (for example, for denoting "witnessing" in the context of Rosser's trick) The fish hook is also used as strict implication by C.I.Lewis $p$ ? $q\equiv \Box (p\rightarrow q)$ , the corresponding LaTeX macro is \strictif. See here for an image of glyph. Added to Unicode 3.2.0.
• TWO LOGICAL AND OPERATOR

## Usage in various countries

### Poland and Germany

As of 2014 in Poland, the universal quantifier is sometimes written $\wedge$ , and the existential quantifier as $\vee$ . The same applies for Germany.

### Japan

The => symbol is often used in text to mean "result" or "conclusion", as in "We examined whether to sell the product => We will not sell it". Also, the -> symbol is often used to denote "changed to", as in the sentence "The interest rate changed. March 20% -> April 21%".