View source for List of logic symbols

{{Short description|List of symbols used to express logical relations}}
{{ SpecialChars
| special    = logic symbols
| fix        = Help:Special_characters
| characters = logic symbols
}}

In [[logic]], a set of [[Symbol (logic)|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,<ref>{{cite web|title=Named character references|url=http://www.w3.org/html/wg/drafts/html/master/syntax.html#named-character-references|website=HTML 5.1 Nightly|publisher=W3C|access-date=9 September 2015}}</ref> and the [[LaTeX]] symbol.

==Basic logic symbols==
{| class="wikitable"
! scope="col" |Symbol
! scope="col" |Unicode<br />value<br />(hexadecimal)
! scope="col" |HTML<br />codes
! scope="col" |[[LaTeX]]<br />symbol
!Logic Name 
!Read as
!Category
! scope="col" |Explanation
! scope="col" |Examples
|-
! scope"row" align="center" |<div style="font-size:200%;">⇒<br />→<br />⊃</div>
| style="text-align:left;font-family:monospace" |U+21D2<br /><br />U+2192<br /><br />U+2283
| style="text-align:left;font-family:monospace" |&amp;#8658;<br />&amp;#8594;<br />&amp;#8835;
&amp;rArr;<br />&amp;rarr;<br />&amp;sup;
| style="text-align:left;font-family:monospace" |<div><math>\Rightarrow</math>\Rightarrow<br /><math>\implies</math>\implies<br />
<math>\to</math>\to or \rightarrow<br /><math>\supset</math>\supset<br /></div>
||[[material conditional|material conditional (material implication)]]
|implies,<br> if P then Q,<br> it is not the case that P and not Q
|[[propositional logic|propositional&nbsp;logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]], [[Heyting algebra | Heyting&nbsp;algebra]]
|<math>A \Rightarrow B</math> is&nbsp;false when {{mvar|A}} is true and {{mvar|B}} is false but&nbsp;true&nbsp;otherwise.<br /><br /><math>\rightarrow</math> may mean the same as <math>\Rightarrow</math><br>(the symbol may also indicate the domain and codomain of a [[function (mathematics)|function]]; see [[table of mathematical symbols]]).<br /><br /><math>\supset</math> may mean the same as <math>\Rightarrow</math> (the symbol may also mean [[superset]]).
| scope"row" align="center" |<div style="font-size:90%;"><math>x = 2 \Rightarrow x^2 = 4</math> is true, but <math>x^2 = 4 \Rightarrow x = 2</math> is in general&nbsp;false<br> (since {{mvar|x}} could be −2).</div>
|-
! scope"row" align="center" |<div style="font-size:200%;">⇔<br />↔<br />≡</div>
| style="text-align:left;font-family:monospace" |U+21D4<br /><br />U+2194<br /><br />U+2261
| style="text-align:left;font-family:monospace" |&amp;#8660;<br />&amp;#8596;<br />&amp;#8801;
&amp;hArr;<br />&amp;LeftRightArrow;<br />&amp;equiv;
| style="text-align:left;font-family:monospace" |<math>\Leftrightarrow</math>\Leftrightarrow<br /><math>\iff</math>\iff<br /><math>\leftrightarrow</math>\leftrightarrow<br /><math>\equiv</math>\equiv
||[[material biconditional|material biconditional (material equivalence)]]
|if and only if, iff, xnor
|[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
|<math>A \Leftrightarrow B</math> is true only if both&nbsp;{{mvar|A}}&nbsp;and&nbsp;{{mvar|B}}&nbsp;are false, or both {{mvar|A}}&nbsp;and&nbsp;{{mvar|B}}&nbsp;are&nbsp;true. Whether a symbol means a [[material biconditional]] or a [[logical equivalence]], depends on the author’s style.
| scope"row" align="center" |<div style="font-size:90%;"><math>x + 5 = y + 2 \Leftrightarrow x + 3 = y</math></div>
|-
! scope"row" align="center" |<div style="font-size:200%;">¬<br />~<br />!
′
</div>
| style="text-align:left;font-family:monospace" |U+00AC<br /><br />U+007E<br /><br />U+0021<br /><br />U+2032
| style="text-align:left;font-family:monospace" |&amp;#172;<br />&amp;#732;<br />&amp;#33;<br />&amp;#8242;
&amp;not;<br />&amp;tilde;<br />&amp;excl;<br />&amp;prime;
| style="text-align:left;font-family:monospace" |<math>\neg</math>\lnot or \neg<br /><br /><math>\sim</math>\sim<br /><br /><br /><math>'</math>  '
||[[negation]]
|not
|[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
|The statement <math>\lnot A</math> is true if&nbsp;and&nbsp;only&nbsp;if {{mvar|A}}&nbsp;is&nbsp;false.<br /><br />A slash placed through another operator is the same as <math>\neg</math> placed in front.

The prime symbol is placed after the negated thing, e.g. <math>p'</math><ref>Virtually all Turkish high school math textbooks use p' for negation due to the books handed out by the Ministry of National Education representing it as p'.</ref>
| scope"row" align="center" |<div style="font-size:90%;"><math>\neg (\neg A) \Leftrightarrow A</math><br /> <math>x \neq y \Leftrightarrow \neg (x = y)</math></div>
|-
! scope"row" align="center" |<div style="font-size:200%;">∧<br/>·<br/>&</div>
| style="text-align:left;font-family:monospace" |U+2227<br /><br />U+00B7<br /><br />U+0026
| style="text-align:left;font-family:monospace" |&amp;#8743;<br />&amp;#183;<br />&amp;#38;
&amp;and;<br />&amp;middot;<br />&amp;amp;<br />
| style="text-align:left;font-family:monospace" |<div><math>\wedge</math>\wedge or \land<br /><math>\cdot</math>\cdot
<br /><br /><math>\&</math>\&<ref>Although this character is available in LaTeX, the [[MediaWiki]] TeX system does not support it.</ref></div>
||[[logical conjunction]]
|and
|[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
|The statement ''A''&nbsp;∧&nbsp;''B'' is true if ''A''&nbsp;and&nbsp;''B'' are both true; otherwise, it is false.
| scope"row" align="center" |<div style="font-size:90%;">{{math|''n''&nbsp;< 4&nbsp;&nbsp;∧&nbsp;}} {{math|''n''&nbsp;>2&nbsp;&nbsp;⇔&nbsp;}} {{math|1=''n''&nbsp;= 3}} when ''n'' is a [[natural number]].</div>
|-
! scope"row" align="center" |<div style="font-size:200%;">∨<br />+<br />∥</div>
| style="text-align:left;font-family:monospace" |U+2228<br /><br />U+002B<br /><br />U+2225
| style="text-align:left;font-family:monospace" |&amp;#8744;<br />&amp;#43;<br />&amp;#8741;
&amp;or;<br />&amp;plus;<br />&amp;parallel;
| style="text-align:left;font-family:monospace" |<math>\lor</math>\lor or \vee<br /><br /><br /><br /><math>\parallel</math>\parallel
||[[logical disjunction|logical (inclusive) disjunction]]
|or
|[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
|The statement ''A''&nbsp;∨&nbsp;''B'' is true if ''A'' or ''B'' (or both) are true; if both are false, the statement is false.
| scope"row" align="center" |<div style="font-size:90%;">{{math|''n''&nbsp;≥ 4&nbsp;&nbsp;∨&nbsp; ''n''&nbsp;≤ 2&nbsp;&nbsp;⇔ ''n''&nbsp;≠ 3}} when ''n'' is a [[natural number]].</div>
|-
! scope"row" align="center" |<br /><div style="font-size:200%;">⊕<br />⊻<br />↮<br />≢</div>
| style="text-align:left;font-family:monospace" |U+2295<br /><br />U+22BB<br /><br />U+21AE<br /><br />U+2262
| style="text-align:left;font-family:monospace" |&amp;#8853;<br />&amp;#8891;<br />&amp;#8622;<br />&amp;#8802;
&amp;oplus;<br />&amp;veebar;<br />—<br />&amp;nequiv;
| style="text-align:left;font-family:monospace" |<math>\oplus</math>\oplus<br /><br /><math>\veebar</math>\veebar<br /><br /><br /><br /><math>\not\equiv</math>\not\equiv
| [[exclusive or|exclusive disjunction]]
|xor,<br> either ... or ... (but not both)
|[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]]
| The statement <math> A \oplus B </math> is true when either ''A'' or ''B'', but&nbsp;not both, are true. This is equivalent to<br> ¬(''A'' ↔ ''B''), hence the symbols <math>\nleftrightarrow</math> and <math>\not\equiv</math>.
| scope"row" align="center" |<div style="font-size:90%;"><math>\lnot A \oplus A</math> is always true and <math>A \oplus A</math> is always false (if [[vacuous truth]] is excluded).</div>
|-
! scope"row" align="center" |<br /><div style="font-size:200%;">⊤<br />T<br />1</div>
| style="text-align:left;font-family:monospace" |<br /><br />U+22A4<br /><br /> <br /> <br /> <br /> <br />
| style="text-align:left;font-family:monospace" |&amp;#8868;
<br />&amp;top;<br />
| style="text-align:left;font-family:monospace" |<math>\top</math>\top<br /><br /> <br /> <br />
|[[Tautology (logic)|true (tautology)]]
|top, truth, tautology, verum, full clause
|[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]], [[first-order logic]]
|<math>\top</math> denotes a proposition that is always true.
| scope"row" align="center" |<div style="font-size:90%;">The proposition <math>\top \lor P</math> is always true since at least one of the two is unconditionally true.</div>
|-
! scope"row" align="center" |<br/><div style="font-size:200%;">⊥<br />F<br />0</div> 
| style="text-align:left;font-family:monospace" |<br /><br />U+22A5<br /><br /> <br /> <br /> <br /> <br />
| style="text-align:left;font-family:monospace" |&amp;#8869;
&amp;perp;<br /><br /> <br /> <br />
| style="text-align:left;font-family:monospace" |<math>\bot</math>\bot<br /><br /> <br /> <br />
|[[False (logic)|false (contradiction)]]
|bottom, falsity, contradiction, falsum, empty clause
|[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]], [[first-order logic]]
|<math>\bot</math> denotes a proposition that is always false. <br>The symbol ⊥ may also refer to [[perpendicular]]&nbsp;lines.
| scope"row" align="center" |<div style="font-size:90%;">The proposition <math>\bot \wedge P</math> is always false since at least one of the two is unconditionally false.</div>
|-
! scope"row" align="center" |<div style="font-size:200%;">∀<br />()</div>
| style="text-align:left;font-family:monospace" |U+2200<br /><br /><br />
| style="text-align:left;font-family:monospace" |&amp;#8704;
&amp;forall;<br /><br /><br />
| style="text-align:left;font-family:monospace" |<math>\forall</math>\forall<br /><br /><br />
||[[universal quantification]]
|given any, for all, for every, for each, for any
|[[first-order logic]]
|<math>\forall x </math>&nbsp;<math>P(x) </math> or<br> <math>(x) </math>&nbsp;<math>P(x) </math> says “given any <math>x </math>, <math>x </math> has property <math>P</math>.”
| scope"row" align="center" |<div style="font-size:90%;"><math>\forall n \isin \mathbb{N}: n^2 \geq n.</math></div>
|-
! scope"row" align="center" |<div style="font-size:200%;">∃</div>
| style="text-align:left;font-family:monospace" |U+2203
| style="text-align:left;font-family:monospace" |&amp;#8707;
&amp;exist;
| style="text-align:left;font-family:monospace" |<math>\exists</math>\exists
||[[existential quantification]]
|there exists, for some
|[[first-order logic]]
|<math>\exists x </math>&nbsp;<math>P(x) </math> says “there exists an <math>x </math> (at least one) such that <math>x</math> has property <math>P</math>.”
| scope"row" align="center" |<div style="font-size:90%;"><math>\exists n \isin \mathbb{N}:</math> ''n'' is even.</div>
|-
! scope"row" align="center" |<div style="font-size:200%;">∃!</div>
| style="text-align:left;font-family:monospace" |U+2203&nbsp;U+0021
| style="text-align:left;font-family:monospace" |&amp;#8707; &amp;#33;
&amp;exist;!
| style="text-align:left;font-family:monospace" |<math>\exists !</math>\exists !
||[[uniqueness quantification]]
|there exists ''exactly&nbsp;one''
|[[first-order logic | first-order logic (abbreviation)]]
|<math>\exists! x</math> <math>P ( x )</math> says “there exists exactly one <math>x </math> such that <math>x </math> has property <math>P</math>.” Only <math>\forall</math> and <math>\exists</math> are part of formal logic.<br> <math>\exists! x</math> <math>P ( x )</math> is an abbreviation for <div style="font-size:86%;"><math>\exists x \forall y(P(y) \leftrightarrow y = x)</math></div>
| scope"row" align="center" |<div style="font-size:90%;"><math>\exists! n \isin \mathbb{N}: n+5=2n.</math></div>
|-
! scope"row" align="center" |<div style="font-size:200%;">( )</div>
| style="text-align:left;font-family:monospace" | U+0028&nbsp;U+0029
| style="text-align:left;font-family:monospace" |&amp;#40; &amp;#41;
&amp;lpar;<br> &amp;rpar;
| style="text-align:left;font-family:monospace" |<math>(~)</math> ( )
|[[precedence grouping]]
|parentheses; brackets
|almost all logic syntaxes, as well as metalanguage
| Perform the operations inside the parentheses&nbsp;first.
| scope"row" align="center" |<div style="font-size:90%;">{{math|1=(8 ÷ 4) ÷ 2&nbsp;= 2 ÷ 2&nbsp;= 1}}, but {{math|1=8 ÷ (4 ÷ 2)&nbsp;= 8 ÷ 2&nbsp;= 4}}.</div>
|-
! scope"row" align="center" |<div style="font-size:200%;"><math>\mathbb{D}</math></div>
| style="text-align:left;font-family:monospace" |U+1D53B
| style="text-align:left;font-family:monospace" |&amp;#120123;
&amp;Dopf;
| style="text-align:left;font-family:monospace" |\mathbb{D}
||[[domain of discourse]]
|domain of discourse
|[[metalanguage | metalanguage (first-order logic semantics)]]
|
| scope"row" align="center" |<div style="font-size:90%;"><math>\mathbb D\mathbb :\mathbb R</math></div>
|-
! scope"row" align="center" |<div style="font-size:200%;">⊢</div>
| style="text-align:left;font-family:monospace" |U+22A2
| style="text-align:left;font-family:monospace" |&amp;#8866;
&amp;vdash;
| style="text-align:left;font-family:monospace" |<math>\vdash</math>\vdash
||[[Turnstile (symbol)|turnstile]]
|[[Logical consequence|syntactically entails (proves)]]
|[[metalanguage | metalanguage (metalogic)]]
|<math>A \vdash B </math> says “<math>B</math> is<br> a theorem of <math>A</math>”.<br> In other words,<br> <math>A</math> proves <math>B</math> via a deductive system.
| scope"row" align="center" |<div style="font-size:90%;"><math>(A \rightarrow B) \vdash (\lnot B \rightarrow \lnot A) </math><br> (eg. by using [[natural deduction]])</div>
|-
! scope"row" align="center" | <div style="font-size:200%;">⊨</div>
| style="text-align:left;font-family:monospace" |U+22A8
| style="text-align:left;font-family:monospace" |&amp;#8872;
&amp;vDash;
| style="text-align:left;font-family:monospace" |<math>\vDash</math>\vDash, \models
||[[double turnstile]]
|[[Double turnstile|semantically entails]]
|[[metalanguage | metalanguage (metalogic)]]
|<math>A \vDash B </math> says<br> “in every [[Structure (mathematical logic)|model]],<br> it is not the case that <math>A</math> is true and <math>B</math> is false”.
| scope"row" align="center" |<div style="font-size:90%;"><math>(A \rightarrow B) \vDash (\lnot B \rightarrow \lnot A) </math><br> (eg. by using [[truth tables]])</div>
|-
!  scope"row" align="center" |<div style="font-size:200%;">≡<br />⟚<br />⇔</div>
| style="text-align:left;font-family:monospace" |U+2261<br /><br />U+27DA<br /><br />U+21D4
| style="text-align:left;font-family:monospace" |&amp;#8801;
—<br />&amp;#8660;
&amp;equiv;
—
&amp;hArr;
| style="text-align:left;font-family:monospace" |<math>\equiv</math>\equiv<br /><br /><br /><br /><math>\Leftrightarrow</math>\Leftrightarrow
|[[logical equivalence]]
|is logically equivalent to
|[[metalanguage | metalanguage (metalogic)]]
|It’s when <math>A \vDash B</math> and <math>B \vDash A</math>. Whether a symbol means a [[material biconditional]] or a [[logical equivalence]], depends on the author’s style.
| scope"row" align="center" |<div style="font-size:90%;"><math>(A \rightarrow B) \equiv (\lnot A \lor B)</math></div>
|-
!scope"row" align="center" |<div style="font-size:200%;">⊬</div>
|style="text-align:left;font-family:monospace" |U+22AC
|
|style="text-align:left;font-family:monospace" |⊬\nvdash
|
|does not syntactically entail (does not prove)
|[[metalanguage | metalanguage (metalogic)]]
|<math>A \nvdash B </math> says “<math>B</math> is<br> not a theorem of <math>A</math>”.<br> In other words,<br> <math>B</math> is not derivable from <math>A</math> via a deductive system.
| scope"row" align="center" |<div style="font-size:90%;"><math>A \lor B \nvdash A \wedge B </math></div>
|-
!scope"row" align="center" |<div style="font-size:200%;">⊭</div>
|style="text-align:left;font-family:monospace" |U+22AD
|
|style="text-align:left;font-family:monospace" |⊭\nvDash
|
|does not semantically entail
|[[metalanguage | metalanguage (metalogic)]]
|<math>A \nvDash B </math> says “<math>A</math> does not guarantee the truth of <math>B</math>&nbsp;”.<br> In other words,<br> <math>A</math> does not make <math>B</math> true.
| scope"row" align="center" |<div style="font-size:90%;"><math>A \lor B \nvDash A \wedge B </math></div>
|-
!scope"row" align="center" |<div style="font-size:200%;">□</div>
|style="text-align:left;font-family:monospace" |U+25A1
|
| style="text-align:left;font-family:monospace" |<math>\Box</math>\Box
|[[Modal logic#Modal_logics_in_philosophy|necessity (in a model)]]
|box; it is necessary that
|[[modal logic]]
|modal operator for “it&nbsp;is&nbsp;necessary&nbsp;that”<br>in [[modal logic|alethic logic]], “it&nbsp;is&nbsp;provable&nbsp;that”<br>in [[provability logic]], “it&nbsp;is&nbsp;obligatory&nbsp;that”<br>in [[deontic logic]], “it&nbsp;is&nbsp;believed&nbsp;that”<br>in [[doxastic logic]].
| scope"row" align="center" |<div style="font-size:90%;"><math>\Box \forall x P(x)</math> says “it is necessary that everything has property <math>P</math>”</div>
|-
!scope"row" align="center" |<div style="font-size:200%;">◇</div>
|style="text-align:left;font-family:monospace" |U+25C7
|
| style="text-align:left;font-family:monospace" |<math>\Diamond</math>\Diamond
|[[Modal logic#Modal_logics_in_philosophy|possibility (in a model)]]
|diamond;<br />it is possible that
|[[modal logic]]
|modal operator for “it&nbsp;is&nbsp;possible&nbsp;that”, (in most modal logics it is defined as “¬□¬”, “it is not necessarily not”).
| scope"row" align="center" |<div style="font-size:90%;"><math>\Diamond \exists x P(x)</math> says “it is possible that something has property <math>P</math>”</div>
|-
!scope"row" align="center" |<div style="font-size:200%;">∴</div>
|style="text-align:left;font-family:monospace" |U+2234
|
|style="text-align:left;font-family:monospace" |∴\therefore
|[[Therefore sign|therefore]]
|[[Therefore sign|therefore]]
|[[metalanguage]]
|abbreviation for “therefore”.
|
|-
!scope"row" align="center" |<div style="font-size:200%;">∵</div>
|style="text-align:left;font-family:monospace" |U+2235
|
|style="text-align:left;font-family:monospace" |∵\because
|[[Therefore sign#Similar signs|because]]
|[[Therefore sign#Similar signs|because]]
|[[metalanguage]]
|abbreviation for “because”.
|
|-
!  scope"row" align="center" |<div style="font-size:200%;">≔<br />≜<br />≝</div>
| style="text-align:left;font-family:monospace" |U+2254<br /><br />U+225C<br /><br />U+225D
| style="text-align:left;font-family:monospace" |&amp;#8788;
&amp;coloneq;<br /><br /><br /><br /><br />
| style="text-align:left;font-family:monospace" |<br /><br /><div>≔ \coloneqq<br /><br /><math>:=</math>:=<br /><br /><math>\triangleq</math>\triangleq<br /><br />
<math> \stackrel{\scriptscriptstyle \mathrm{def}}{=}</math><br />\stackrel{

<nowiki>\scriptscriptstyle \mathrm{def}}{=}</nowiki>
</div>
|[[definition]]
|is defined as
|[[metalanguage]]
|<math>a:=b </math> means "from now on, <math>a</math> is defined to be another name for <math>b</math>." This is a statement in the metalanguage, not the object language. The notation <math>a \equiv b </math> may occasionally be seen in physics, meaning the same as <math>a:=b </math>.
| scope"row" align="center" |<div style="font-size:90%;"><math>\cosh x := \frac {e^x + e^{-x}} {2}</math></div>
|}

==Advanced or rarely used logical symbols==
<!--sum1 plz make a table 4 this, and also some copy editing i am horrible at writing anything that does not look like P&Q...-->
The following symbols are either advanced and context-sensitive or very rarely used:
{| class="wikitable"
! scope="col" |Symbol
!Unicode<br />value<br />(hexadecimal)
!HTML<br />value<br />(decimal)
! scope="col" |HTML<br />entity<br />(named)
! scope="col" |[[LaTeX]]<br />symbol
! scope="col" |Logic Name
! scope="col" |Read as
! scope="col" |Category
! scope="col" |Explanation
|-
!scope"row" align="center" |<div style="font-size:200%;">⥽</div>
|U+297D
|
|
|\strictif
|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 <math> p </math> ⥽ <math> q \equiv \Box(p\rightarrow q)</math>.
|-
! scope"row" align="center" |<div style="font-size:200%;">̅</div>
|U+0305
|
|
|
|[[Overline|combining overline]]
|
|
|Used&nbsp;format&nbsp;for&nbsp;denoting [[Gödel numbering|Gödel&nbsp;numbers]]. Using&nbsp;HTML&nbsp;style “4̅” is an abbreviation for the standard&nbsp;numeral “SSSS0”.
It may also denote a negation (used primarily in electronics).
|-
!scope"row" align="center" |<div style="font-size:200%;">⌜<br>⌝</div>
|U+231C<br>U+231D
|
|
|\ulcorner
\urcorner
|top left corner<br>top right corner
|
|
|Corner quotes, also called “Quine quotes”; for quasi-quotation, i.e. quoting specific context of unspecified (“variable”) expressions;<ref>[[Willard Van Orman Quine|Quine, W.V.]] (1981): ''Mathematical Logic'', §6</ref> also used for denoting [[Gödel number]];<ref>{{citation|last=Hintikka|first=Jaakko|title=The Principles of Mathematics Revisited|url=https://books.google.com/books?id=JHBnE0EQ6VgC&pg=PA113|page=113|year=1998|publisher=Cambridge University Press|isbn=9780521624985}}.</ref> 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. 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.)
|-
!scope"row" align="center" |<div style="font-size:200%;">∄</div>
|U+2204
|
|
|\nexists
|there does not exist
|
|
|Strike out existential quantifier. “¬∃” is recommended instead. {{By whom|date=September 2024}}
|-
! scope"row" align="center" |<div style="font-size:200%;">↑<br><nowiki>|</nowiki></div>
|U+2191<br>U+007C
|
|
|
|upwards arrow<br>vertical line
|
|
|[[Sheffer stroke]],<br>the sign for the NAND operator (negation of conjunction).
|-
!scope"row" align="center" |<div style="font-size:200%;">↓</div>
|U+2193
|
|
|
|downwards arrow
|
|
|[[Peirce arrow|Peirce Arrow]], <br>a sign for the NOR operator (negation of disjunction).
|-
!scope"row" align="center" |<div style="font-size:200%;">⊼</div>
|U+22BC
|
|
|
|NAND
|
|
|A new symbol made specifically for the NAND operator.
|-
!scope"row" align="center" |<div style="font-size:200%;">⊽</div>
|U+22BD
|
|
|
|NOR
|
|
|A new symbol made specifically for the NOR operator.
|-
!scope"row" align="center" |<div style="font-size:200%;">⊙</div>
|U+2299
|
|
|\odot
|circled dot operator
|
|
|A sign for the XNOR operator (material biconditional and XNOR are the same operation).
|-
!scope"row" align="center" |<div style="font-size:200%;">⟛</div>
|U+27DB
|
|
|
|left and right tack
|
|
|“Proves and is proved by”.
|-
!scope"row" align="center" |<div style="font-size:200%;">⊧</div>
|U+22A7
|
|
|
|models
|
|
|“Is a [[Model (logic)|model]] of” or “is a [[Valuation (logic)|valuation]] satisfying”.
|-
!scope"row" align="center" |<div style="font-size:200%;">⊩</div>
|U+22A9
|
|
|
|forces
|
|
|One of this symbol’s uses is to mean “truthmakes” in the truthmaker theory of truth. It is also used to mean “forces” in the set theory method of [[forcing (mathematics) | forcing]].
|-
!scope"row" align="center" |<div style="font-size:200%;">⟡</div>
|U+27E1
|
|
|
|white concave-sided diamond
|never
|modal operator
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⟢</div>
|U+27E2
|
|
|
|white concave-sided diamond with leftwards tick
|was never
|modal operator
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⟣</div>
|U+27E3
|
|
|
|white concave-sided diamond with rightwards tick
|will never be
|modal operator
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⟤</div>
|U+25A4
|
|
|
|white square with leftwards tick
|was always
|modal operator
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⟥</div>
|U+25A5
|
|
|
|white square with rightwards tick
|will always be
|modal operator
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⋆</div>
|U+22C6
|
|
|
|star operator
|
|
|May sometimes be used for ad-hoc operators.
|-
!scope"row" align="center" |<div style="font-size:200%;">⌐</div>
|U+2310
|
|
|
|reversed not sign
|
|
|
|-
!scope"row" align="center" |<div style="font-size:200%;">⨇</div>
|U+2A07
|
|
|
|two logical AND operator
|
|
|
|}

==See also==
{{Portal|Philosophy}}
* [[Glossary of logic]]
* [[Józef Maria Bocheński]]
* [[List of notation used in Principia Mathematica]]
* [[List of mathematical symbols]]
* [[Logic alphabet]], a suggested set of logical symbols
* {{slink|Logic gate#Symbols}}
* [[Logical connective]]
* [[Mathematical operators and symbols in Unicode]]
* [[Non-logical symbol]]
* [[Polish notation#Polish notation for logic|Polish notation]]
* [[Truth function]]
* [[Truth table]]
* [[Wikipedia:WikiProject Logic/Standards for notation]]

==References==
<references/>

==Further reading==
* [[Józef Maria Bocheński]] (1959), ''A Précis of Mathematical Logic'', trans., Otto Bird, from the French and German editions, Dordrecht, South Holland:  D. Reidel.

==External links==
*[http://www.w3.org/TR/WD-html40-970708/sgml/entities.html Named character entities] in [[HTML]] 4.0

{{Common logical symbols}}
{{Logic}}
{{Mathematical symbols notation language}}

[[Category:Mathematical notation|*]]
[[Category:Logic symbols|*]]