Docs / Studies / Studies.IoninMatushansky2006

The Composition of Complex Cardinals

Ionin, T. & Matushansky, O. (2006). Journal of Semantics, 23(4), 315–360

Ionin and Matushansky treat a simplex cardinal as a modifier of type ⟨⟨e,t⟩,⟨e,t⟩⟩: the cardinal n holds of a plurality with a partition into n cells that each satisfy its complement, and a partition is a Finpartition. Two hundred books is then iterated modification, so multiplication needs no rule of its own, in agreement with Hurford's PHRASE projection rule. The countability presupposition, that the complement denotes pluralities of a single size, is what makes n cells of k members count n * k. The predicate theory of cardinals fails as §2.2 says, and addition is coordination (§4).

Main definitions

  • cardMod: the cardinal as a modifier, (5) with the partitions of (6).
  • Equicardinal: the countability presupposition (23).
  • coordSem: coordination of xNPs (52).

Implementation notes

Pluralities are finite sets, and the atoms over a set S of individuals are its singletons, ({·} : α → Finset α) '' S. That the split reading excludes overlap, which the paper attributes to the maxim of Manner (§4.2.1), is the hypothesis of cardMod_union_of_disjoint.

References

Declarations

L53–56

Under predicate conjunction (12), two hundred books is contradictory, since no plurality has two members and a hundred.

theorem predicate_conjunction_contradictoryL58–61
{α : Type u_1} (x : Finset α) :
¬(x.card = 2 ∧ x.card = 100)

The cardinal as a modifier

L67–70
L72–75
L77–85

Hundred books (8) holds of the hundred-membered pluralities of books, since a cardinal over singletons counts members.

theorem cardMod_atoms_iffL87–99
{α : Type u_1} [DecidableEq α] (n : ℕ) (S : Set α) (x : Finset α) :
cardMod n (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) x ↔ x.card = n ∧ ↑x ⊆ S

Built from

Two hundred books (9) is iterated modification, which multiplies, so complex cardinals need no semantic rule beyond composition.

theorem cardMod_cardMod_atomsL101–111
{α : Type u_1} [DecidableEq α] {m : ℕ} (hm : m ≠ 0) (n : ℕ) (S : Set α) (x : Finset α) :
cardMod n (cardMod m fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) x ↔ x.card = n * m ∧ ↑x ⊆ S

Built from

Iterated modification computes Hurford's PHRASE projection rule, so [n m] books counts (Phrase.mul n m).value members.

theorem iterated_matches_phraseL113–119
{α : Type u_1} [DecidableEq α] {β : Type u_2} (v : β → ℕ) (n : Numeral.Number β) {m : β} (hm : v m ≠ 0) (S : Set α) (x : Finset α) :
cardMod (Numeral.Number.value v n) (cardMod (v m) fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) x ↔ x.card = Numeral.Phrase.value v (Numeral.Phrase.mul n m) ∧ ↑x ⊆ S

Built from

Under conjoined partition-based predicates (13), scaled to two four, a plurality of four satisfies both conjuncts, where the modifier reading demands eight.

theorem predicate_theory_undershootsL121–126
:
∃ (x : Finset (Fin 4)), cardMod 2 (fun (x : Finset (Fin 4)) => True) x ∧ cardMod 4 (fun (x : Finset (Fin 4)) => True) x ∧ x.card = 4

Built from

Addition as coordination

L130–132

On the full split (56b), coordination adds, so twenty books and two books holds of twenty-two books.

theorem cardMod_union_of_disjointL134–143
{α : Type u_1} [DecidableEq α] {S : Set α} {n m : ℕ} {y z : Finset α} (hd : Disjoint y z) (hy : cardMod n (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) y) (hz : cardMod m (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) z) :
cardMod (n + m) (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) (y ∪ z)

Built from

The joint reading (56a) is contradictory for distinct cardinals, since no plurality has n members and m.

theorem no_joint_readingL145–150
{α : Type u_1} [DecidableEq α] {S : Set α} {n m : ℕ} (hnm : n ≠ m) (x : Finset α) :
¬(cardMod n (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) x ∧ cardMod m (fun (x : Finset α) => x ∈ (fun (x : α) => {x}) '' S) x)

Built from