List of logic symbols: Difference between revisions

Content deleted Content added

Inline

Revision as of 02:18, 27 February 2023

This article contains logic symbols. Without proper rendering support, you may see question marks, boxes, or other symbols instead 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,^[1] and the LaTeX symbol.

Basic logic symbols

Symbol	Unicode value (hexadecimal)	HTML value (decimal)	HTML entity (named)	LaTeX symbol	Logic Name	Read as	Category	Explanation	Examples
⇒ → ⊃	U+21D2 U+2192 U+2283	⇒ → ⊃	⇒ → ⊃	$\Rightarrow$ \Rightarrow $\to$ \to or \rightarrow $\supset$ \supset $\implies$ \implies	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. $\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+21D4 U+2261 U+2194	⇔ ≡ ↔	⇔ &equiv; &LeftRightArrow;	$\Leftrightarrow$ \Leftrightarrow $\equiv$ \equiv $\leftrightarrow$ \leftrightarrow $\iff$ \iff	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+00AC U+02DC U+0021	¬ ˜ !	¬ &tilde; &excl;	$\neg$ \lnot or \neg $\sim$ \sim	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)$
$\mathbb {D}$	U+1D53B	𝔻	&Dopf;	\mathbb{D}	Domain of discourse	Domain of predicate	Predicate (mathematical logic)		$\mathbb {D} \mathbb {:} \mathbb {R}$
∧ · &	U+2227 U+00B7 U+0026	∧ · &	&and; · &	$\wedge$ \wedge or \land $\cdot$ \cdot $\&$ \&^[2]	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 \land$ $n >2 \Leftrightarrow$ $n = 3$ when n is a natural number.
∨ + ∥	U+2228 U+002B U+2225	∨ + ∥	&or; + &parallel;	$\lor$ \lor or \vee $\parallel$ \parallel	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 \geq 4 \lor n \leq 2 \Leftrightarrow n \neq 3$ when n is a natural number.
↮ ⊕ ⊻ ≢	U+21AE U+2295 U+22BB U+2262	↮ ⊕ ⊻ ≢	&oplus; &veebar; &nequiv;	$\oplus$ \oplus $\veebar$ \veebar $\not \equiv$ \not\equiv	exclusive disjunction	xor; either ... or	propositional logic, Boolean algebra	The statement A ↮ B is true when either A or B, but not both, are true. A ⊻ B means the same.	(¬A) ↮ A is always true, and A ↮ A always false, if vacuous truth is excluded.
⊤ T 1 ■	U+22A4 U+25A0	⊤	&top;	$\top$ \top	Tautology	top, truth, full clause	propositional logic, Boolean algebra, first-order logic	$⊤$ is unconditionally true.	⊤(A) ⇒ A is always true.
⊥ F 0 □	U+22A5 U+25A1	⊥	&perp;	$\bot$ \bot	Contradiction	bottom, falsum, falsity, empty clause	propositional logic, Boolean algebra, first-order logic	⊥ is unconditionally false. (The symbol ⊥ may also refer to perpendicular lines.)	⊥(A) ⇒ A is always false.
∀ ()	U+2200	∀	∀	$\forall$ \forall	universal quantification	for all; for any; for each	first-order logic	$\forall x : P (x)$ or $(x) P (x)$ means P(x) is true for all x.	$\forall n\in \mathbb {N} :n^{2}\geq n.$
∃	U+2203	∃	∃	$\exists$ \exists	existential quantification	there exists	first-order logic	$\exists x : P (x)$ means there exists at least one x such that P(x) is true.	$\exists n\in \mathbb {N} :$ n is even.
$\exists!$	U+2203 U+0021	∃ !	∃!	$\exists !$ \exists !	uniqueness quantification	there exists exactly one	first-order logic	$\exists! x : P (x)$ means there exists exactly one x such that P(x) is true.	$\exists !n\in \mathbb {N} :n+5=2n.$
≔ ≡ :⇔	U+2254 (U+003A U+003D) U+2261 U+003A U+21D4	≔ (: =) ≡ ⊜	&coloneq; &equiv; ⇔	$:=$ := $\equiv$ \equiv $:\Leftrightarrow$ :\Leftrightarrow	definition	is defined as	everywhere	$x ≔ y$ or $x \equiv y$ means x is defined to be another name for y ( The symbol ≡ can also mean other things, such as congruence). $P :\Leftrightarrow Q$ means P is defined to be logically equivalent to Q.	$\cosh x:={\frac {e^{x}+e^{-x}}{2}}$ $A \oplus B :\Leftrightarrow (A \lor B) \land \neg(A \land B)$
( )	U+0028 U+0029	( )	( )	$(~)$ ( )	precedence grouping	parentheses; brackets	everywhere	Perform the operations inside the parentheses first.	$(8 \div 4) \div 2 = 2 \div 2 = 1$ , but $8 \div (4 \div 2) = 8 \div 2 = 4$ .
⊢	U+22A2	⊢	&vdash;	$\vdash$ \vdash	turnstile	proves	propositional logic, first-order logic	x ⊢ y means x proves (syntactically entails) y	(A → B) ⊢ (¬B → ¬A)
⊨	U+22A8	⊨	&vDash;	$\vDash$ \vDash, \models	double turnstile	models	propositional logic, first-order logic	x ⊨ y means x models (semantically entails) y	(A → B) ⊨ (¬B → ¬A)

