Archivo:Venn0011.svg

Tamaño de esta previsualización PNG del archivo SVG: 380 × 280 píxeles. Otras resoluciones: 320 × 236 píxeles · 640 × 472 píxeles · 1024 × 755 píxeles · 1280 × 943 píxeles · 2560 × 1886 píxeles.

Ver la imagen en su resolución original ‎((Imagen SVG, nominalmente 380 × 280 pixels, tamaño de archivo: 351 bytes))

Resumen

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.

Esta imagen no es elegible para estar sujeta a derecho de autor y por tanto está en el dominio público, porque consiste enteramente en información que es de propiedad común y carece de autoría original.

Historial del archivo

Haz clic sobre una fecha y hora para ver el archivo tal como apareció en ese momento.

	Fecha y hora	Dimensiones	Usuario	Comentario
actual	23:14 1 mar 2024	380 × 280 (351 bytes)	Watchduck	cleaner code and lighter red (overwritten with Pywikibot)
	20:50 24 jul 2023	380 × 280 (352 bytes)	SVG-image-maker	Redrew with a text editor
	14:08 26 jul 2009	384 × 280 (3 kB)	Watchduck
	13:26 26 ene 2008	615 × 463 (4 kB)	Watchduck	{{Information \|Description= \|Source=eigene arbeit \|Date= \|Author= Tilman Piesk \|Permission= \|other_versions= }}
	15:59 22 ene 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= }}