# قائمة الرموز المنطقية

في المنطق، تُستخدم مجموعة من الرموز للتعبير عن مفاهيمَ منطقيةٍ. القائمة الآتية تُلخّص أبرز الترميزات مع تسميتها واستعمالها في لغة HTML.
| الرمز | الاسم | وصف | مثال | قيمة اليونيكود (في نظام العد الست عشري) | قيمة HTML (في نظام العد العشري) | اسم ترميز HTML | ترميز اللاتخ LaTeX |
| الرمز | القراءة | وصف | مثال | قيمة اليونيكود (في نظام العد الست عشري) | قيمة HTML (في نظام العد العشري) | اسم ترميز HTML | ترميز اللاتخ LaTeX |
| الرمز | التصنيف | وصف | مثال | قيمة اليونيكود (في نظام العد الست عشري) | قيمة HTML (في نظام العد العشري) | اسم ترميز HTML | ترميز اللاتخ LaTeX |
| ⇒ → ⊃ | قضية شرطية | $A\Rightarrow B$ is true if and only if $B$ can be true and $A$ can be false but not vice versa. $\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$ صحيحة. لكن العبارة $x^{2}=4\Rightarrow x=2$ خاطئة؛ لأنَّ $x$ ممكن أن تكون -2. | U+21D2 U+2192 U+2283 | &#8658; &#8594; &#8835; | &rArr; &rarr; &sup; | $\Rightarrow$\Rightarrow $\to$\to or \rightarrow$\supset$\supset $\implies$\implies |
| ⇒ → ⊃ | يقتضي؛ إذا ... فإنَّ | $A\Rightarrow B$ is true if and only if $B$ can be true and $A$ can be false but not vice versa. $\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$ صحيحة. لكن العبارة $x^{2}=4\Rightarrow x=2$ خاطئة؛ لأنَّ $x$ ممكن أن تكون -2. | U+21D2 U+2192 U+2283 | &#8658; &#8594; &#8835; | &rArr; &rarr; &sup; | $\Rightarrow$\Rightarrow $\to$\to or \rightarrow$\supset$\supset $\implies$\implies |
| ⇒ → ⊃ | حساب القضايا، الجبر | $A\Rightarrow B$ is true if and only if $B$ can be true and $A$ can be false but not vice versa. $\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$ صحيحة. لكن العبارة $x^{2}=4\Rightarrow x=2$ خاطئة؛ لأنَّ $x$ ممكن أن تكون -2. | U+21D2 U+2192 U+2283 | &#8658; &#8594; &#8835; | &rArr; &rarr; &sup; | $\Rightarrow$\Rightarrow $\to$\to or \rightarrow$\supset$\supset $\implies$\implies |
| ⇔ ≡ ↔ | قضية تكافؤية | $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+2194 | &#8660; &#8801; &#8596; | &hArr; &equiv; &harr; | $\Leftrightarrow$\Leftrightarrow $\equiv$\equiv$\leftrightarrow$\leftrightarrow $\iff$\iff |
| ⇔ ≡ ↔ | إذا وفقط إذا | $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+2194 | &#8660; &#8801; &#8596; | &hArr; &equiv; &harr; | $\Leftrightarrow$\Leftrightarrow $\equiv$\equiv$\leftrightarrow$\leftrightarrow $\iff$\iff |
| ⇔ ≡ ↔ | حساب القضايا | $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+2194 | &#8660; &#8801; &#8596; | &hArr; &equiv; &harr; | $\Leftrightarrow$\Leftrightarrow $\equiv$\equiv$\leftrightarrow$\leftrightarrow $\iff$\iff |
| ¬ ˜ ! | نفي | 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 |
| ¬ ˜ ! | ليس | 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 |
| ¬ ˜ ! | حساب القضايا | 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 |
| ∧ · & | logical conjunction | 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 $\&$\& |
| ∧ · & | و | 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 $\&$\& |
| ∧ · & | حساب القضايا، جبر بول | 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 $\&$\& |
| ∨ + ∥ | logical (inclusive) disjunction | 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 | &#8744; &#43; &#8741; | &or; | $\lor$\lor or \vee $\parallel$\parallel |
| ∨ + ∥ | or | 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 | &#8744; &#43; &#8741; | &or; | $\lor$\lor or \vee $\parallel$\parallel |
| ∨ + ∥ | حساب القضايا، جبر بول | 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 | &#8744; &#43; &#8741; | &or; | $\lor$\lor or \vee $\parallel$\parallel |
| ⊕ ⊻ | exclusive disjunction | 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 | &#8853; &#8891; | &oplus; | $\oplus$\oplus $\veebar$\veebar |
| ⊕ ⊻ | xor | 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 | &#8853; &#8891; | &oplus; | $\oplus$\oplus $\veebar$\veebar |
| ⊕ ⊻ | حساب القضايا، جبر بول | 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 | &#8853; &#8891; | &oplus; | $\oplus$\oplus $\veebar$\veebar |
| ⊤ T 1 | Tautology | The statement ⊤ is unconditionally true. | A ⇒ ⊤ is always true. | U+22A4 | &#8868; | | $\top$\top |
| ⊤ T 1 | top, verum | The statement ⊤ is unconditionally true. | A ⇒ ⊤ is always true. | U+22A4 | &#8868; | | $\top$\top |
| ⊤ T 1 | حساب القضايا، جبر بول | The statement ⊤ is unconditionally true. | A ⇒ ⊤ is always true. | U+22A4 | &#8868; | | $\top$\top |
| ⊥ F 0 | Contradiction | The statement ⊥ is unconditionally false. (The symbol ⊥ may also refer to perpendicular lines.) | ⊥ ⇒ A is always true. | U+22A5 | &#8869; | &perp; | $\bot$\bot |
| ⊥ F 0 | bottom, falsum, falsity | The statement ⊥ is unconditionally false. (The symbol ⊥ may also refer to perpendicular lines.) | ⊥ ⇒ A is always true. | U+22A5 | &#8869; | &perp; | $\bot$\bot |
| ⊥ F 0 | حساب القضايا، جبر بول | The statement ⊥ is unconditionally false. (The symbol ⊥ may also refer to perpendicular lines.) | ⊥ ⇒ A is always true. | U+22A5 | &#8869; | &perp; | $\bot$\bot |
| ∀ | universal quantification | ∀ x: P(x) or (x) P(x) means P(x) is true for all x. | ∀ n ∈ ℕ: n$^2$ ≥ n. | U+2200 | &#8704; | &forall; | $\forall$\forall |
| ∀ | for all; for any; for each | ∀ x: P(x) or (x) P(x) means P(x) is true for all x. | ∀ n ∈ ℕ: n$^2$ ≥ n. | U+2200 | &#8704; | &forall; | $\forall$\forall |
| ∀ | منطق الرتبة الأولى | ∀ x: P(x) or (x) P(x) means P(x) is true for all x. | ∀ n ∈ ℕ: n$^2$ ≥ n. | U+2200 | &#8704; | &forall; | $\forall$\forall |
| ∃ | existential quantification | ∃ x: P(x) means there is at least one x such that P(x) is true. | ∃ n ∈ ℕ: n is even. | U+2203 | &#8707; | &exist; | $\exists$\exists |
| ∃ | there exists | ∃ x: P(x) means there is at least one x such that P(x) is true. | ∃ n ∈ ℕ: n is even. | U+2203 | &#8707; | &exist; | $\exists$\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 | &#8707; | &exist; | $\exists$\exists |
| ∃! | uniqueness quantification | ∃! x: P(x) means there is exactly one x such that P(x) is true. | ∃! n ∈ ℕ: n + 5 = 2n. | U+2203 U+0021 | &#8707; &#33; | | $\exists !$\exists ! |
| ∃! | there exists exactly one | ∃! x: P(x) means there is exactly one x such that P(x) is true. | ∃! n ∈ ℕ: n + 5 = 2n. | U+2203 U+0021 | &#8707; &#33; | | $\exists !$\exists ! |
| ∃! | منطق الرتبة الأولى | ∃! x: P(x) means there is exactly one x such that P(x) is true. | ∃! n ∈ ℕ: n + 5 = 2n. | U+2203 U+0021 | &#8707; &#33; | | $\exists !$\exists ! |
| ≔ ≡ :⇔ | definition | 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 ≔ (1/2)(exp x + exp (−x)) A XOR B :⇔ (A ∨ B) ∧ ¬(A ∧ B) | U+2254 (U+003A U+003D) U+2261 U+003A U+229C | &#8788; (&#58; &#61;) &#8801; &#8860; | &equiv; &hArr; | $:=$:= $\equiv$\equiv$:\Leftrightarrow$:\Leftrightarrow |
| ≔ ≡ :⇔ | is defined as | 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 ≔ (1/2)(exp x + exp (−x)) A XOR B :⇔ (A ∨ B) ∧ ¬(A ∧ B) | U+2254 (U+003A U+003D) U+2261 U+003A U+229C | &#8788; (&#58; &#61;) &#8801; &#8860; | &equiv; &hArr; | $:=$:= $\equiv$\equiv$:\Leftrightarrow$:\Leftrightarrow |
| ≔ ≡ :⇔ | كل مكان | 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 ≔ (1/2)(exp x + exp (−x)) A XOR B :⇔ (A ∨ B) ∧ ¬(A ∧ B) | U+2254 (U+003A U+003D) U+2261 U+003A U+229C | &#8788; (&#58; &#61;) &#8801; &#8860; | &equiv; &hArr; | $:=$:= $\equiv$\equiv$:\Leftrightarrow$:\Leftrightarrow |
| ( ) | precedence grouping | 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; | | $(~)$ ( ) |
| ( ) | parentheses, brackets | 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; | | $(~)$ ( ) |
| ( ) | كل مكان | 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; | | $(~)$ ( ) |
| ⊢ | Turnstile | x ⊢ y means y is provable from x (in some specified formal system). | A → B ⊢ ¬B → ¬A | U+22A2 | &#8866; | | $\vdash$\vdash |
| ⊢ | provable | x ⊢ y means y is provable from x (in some specified formal system). | A → B ⊢ ¬B → ¬A | U+22A2 | &#8866; | | $\vdash$\vdash |
| ⊢ | حساب القضايا، منطق الرتبة الأولى | x ⊢ y means y is provable from x (in some specified formal system). | A → B ⊢ ¬B → ¬A | U+22A2 | &#8866; | | $\vdash$\vdash |
| ⊨ | double turnstile | x ⊨ y means x semantically entails y | A → B ⊨ ¬B → ¬A | U+22A8 | &#8872; | | $\vDash$\vDash, \models |
| ⊨ | entails | x ⊨ y means x semantically entails y | A → B ⊨ ¬B → ¬A | U+22A8 | &#8872; | | $\vDash$\vDash, \models |
| ⊨ | حساب القضايا، منطق الرتبة الأولى | x ⊨ y means x semantically entails y | A → B ⊨ ¬B → ¬A | U+22A8 | &#8872; | | $\vDash$\vDash, \models |

## انظر أيضا

* قائمة الرموز الرياضية.

## مراجع

* ↑ "Named character references". HTML 5.1 Nightly. W3C. مؤرشف من الأصل في 2016-01-28. اطلع عليه بتاريخ 2015-09-09.
* ↑ Although this character is available in LaTeX, the ميدياويكي TeX system does not support it.
عنتأبرز الرموز في المنطق :
∧  or  & و
∨ أو
¬  أو  ~ ليس
→ يقتضي
⊃ يقتضي, مجموعة فائقة
≡ إذا وفقط إذا
| اقتران سالب
∀ مكمم عام  $^{[لغاتأخرى]}$‏
∃ existential quantification
⊤ طوطولوجيا
⊥ خاطئ, تناقض
⊢ تستلزم, تثبت
⊨ تستلزم, إذن
∴ إذن
∵ لأن :
* بوابة رياضيات
* بوابة فلسفة
* بوابة منطق
* هذه بذرة مقالة عن الرياضيات او موضوع متعلق بها بحاجة للتوسيع. فضلًا شارك في تحريرها.