Advanced and rarely used logical symbols

These symbols are sorted by their Unicode value:

Symbol	Unicode value (hexadecimal)	LaTeX symbol	Logic Name	Read as	Category	Explanation	Examples
̅	U+0305		COMBINING OVERLINE			used format for denoting Gödel numbers. denoting negation used primarily in electronics.	using HTML style "4̅" is a shorthand for the standard numeral "SSSS0". "A ∨ B" says the Gödel number of "(A ∨ B)". "A ∨ B" is the same as "¬(A ∨ B)".
↑ \|	U+2191 U+007C		UPWARDS ARROW VERTICAL LINE			Sheffer stroke, the sign for the NAND operator (negation of conjunction).
↓	U+2193		DOWNWARDS ARROW			Peirce Arrow, the sign for the NOR operator (negation of disjunction).
⊙	U+2299	$\odot$ \odot	CIRCLED DOT OPERATOR			the sign for the XNOR operator (negation of exclusive disjunction).
∁	U+2201		COMPLEMENT
∄	U+2204	∄\nexists	THERE DOES NOT EXIST			strike out existential quantifier, same as "¬∃"
∴	U+2234	∴\therefore	THEREFORE	Therefore
∵	U+2235	∵\because	BECAUSE	because
⊧	U+22A7		MODELS			is a model of (or "is a valuation satisfying")
⊨	U+22A8	⊨\vDash	TRUE	is true of
⊬	U+22AC	⊬\nvdash	DOES NOT PROVE			negated ⊢, the sign for "does not prove"	T ⊬ P says "P is not a theorem of T"
⊭	U+22AD	⊭\nvDash	NOT TRUE	is not true of
†	U+2020		DAGGER	it is true that ...		Affirmation operator
⊼	U+22BC		NAND			NAND operator
⊽	U+22BD		NOR			NOR operator
◇	U+25C7		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 "¬◻¬")
⋆	U+22C6		STAR OPERATOR			usually used for ad-hoc operators
⊥ ↓	U+22A5 U+2193		UP TACK DOWNWARDS ARROW			Webb-operator or Peirce arrow, the sign for NOR. Confusingly, "⊥" is also the sign for contradiction or absurdity.
⌐	U+2310		REVERSED NOT SIGN
⌜ ⌝	U+231C U+231D	\ulcorner \urcorner	TOP LEFT CORNER TOP RIGHT CORNER			corner quotes, also called "Quine quotes"; for quasi-quotation, i.e. quoting specific context of unspecified ("variable") expressions;^[3] also used for denoting Gödel number;^[4] 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. )
◻ □	U+25FB U+25A1		WHITE MEDIUM SQUARE 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 ⊥)
⟛	U+27DB		LEFT AND RIGHT TACK		semantic equivalent
⟡	U+27E1		WHITE CONCAVE-SIDED DIAMOND	never	modal operator
⟢	U+27E2		WHITE CONCAVE-SIDED DIAMOND WITH LEFTWARDS TICK	was never	modal operator
⟣	U+27E3		WHITE CONCAVE-SIDED DIAMOND WITH RIGHTWARDS TICK	will never be	modal operator
□	U+25A1		WHITE SQUARE	always	modal operator
⟤	U+25A4		WHITE SQUARE WITH LEFTWARDS TICK	was always	modal operator
⟥	U+25A5		WHITE SQUARE WITH RIGHTWARDS TIC	will always be	modal operator
⥽	U+297D		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.
⨇	U+2A07		TWO LOGICAL AND OPERATOR

