ⴰⴼⴰⵢⵍⵓ:Venn0001.svg

Size of this PNG preview of this SVG file: 384 × 280 ⵉⴷ ⴱⵉⴽⵙⵍ. ⵜⵉⴼⵙⴰⵢⵉⵏ: ⵢⴰⴹⵏ 320 × 233 ⵉⴷ ⴱⵉⴽⵙⵍ | 640 × 467 ⵉⴷ ⴱⵉⴽⵙⵍ | 1 024 × 747 ⵉⴷ ⴱⵉⴽⵙⵍ | 1 280 × 933 ⵉⴷ ⴱⵉⴽⵙⵍ | 2 560 × 1 867 ⵉⴷ ⴱⵉⴽⵙⵍ.

ⴰⴼⴰⵢⵍⵓ ⴰⵙⴰⵍⴰⵏ ‎(ⴰⴼⴰⵢⵍⵓ SVG, ⵙ 384 × 280 ⵉⴷ ⴱⵉⴽⵙⵍ, ⵜⵉⴷⴷⵉ ⵏ ⵓⴼⴰⵢⵍⵓ: 3 KB)

ⵉⴽⴽⴰ ⴷ ⵓⴼⴰⵢⵍⵓ ⴰ Wikimedia Commons. ⵉⵖⵢ ⴰⴷ ⵉⵜⵜⵓⵙⵎⵔⵙ ⴳ ⵉⵙⵏⴼⴰⵔⵏ ⵢⴰⴹⵏⵉⵏ. ⵢⵓⵎⵏ ⵓⴳⵍⴰⵎ ⴳ ⵜⴰⵙⵏⴰ ⵏ ⵓⴳⵍⴰⵎ ⵏ ⵓⴼⴰⵢⵍⵓ ⴳ ⴷⴷⴰⵡ ⴷⴰ.

ⴰⵙⴳⵣⵍ

ⴰⴳⵍⴰⵎVenn0001.svg	Intersection math
ⴰⵙⴰⴳⵎ	This file is lacking source information. Please edit this file's description and provide a source.
ⴰⵎⴳⴰⵢ	This file is lacking author information.
ⵜⵓⵔⴰⴳⵜ (ⵙⵙⵎⵔⵙ ⴷⴰⵖ ⴰⴼⴰⵢⵍⵓ ⴰ)	Public Domain
SVG genesis InfoField	The source code of this SVG is invalid due to 12 errors. This W3C-invalid icon was created with Inkscape …important.

One of 16 Venn diagrams, representing 2-ary Boolean functions like set operations and logical connectives:

Operations and relations in set theory and logic

∅^c

A = A

A^c

\scriptstyle \cup

B^c

true
^{A ↔ A}

A

\scriptstyle \cup

B

A

\scriptstyle \subseteq

B^c

A

\scriptstyle \Leftrightarrow

A

\scriptstyle \supseteq

B^c

A

\scriptstyle \cup

B^c

¬A

\scriptstyle \lor

¬B
^{A → ¬B}

A

\scriptstyle \Delta

B

A

\scriptstyle \lor

B
^{A ← ¬B}

A^c

\scriptstyle \cup

B

A

\scriptstyle \supseteq

B

A

\scriptstyle \Rightarrow

¬B

A = B^c

A

\scriptstyle \Leftarrow

¬B

A

\scriptstyle \subseteq

B

B^c

A

\scriptstyle \lor

¬B
^{A ← B}

A

\scriptstyle \oplus

B
^{A ↔ ¬B}

A^c

¬A

\scriptstyle \lor

B
^{A → B}

B

B = ∅

A

\scriptstyle \Leftarrow

B

A = ∅^c

A

\scriptstyle \Leftrightarrow

¬B

A = ∅

A

\scriptstyle \Rightarrow

B

B = ∅^c

¬B

A

\scriptstyle \cap

B^c

A

(A

\scriptstyle \Delta

B)^c

¬A

A^c

\scriptstyle \cap

B

\scriptstyle \Leftrightarrow

false

A

