Docs / Studies / Studies.Kiparsky1998

Partitive Case and Aspect

Kiparsky, P. (1998). In The Projection of Arguments: Lexical and Compositional Factors (pp. 265–307). CSLI Publications

This file formalizes Kiparsky's account of the Finnish partitive object: partitive case licenses unboundedness of the verb phrase. A predicate is unbounded if it is divisive, cumulative and not diverse, the first two relative to atoms and suprema; a verb phrase is unbounded if its verb or its object is, and the object of an unbounded verb phrase is partitive. Diversity is Krifka's quantization, Krifka's mass reference is unbounded, and the bounded quantities are bounded for the reasons Kiparsky gives, bare plurals being unbounded only on the inclusive reading. The case rule derives the acceptability of the paper's paradigm from the boundedness of the objects' denotations, which classing the verbs by resultativity fails.

Implementation notes

  • Page numbers follow the manuscript; example numbers are the paper's.
  • The verbs' boundedness is the paper's lexical classification; the objects' is computed in a model of four individuals, whose null individual no predicate contains.
  • 'Few' and 'many' are pluralities of at most two and at least three individuals.
  • The paradigm does not separate unboundedness from non-quantization, which fits it as well.

TODO

  • The partitive subjects of presentational verbs, and the coercion of bounded predicates.

References

Boundedness

L78–83
L105–106
L108
L110
L112

Quantities

L128–129

The bounded quantities of (37b) are bounded for the reasons the paper gives: bare plurals are unbounded, few is divisive but not cumulative, many cumulative but not divisive, two neither, and the cardinal and definite quantities are diverse.

theorem classificationL155–166
:
(IsUnbounded fun (x : Finset (Fin 4)) => x ∈ bears) ∧ ((IsDivisive fun (x : Finset (Fin 4)) => x ∈ fewBears) ∧ ¬IsCumulative fun (x : Finset (Fin 4)) => x ∈ fewBears) ∧ ((IsCumulative fun (x : Finset (Fin 4)) => x ∈ manyBears) ∧ ¬IsDivisive fun (x : Finset (Fin 4)) => x ∈ manyBears) ∧ ((¬IsDivisive fun (x : Finset (Fin 4)) => x ∈ twoBears) ∧ ¬IsCumulative fun (x : Finset (Fin 4)) => x ∈ twoBears) ∧ (IsDiverse fun (x : Finset (Fin 4)) => x ∈ aBear) ∧ (IsDiverse fun (x : Finset (Fin 4)) => x ∈ theBear) ∧ (IsDiverse fun (x : Finset (Fin 4)) => x ∈ twoBears) ∧ (IsDiverse fun (x : Finset (Fin 4)) => x ∈ theTwoBears) ∧ IsDiverse fun (x : Finset (Fin 4)) => x ∈ theBears

Built from , , , , , , , , , , ,

L174–176

The case of the object

L197–201
L209–217
L226–228