Usage in various countries

Poland and Germany

As of 2014^[update] in Poland, the universal quantifier is sometimes written ∧, and the existential quantifier as ∨. 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%".

References

^ "Named character references". HTML 5.1 Nightly. W3C. Retrieved 9 September 2015.
^ Although this character is available in LaTeX, the MediaWiki TeX system does not support it.
^ Quine, W.V. (1981): Mathematical Logic, §6
^ Hintikka, Jaakko (1998), The Principles of Mathematics Revisited, Cambridge University Press, p. 113, ISBN 9780521624985.

External links

Named character entities in HTML 4.0

[1] "Named character references". HTML 5.1 Nightly. W3C. Retrieved 9 September 2015.

[2] Although this character is available in LaTeX, the MediaWiki TeX system does not support it.

[3] Quine, W.V. (1981): Mathematical Logic, §6

[4] Hintikka, Jaakko (1998), The Principles of Mathematics Revisited, Cambridge University Press, p. 113, ISBN 9780521624985.

[1]

[2]

[3]

[4]

@@ Line 30: / Line 30: @@
 |implies; if ... then
 |[[propositional logic|propositional&nbsp;logic]], [[Heyting algebra | Heyting&nbsp;algebra]]
-|<math>A \Rightarrow B</math> is false when {{mvar|A}} is true and {{mvar|B}} is false but true otherwise.<br /><br /><math>\rightarrow</math> may mean the same as <math>\Rightarrow</math> (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]]).
+|<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]]).
-|<math>x = 2 \Rightarrow x^2 = 4</math> is true, but <math>x^2 = 4 \Rightarrow x = 2</math> is in general false (since {{mvar|x}} could be −2).
+|<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).
 |-
 ! scope"row" align="center" |<div style="font-size:200%;">⇔<br />≡<br />↔</div>
@@ Line 41: / Line 41: @@
 |if and only if; iff; means the same as
 |[[propositional logic|propositional&nbsp;logic]]
-|<math>A \Leftrightarrow B</math> is true only if both {{mvar|A}} and {{mvar|B}} are false, or both {{mvar|A}} and {{mvar|B}} are true.
+|<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.
 |<math>x + 5 = y + 2 \Leftrightarrow x + 3 = y</math>
 |-
@@ Line 57: / Line 57: @@
 |not
 |[[propositional logic|propositional&nbsp;logic]]
-|The statement <math>\lnot A</math> is true if and only if {{mvar|A}} is false.<br /><br />A slash placed through another operator is the same as <math>\neg</math> placed in front.
+|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.
 |<math>\neg (\neg A) \Leftrightarrow A</math><br /> <math>x \neq y \Leftrightarrow \neg (x = y)</math>
 |-
@@ Line 80: / Line 80: @@
 |and
 |[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
-|The statement ''A'' ∧ ''B'' is true if ''A'' and ''B'' are both true; otherwise, it is false.
+|The statement ''A''&nbsp;∧&nbsp;''B'' is true if ''A''&nbsp;and&nbsp;''B'' are both true; otherwise, it is false.
 |{{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]].
 |-
@@ Line 99: / Line 99: @@
 |or
 |[[propositional logic]], [[Boolean algebra (logic)|Boolean&nbsp;algebra]]
-|The statement ''A'' ∨ ''B'' is true if ''A'' or ''B'' (or both) are true; if both are false, the statement is false.
+|The statement ''A''&nbsp;∨&nbsp;''B'' is true if ''A'' or ''B'' (or both) are true; if both are false, the statement is false.
 |{{math|''n''&nbsp;≥ 4&nbsp;&nbsp;∨&nbsp; ''n''&nbsp;≤ 2&nbsp;&nbsp;⇔ ''n''&nbsp;≠ 3}} when ''n'' is a [[natural number]].
 |-
@@ Line 123: / Line 123: @@
 |xor; either ... or
 |[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]]