\scriptstyle \Leftrightarrow

true

A = B

A

\scriptstyle \Leftrightarrow

false

B

\scriptstyle \Leftrightarrow

true

A

\scriptstyle \land

¬B

A^c

\scriptstyle \cap

B^c

A

\scriptstyle \leftrightarrow

B

A

\scriptstyle \cap

B

¬A

\scriptstyle \land

B

A

\scriptstyle \Leftrightarrow

B

¬A

\scriptstyle \land

¬B

∅

A

\scriptstyle \land

B

A = A^c

false
^{A ↔ ¬A}

A

\scriptstyle \Leftrightarrow

¬A

These sets (statements) have complements (negations).
They are in the opposite position within this matrix.

These relations are statements, and have negations.
They are shown in a separate matrix in the box below.

more relations

The operations, arranged in the same matrix as above. The 2x2 matrices show the same information like the Venn diagrams. (This matrix is similar to this Hasse diagram.) In set theory the Venn diagrams represent the set, which is marked in red.	These 15 relations, except the empty one, are minterms and can be the case. The relations in the files below are disjunctions. The red fields of their 4x4 matrices tell, in which of these cases the relation is true. (Inherently only conjunctions can be the case. Disjunctions are true in several cases.) In set theory the Venn diagrams tell, that there is an element in every red, and there is no element in any black intersection.
Negations of the relations in the matrix on the right. In the Venn diagrams the negation exchanges black and red. In set theory the Venn diagrams tell, that there is an element in one of the red intersections. (The existential quantifications for the red intersections are combined by or. They can be combined by the exclusive or as well.)	Relations like subset and implication, arranged in the same kind of matrix as above. In set theory the Venn diagrams tell, that there is no element in any black intersection.

This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship.

ⴰⵎⵣⵔⵓⵢ ⵏ ⵓⴼⴰⵢⵍⵓ

ⴽⵍⵉⴽⵉ ⵖⴼ ⵓⵙⴰⴽⵓⴷ/ⴰⴽⵓⴷ ⵃⵎⴰ ⴰⴷ ⵜⵙⴽⵏⴷ ⴰⴼⴰⵢⵍⵓ ⵎⴰⵏⵎⴽ ⴰⴷ ⵢⴰⴷⵍⵍⵉ ⵉⴳⴰ ⴳ ⵡⴰⴽⵓⴷ ⴰⵏⵏ.

	ⴰⵙⴰⴽⵓⴷ/ⴰⴽⵓⴷ	ⵉⵎⵏⴰⴷⵏ	ⴰⵏⵙⵙⵎⵔⵙ	ⴰⵖⴼⴰⵡⴰⵍ
ⴰⵎⵉⵔⴰⵏ	00:14, 2 ⵎⴰⵕⵚ 2024	384 × 280 (3 KB)	Watchduck	cleaner code and lighter red (overwritten with Pywikibot)
	15:06, 26 ⵢⵓⵍⵢⵓⵣ 2009	384 × 280 (3 KB)	Watchduck
	15:05, 26 ⵢⵓⵍⵢⵓⵣ 2009	384 × 280 (3 KB)	Watchduck
	14:24, 26 ⵉⵏⵏⴰⵢⵔ 2008	615 × 463 (4 KB)	Watchduck	{{Information \|Description= \|Source=eigene arbeit \|Date= \|Author= Tilman Piesk \|Permission= \|other_versions= }}
	16:57, 22 ⵉⵏⵏⴰⵢⵔ 2008	615 × 463 (4 KB)	Watchduck	{{Information \|Description=Venn diagrams (sometimes called Johnston diagrams) concerning propositional calculus and set theory \|Source=own work \|Date=2008/Jan/22 \|Author=Tilman Piesk \|Permission=publich domain \|other_versions= }}
	15:26, 22 ⵉⵏⵏⴰⵢⵔ 2008	480 × 360 (3 KB)	Watchduck	{{Information \|Description= \|Source= \|Date= \|Author= \|Permission= \|other_versions= }}

