Docs / Semantics / Mereology / Sum

Sums and the principles of part structures

import Linglib.Semantics.Mereology.Sum · namespace Mereology

A sum of a predicate, in Tarski's sense, is a bound of its members each of whose non-null parts overlaps one of them. It overlaps exactly what its members overlap, which is the other definition of sum in use, and the two definitions agree in a part structure that is strongly supplemented: whatever is not part of y has a non-null part that does not overlap y. There a sum is a least upper bound, so a predicate has at most one. Three further principles are stated here: the product of two overlapping individuals, the remainder of a proper part in a whole, and that a binary join is a sum. Boolean algebras satisfy all four. Closure of a predicate under the sums of its inhabited subpredicates is cumulative reference in its general form, and the predicates so closed are the fixed points of algebraic closure under arbitrary sums, which on a finite predicate is closure under binary sums.

Implementation notes

The second clause of a sum ranges over non-null parts, as Overlap relates non-null parts. On a carrier without a null individual this is Tarski's definition; on a carrier with one, his definition holds of nothing, since the null individual overlaps nothing, and the present one holds of least upper bounds in a Boolean algebra. The sources state the remainder principle with uniqueness; the results that use it need only existence.

References

Declarations

L40–43

Sums

L51–54
L56–58
L65–71

Strong supplementation, products and remainders

L77–80
L86–90
L92–96
L104–109
L113–118
L120–123
L125–128
L130–135
L143–144
L161–168
L170–171

Closure under sums

L184–187
L194–195
L197–203

A predicate is closed under sums iff its closure under sums adds nothing to it, as the plural of a cumulative mass noun adds nothing.

theorem sumClosed_iffL205–208
{α : Type u_1} [PartialOrder α] {P : α → Prop} :
SumClosed P ↔ ∀ (x : α), SumClosure P x → P x

Built from ,

L216–218
L220–223
L225–234