-| The statement ''A'' ↮ ''B'' is true when either A or B, but not both, are true. ''A'' ⊻ ''B'' means the same.
+| The statement ''A''&nbsp;↮&nbsp;''B'' is true when either A or B, but&nbsp;not both, are true.<br> ''A'' ⊻ ''B'' means the same.
 | (¬''A'')  ↮ ''A'' is always true, and ''A'' ↮ ''A'' always false, if [[vacuous truth]] is excluded.
 |-
@@ Line 135: / Line 135: @@
 |top, truth, full clause
 |[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]], [[first-order logic]]
-| The statement {{math|⊤}} is unconditionally true.
+|   {{math|⊤}} is unconditionally true.
 |⊤(''A'') ⇒ ''A'' is always true.
 |-
@@ Line 147: / Line 147: @@
 |bottom, falsum, falsity, empty clause
 |[[propositional logic]], [[Boolean algebra (logic)|Boolean algebra]], [[first-order logic]]
-| The statement ⊥ is unconditionally false. (The symbol ⊥ may also refer to [[perpendicular]] lines.)
+|  ⊥ is unconditionally false. <br>(The symbol ⊥ may also refer to [[perpendicular]]&nbsp;lines.)
 | ⊥(''A'') ⇒ ''A'' is always false.
 |-
@@ Line 158: / Line 158: @@
 |for all; for any; for each
 |[[first-order logic]]
-|{{math|∀&nbsp;''x'':&nbsp;''P''(''x'')}} or {{math|(''x'')&nbsp;''P''(''x'')}} means ''P''(''x'') is true for all ''x''.
+|{{math|∀&nbsp;''x'':&nbsp;''P''(''x'')}} or {{math|(''x'')&nbsp;''P''(''x'')}} means ''P''(''x'') is true for '''all'''&nbsp;''x''.
 |<math>\forall n \isin \mathbb{N}: n^2 \geq n.</math>
 |-
@@ Line 169: / Line 169: @@
 |there exists
 |[[first-order logic]]
-|{{math|∃&nbsp;''x'': ''P''(''x'')}} means there is at least one ''x'' such that ''P''(''x'') is true.
+|{{math|∃&nbsp;''x'': ''P''(''x'')}} means there exists at '''least&nbsp;one''' ''x'' such that ''P''(''x'')&nbsp;is&nbsp;true.
 |<math>\exists n \isin \mathbb{N}:</math> ''n'' is even.
 |-
@@ Line 178: / Line 178: @@
 | style="text-align:left;font-family:monospace" |<math>\exists !</math>\exists !
 ||[[uniqueness quantification]]
-|there exists exactly one
+|there exists '''exactly&nbsp;one'''
 |[[first-order logic]]
-|{{math|∃!&nbsp;''x'': ''P''(''x'')}} means there is exactly one ''x'' such that ''P''(''x'') is true.
+|{{math|∃!&nbsp;''x'': ''P''(''x'')}} means there exists '''exactly one''' ''x'' such that ''P''(''x'')&nbsp;is&nbsp;true.
 |<math>\exists! n \isin \mathbb{N}: n+5=2n.</math>
 |-
@@ Line 200: / Line 200: @@
 |is defined as
 |everywhere