ⴰⵙⵎⵔⵙ ⵏ ⵓⴼⴰⵢⵍⵓ

3 ⵜⴰⵙⵏⵉⵡⵉⵏ ⴰⴷ ⵙⵎⵔⵙⵏⵜ ⴰⴼⴰⵢⵍⵓ ⴰⴷ:

ⴰⵙⵎⵔⵙ ⴰⵖⵣⵓⵔⴰⵏ ⵏ ⵓⴼⴰⵢⵍⵓ

ⵉⵡⵉⴽⵉⵜⵏ ⴰⴷ ⵢⴰⴹⵏⵉⵏ ⴰⵔ ⵙⵙⵎⵔⵙⵏ ⴰⴼⴰⵢⵍⵓ ⴰⴷ:

ⴰⵙⵎⵔⵙ ⴳ als.wikipedia.org
- Menge (Mathematik)
- Mengenlehre
ⴰⵙⵎⵔⵙ ⴳ am.wikipedia.org
- ስብስብ
- የጋራ ስብስብ
ⴰⵙⵎⵔⵙ ⴳ anp.wikipedia.org
- समुच्चय सिद्धान्त
ⴰⵙⵎⵔⵙ ⴳ ar.wikipedia.org
ⴰⵙⵎⵔⵙ ⴳ ast.wikipedia.org
- Interseición de conxuntos
ⴰⵙⵎⵔⵙ ⴳ az.wikipedia.org
- Çoxluqlar nəzəriyyəsi
ⴰⵙⵎⵔⵙ ⴳ bar.wikipedia.org
- Grundlogn vo da Mathematik
ⴰⵙⵎⵔⵙ ⴳ ba.wikipedia.org
- Күмәклек
ⴰⵙⵎⵔⵙ ⴳ be-tarask.wikipedia.org
- Мноства
ⴰⵙⵎⵔⵙ ⴳ be.wikipedia.org
- Мноства
ⴰⵙⵎⵔⵙ ⴳ bg.wikipedia.org
ⴰⵙⵎⵔⵙ ⴳ bn.wikipedia.org
ⴰⵙⵎⵔⵙ ⴳ ca.wikipedia.org
ⴰⵙⵎⵔⵙ ⴳ ckb.wikipedia.org

ⵙⴽⵏ ⵓⴳⴳⴰⵔ ⵖⴼ ⵓⵙⵙⵎⵔⵙ ⴰⵎⴰⵜⴰⵢ ⵏ ⵓⴼⴰⵢⵍⵓ ⴰⴷ.

ⵎⵉⵜⴰⴷⴰⵜⴰ

ⴰⴼⵍⵓ ⴰ ⵢⵓⵎⴰ ⵉⵏⵖⵎⵉⵙⵏ ⵉⵎⵔⵏⴰⵏⵉⵏ, ⵉⵔⵡⴰⵙ ⵉⵙ ⴰⵙ ⵜⵜⵡⴰⵔⵏⵉⵏ ⵙ ⴽⴰⵎⵉⵔⴰ ⵜⴰⵎⵓⵟⵟⵓⵏⵜ ⵏⵖ ⴰⵙⴽⴰⵏⵉⵔ ⵉⵜⵜⵓⵙⵎⵔⵙⵏ ⴳ ⵓⵙⵏⴼⵍⵓⵍ ⵏⵏⵙ.

ⵎⴽ ⵉⵜⵜⵓⵙⵏⴼⵍ ⵓⴼⴰⵢⵍⵓ ⵙⴳ ⵡⴰⴷⴷⴰⴷ ⵏⵏⵙ ⴰⵙⴰⵍⴰⵏ, ⵖⵉⵢⵏ ⴽⵔⴰ ⵏ ⵉⴼⵔⵓⵔⵉⵜⵏ ⴰⴷ ⵓⵔ ⵜⵜⴰⵖⵓⵍⵏ ⵖⴼ ⵓⴼⴰⵢⵍⵓ ⵉⵏⵏⴼⵍⵏ.

Width	307.28000pt
Height	223.89000pt