Summary

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 ${\displaystyle \scriptstyle \cup }$ B c

true A ↔ A

A ${\displaystyle \scriptstyle \cup }$ B

A ${\displaystyle \scriptstyle \subseteq }$ B c

A ${\displaystyle \scriptstyle \Leftrightarrow }$ A

A ${\displaystyle \scriptstyle \supseteq }$ B c

A ${\displaystyle \scriptstyle \cup }$ B c

¬A ${\displaystyle \scriptstyle \lor }$ ¬B A → ¬B

A ${\displaystyle \scriptstyle \Delta }$ B

A ${\displaystyle \scriptstyle \lor }$ B A ← ¬B

A c ${\displaystyle \scriptstyle \cup }$ B

A ${\displaystyle \scriptstyle \supseteq }$ B

A ${\displaystyle \scriptstyle \Rightarrow }$ ¬B

A = B c

A ${\displaystyle \scriptstyle \Leftarrow }$ ¬B

A ${\displaystyle \scriptstyle \subseteq }$ B

B c

A ${\displaystyle \scriptstyle \lor }$ ¬B A ← B

A

A ${\displaystyle \scriptstyle \oplus }$ B A ↔ ¬B

A c

¬A ${\displaystyle \scriptstyle \lor }$ B A → B

B

B = ∅

A ${\displaystyle \scriptstyle \Leftarrow }$ B

A = ∅ c

A ${\displaystyle \scriptstyle \Leftrightarrow }$ ¬B

A = ∅

A ${\displaystyle \scriptstyle \Rightarrow }$ B

B = ∅ c

¬B

A ${\displaystyle \scriptstyle \cap }$ B c

A

(A ${\displaystyle \scriptstyle \Delta }$ B) c

¬A

A c ${\displaystyle \scriptstyle \cap }$ B

B

B ${\displaystyle \scriptstyle \Leftrightarrow }$ false

A ${\displaystyle \scriptstyle \Leftrightarrow }$ true

A = B

A ${\displaystyle \scriptstyle \Leftrightarrow }$ false

B ${\displaystyle \scriptstyle \Leftrightarrow }$ true

A ${\displaystyle \scriptstyle \land }$ ¬B

A c ${\displaystyle \scriptstyle \cap }$ B c

A ${\displaystyle \scriptstyle \leftrightarrow }$ B

A ${\displaystyle \scriptstyle \cap }$ B

¬A ${\displaystyle \scriptstyle \land }$ B

A ${\displaystyle \scriptstyle \Leftrightarrow }$ B

¬A ${\displaystyle \scriptstyle \land }$ ¬B

∅

A ${\displaystyle \scriptstyle \land }$ B

A = A c

false A ↔ ¬A

A ${\displaystyle \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 .