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

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

ⴰⵙⴳⵣⵍ

ⴰⴳⵍⴰⵎ Intersection math
ⴰⵙⴰⴳⵎ
ⴰⵎⴳⴰⵢ
ⵜⵓⵔⴰⴳⵜ
(ⵙⵙⵎⵔⵙ ⴷⴰⵖ ⴰⴼⴰⵢⵍⵓ ⴰ)
Public Domain

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

X or ¬X¬A or ¬BA or ¬B¬A or BA or B¬B¬AA xor BA xnor BAB¬A and ¬BA and ¬B¬A and BA and BX and ¬X

Operations and relations in set theory and logic

 
c
          
A = A
1111 1111
 
Ac  Bc
true
A ↔ A
 
 B
 
 Bc
AA
 
 
 Bc
1110 0111 1110 0111
 
 Bc
¬A  ¬B
A → ¬B
 
 B
 B
A ← ¬B
 
Ac B
 
A B
A¬B
 
 
A = Bc
A¬B
 
 
A B
1101 0110 1011 1101 0110 1011
 
Bc
 ¬B
A ← B
 
A
 B
A ↔ ¬B
 
Ac
¬A  B
A → B
 
B
 
B =
AB
 
 
A = c
A¬B
 
 
A =
AB
 
 
B = c
1100 0101 1010 0011 1100 0101 1010 0011
¬B
 
 
 Bc
A
 
 
(A  B)c
¬A
 
 
Ac  B
B
 
Bfalse
 
Atrue
 
 
A = B
Afalse
 
Btrue
 
0100 1001 0010 0100 1001 0010
 ¬B
 
 
Ac  Bc
 B
 
 
 B
¬A  B
 
AB
 
1000 0001 1000 0001
¬A  ¬B
 
 
 B
 
 
A = Ac
0000 0000
false
A ↔ ¬A
A¬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.



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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts ⵜⴰⵏⴳⵍⵉⵣⵜ

data size ⵜⴰⵏⴳⵍⵉⵣⵜ

2908 byte

height ⵜⴰⵏⴳⵍⵉⵣⵜ

280 pixel

width ⵜⴰⵏⴳⵍⵉⵣⵜ

384 pixel

media type ⵜⴰⵏⴳⵍⵉⵣⵜ

image/svg+xml

checksum ⵜⴰⵏⴳⵍⵉⵣⵜ

a85bb40a017725cd08586a1c770f055653854c0b

determination method or standard ⵜⴰⵏⴳⵍⵉⵣⵜ: SHA-1

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

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

ⴰⵙⴰⴽⵓⴷ/ⴰⴽⵓⴷⵜⴰⵡⵍⴰⴼⵜ ⵎⵥⵥⵉⵢⵏⵉⵎⵏⴰⴷⵏⴰⵏⵙⵙⵎⵔⵙⴰⵖⴼⴰⵡⴰⵍ
ⴰⵎⵉⵔⴰⵏ23:17, 28 ⵛⵓⵜⴰⵏⴱⵉⵔ 2024ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 23:17, 28 ⵛⵓⵜⴰⵏⴱⵉⵔ 2024410 × 299 (3 KB)WatchduckShade of red and thinner lines match other image sets.
16:10, 16 ⵢⵓⵍⵢⵓⵣ 2024ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 16:10, 16 ⵢⵓⵍⵢⵓⵣ 2024400 × 300 (613 bytes)Antonsusivalidizing, easier code
00:14, 2 ⵎⴰⵕⵚ 2024ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 00:14, 2 ⵎⴰⵕⵚ 2024384 × 280 (3 KB)Watchduckcleaner code and lighter red (overwritten with Pywikibot)
15:06, 26 ⵢⵓⵍⵢⵓⵣ 2009ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 15:06, 26 ⵢⵓⵍⵢⵓⵣ 2009384 × 280 (3 KB)Watchduck
15:05, 26 ⵢⵓⵍⵢⵓⵣ 2009ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 15:05, 26 ⵢⵓⵍⵢⵓⵣ 2009384 × 280 (3 KB)Watchduck
14:24, 26 ⵉⵏⵏⴰⵢⵔ 2008ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 14:24, 26 ⵉⵏⵏⴰⵢⵔ 2008615 × 463 (4 KB)Watchduck{{Information |Description= |Source=eigene arbeit |Date= |Author= Tilman Piesk |Permission= |other_versions= }}
16:57, 22 ⵉⵏⵏⴰⵢⵔ 2008ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 16:57, 22 ⵉⵏⵏⴰⵢⵔ 2008615 × 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ⴰⵙⵎⵥⵉ ⵏ ⵜⵍⵇⵇⵎⵜ ⴳ 15:26, 22 ⵉⵏⵏⴰⵢⵔ 2008480 × 360 (3 KB)Watchduck{{Information |Description= |Source= |Date= |Author= |Permission= |other_versions= }}

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

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

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

ⵎⵉⵜⴰⴷⴰⵜⴰ