In formal semantics, a predicate is quantized if it being true of an entity requires that it is not true of any proper subparts of that entity. For example, if something is an "apple", then no proper subpart of that thing is an "apple". If something is "water", then many of its subparts will also be "water". Hence, the predicate "apple" is quantized, while "water" is not.

Formally, a quantization predicate QUA can be defined as follows, where U {\displaystyle U} is the universe of discourse, F {\displaystyle F} is a variable over sets, and p {\displaystyle p} is a mereological part structure on U {\displaystyle U} with < p {\displaystyle <_{p}} the mereological part-of relation:

( F U p ) ( Q U A ( F ) ( x , y ) ( F ( x ) F ( y ) ¬ x < p y ) ) {\displaystyle (\forall F\subseteq U_{p})(QUA(F)\iff (\forall x,y)(F(x)\wedge F(y)\Rightarrow \neg x<_{p}y))}

Quantization was first proposed by Manfred Krifka as part of his mereological approach to the semantics of nominals. It has since been applied to other phenomena such as telicity.

See also

  • Fewer vs. less
  • Mass noun
  • Mereology
  • Telicity

References



What is Quantization Lightning AI

Quantization MIT HAN Lab

Quantization Overview

The Ultimate Guide To Deep Learning Model Quantizatio vrogue.co

Quantization explained in simple terms for working IT professionals