Usuário(a):AlexandreG91/Testes

Símbolo	Nome	Lido como	Categoria	Explicação	Exemplos	Valor Unicode (hexadecimal)	Valor HTML (decimal)	Entidade HTML (named)	Símbolo LaTeX
⇒ → ⊃	implicação material	implica; se ... então	lógica proposicional, aritmética de Heyting	A ⇒ B é verdade (em 3 das 4 possibilidades) ambos falsos, ambos verdadeiros ou B verdadeiro. → pode significar o mesmo que ⇒ (pois existe outro caso onde ele indica a relação entre domínio e contra domínio de uma função; veja tabela de símbolos matemáticos). ⊂ pode significar o mesmo que ⇒ (pois existe outro caso onde ele indica subconjunto).	x = 2 ⇒ x² = 4 é verdadeiro, mas x² = 4 ⇒ x = 2 é, considerando todas as possibilidades falso (considerando que o x poderia ser também −2).	U+21D2 U+2192 U+2283	⇒ → ⊃	⇒ → ⊃	$\Rightarrow$ \Rightarrow $\to$ \to or \rightarrow $\supset$ \supset $\implies$ \implies
⇔ ≡ ↔	se e somente se	se e somente se; sse	lógica proposicional	A ⇔ B é verdade apenas se A e B forem falso ou A e B forem verdadeiro. A<->B é verdade quando (A -> B & B -> A) é verdade.	x + 5 = y + 2 ⇔ x + 3 = y	U+21D4 U+2261 U+2194	⇔ ≡ ↔	⇔ &equiv; ↔	$\Leftrightarrow$ \Leftrightarrow $\equiv$ \equiv $\leftrightarrow$ \leftrightarrow $\iff$ \iff
¬ ˜ !	negação	negado	lógica proposicional	A proposição ¬A é verdadeiro se e somente se A é falso.	¬(¬A) ⇔ A x ≠ y ⇔ ¬(x = y)	U+00AC U+02DC U+0021	¬ ˜ !	¬ &tilde; &excl;	$\neg$ \lnot or \neg $\sim$ \sim
𝔻	Domain of discourse	Domain of predicate	Predicate (mathematical logic)		$\mathbb {D} \mathbb {:} \mathbb {R}$	U+1D53B	𝔻	&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	∧ · &	&and; · &	$\wedge$ \wedge or \land $\cdot$ \cdot $\&$ \&^[1]
∨ + ∥	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 ≤ 2 ⇔ n ≠ 3 when n is a natural number.	U+2228 U+002B U+2225	∨ + ∥	&or; + &parallel;	$\lor$ \lor or \vee $\parallel$ \parallel
⊕ ⊻ ≢	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.	U+2295 U+22BB U+2262	⊕ ⊻ ≢	&oplus; &veebar; &nequiv;	$\oplus$ \oplus $\veebar$ \veebar $\not \equiv$ \not\equiv
⊤ T 1	Tautology	top, truth	propositional logic, Boolean algebra	The statement ⊤ is unconditionally true.	A ⇒ ⊤ is always true.	U+22A4	⊤	&top;	$\top$ \top
⊥ F 0	Contradiction	bottom, falsum, falsity	propositional logic, Boolean algebra	The statement ⊥ is unconditionally false. (The symbol ⊥ may also refer to perpendicular lines.)	⊥ ⇒ A is always true.	U+22A5	⊥	&perp;	$\bot$ \bot
∀ ()	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 ∈ ℕ: n² ≥ n.	U+2200	∀	∀	$\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.	∃ n ∈ ℕ: n is even.	U+2203	∃	∃	$\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.	∃! n ∈ ℕ: n + 5 = 2n.	U+2203 U+0021	∃ !	∃!	$\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	≔ (: =) ≡ ⊜	&coloneq; &equiv; ⇔	$:=$ := $\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	( )	( )	$(~)$ ( )
⊢	turnstile	proves	propositional logic, first-order logic	x ⊢ y means x proves (syntactically entails) y	(A → B) ⊢ (¬B → ¬A)	U+22A2	⊢	&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	⊨	&vDash;	$\vDash$ \vDash, \models

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

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

[1]