Boolean operators
Last updated
Last updated
The notation means that the pair (a,b) is in relation . This page defines when pair (a,b) is in relation (the intersection of and ), (the union of and ), (the difference of and ).
intersection : . In other words: if the pair is both in relation and , then it is in the intersection of and .
union : . In words: if the pair is in the relation or in , then it is in the union of and .
difference : . In other words, the term contains all pairs from that are not in .
The complement (or negation) of a relation is defined by means of the difference operator:
complement : If is defined as , then is the set of all tuples in (the Cartesian product) that are not contained in . So
Note that the complement is defined in terms of and . So, two relations with an identical population yet a different type may have different complements.
This page shows how you can type boolean (and other) operators in your Ampersand script.
Would you like a different explanation of the boolean operators? This page explains the boolean operators in terms of set theory.