-|{{math|1=''x''&nbsp;≔ ''y''}} or {{math|''x''&nbsp;≡ ''y''}} means ''x'' is defined to be another name for ''y'' (but note that ≡ can also mean other things, such as [[congruence relation|congruence]]).<br /><br />{{math|''P''&nbsp;:⇔ ''Q''}} means ''P'' is defined to be [[Logical equivalence|logically equivalent]] to ''Q''.
+|{{math|1=''x''&nbsp;≔ ''y''}} or {{math|''x''&nbsp;≡ ''y''}} means ''x'' is defined to be another&nbsp;name&nbsp;for&nbsp;''y'' <br>( The symbol ≡ can also mean other things, such as [[congruence relation|congruence]]).<br /><br />{{math|''P''&nbsp;:⇔ ''Q''}} means ''P'' is defined to be [[Logical equivalence|logically equivalent]] to ''Q''.
 |<math>\cosh x := \frac {e^x + e^{-x}} {2}</math><br /><br />{{math|''A''&nbsp;⊕&nbsp;''B'' :⇔ (''A''&nbsp;∨&nbsp;''B'')&nbsp;∧&nbsp;¬(''A''&nbsp;∧&nbsp;''B'')}}
 |-
@@ Line 213: / Line 213: @@
 |parentheses; brackets
 |everywhere
-| Perform the operations inside the parentheses first.
+| Perform the operations inside the parentheses&nbsp;first.
 |{{math|1=(8 ÷ 4) ÷ 2&nbsp;= 2 ÷ 2&nbsp;= 1}}, but {{math|1=8 ÷ (4 ÷ 2)&nbsp;= 8 ÷ 2&nbsp;= 4}}.
 |-
@@ Line 224: / Line 224: @@
 |[[Logical consequence|proves]]
 |[[propositional logic]], [[first-order logic]]
-|''x'' ⊢ ''y'' means ''x'' proves (syntactically entails) ''y''
+|''x'' ⊢ ''y'' means ''x'' proves (syntactically&nbsp;entails) ''y''
 | (''A'' → ''B'') ⊢ (¬''B'' → ¬''A'')
 |-
@@ Line 235: / Line 235: @@
 |[[Logical consequence|models]]
 |[[propositional logic]], [[first-order logic]]
-|''x'' ⊨ ''y'' means ''x'' models (semantically entails) ''y''
+|''x'' ⊨ ''y'' means ''x'' models (semantically&nbsp;entails) ''y''
 | (''A'' → ''B'') ⊨ (¬''B'' → ¬''A'')
 |-
@@ Line 278: / Line 278: @@
 |
 |
-|[[Sheffer stroke]], the sign for the NAND operator (negation of conjunction).
+|[[Sheffer stroke]],<br>the sign for the NAND operator (negation of conjunction).
 |
 |-
@@ Line 289: / Line 289: @@
 |
 |
-|[[Peirce arrow|Peirce Arrow]], the sign for the NOR operator (negation of disjunction).
+|[[Peirce arrow|Peirce Arrow]], <br>the sign for the NOR operator (negation of disjunction).
 |
 |-
@@ Line 300: / Line 300: @@
 |
 |
-|the sign for the XNOR operator (negation of exclusive disjunction).
+|the sign for the XNOR&nbsp;operator (negation of exclusive disjunction).
 |
 |-
@@ Line 322: / Line 322: @@
 |
 |
-|strike out existential quantifier, same as "¬∃"
+|strike out existential&nbsp;quantifier, same as "¬∃"
 |
 |-
@@ Line 432: / Line 432: @@
 |
 |
-|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 "¬◻¬")
+|modal operator for "it&nbsp;is&nbsp;possible&nbsp;that", "it&nbsp;is&nbsp;not&nbsp;necessarily not" or rarely "it&nbsp;is&nbsp;not&nbsp;probably&nbsp;not" (in most modal logics it is defined as "¬◻¬")
 |
 |-
@@ Line 454: / Line 454: @@
 |
 |
-|Webb-operator or Peirce arrow, the sign for [[Logical NOR|NOR]]. Confusingly, "⊥" is also the sign for contradiction or absurdity.
+|Webb-operator or Peirce arrow, the sign for [[Logical NOR|NOR]].<br> Confusingly, "⊥" is also the sign for contradiction or absurdity.
 |
 |-
@@ Line 477: / Line 477: @@
 |
 |
-|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. 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. )
+|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. )
 |
 |-