Docs / Semantics / Mereology / Classical

Classical mereology

import Linglib.Semantics.Mereology.Classical · namespace Mereology

Classical extensional mereology is a strongly supplemented part structure in which every inhabited predicate has a sum, which is to say a unique sum. Its sums are its least upper bounds, a proper part has a unique remainder and two overlapping individuals have a product. A complete Boolean algebra is a classical mereology whose null individual is its bottom, and the non-null individuals of a classical mereology form one with no null individual, as the nonempty subsets of a set do. Conversely a classical mereology with a null individual is a complete Boolean algebra, and one without becomes one when a null individual is added.

Implementation notes

Classical mereology is defined by strong supplementation and unrestricted sums; the definition by unique sums of Champollion's book is a theorem, and Hovda compares the axiomatizations. A carrier may have a null individual: the sources' systems are the classical mereologies with NoBotOrder. The one-point carrier, whose individual is null, is a classical mereology.

References

Declarations

L40–44
L71–73
L75–76
L78–89
L91–98
L106–112

The generalized sum

L116–118
L122
L124
L128
L130
L132–133
L156–161

Boolean algebras and non-null individuals

L170–173
L175–177
L199–213

The Boolean representation

A classical mereology with a null individual is a complete Boolean algebra, and adding a null individual to a classical mereology without one gives a classical mereology, so the classical mereologies without a null individual are the complete Boolean algebras with the bottom removed.

L287–317