Inclusion (logic) explained

In logic and mathematics, inclusion is the concept that all the contents of one object are also contained within a second object.^[1]

For example, if m and n are two logical matrices, then

m \subset n when \forall i,j m _{ij} = 1 \implies n _{ij} = 1 .

The modern symbol for inclusion first appears in Gergonne (1816), who defines it as one idea 'containing' or being 'contained' by another, using the backward letter 'C' to express this. Peirce articulated this clearly in 1870, arguing also that inclusion was a wider concept than equality, and hence a logically simpler one.^[2] Schröder (also Frege) calls the same concept 'subordination'.^[3]

Notes and References

1. 10.2307/2268279 . . 2 . 4 . December 1937 . 145–152 . Logic based on inclusion and abstraction . W. V. . Quine . 2268279 .
2. "Descr. of a notation", CP III 28.
3. Vorlesungen I., 127.