Quantization (linguistics)

From testwiki
Revision as of 02:14, 7 March 2023 by imported>Citation bot (Add: isbn, pages. | Use this bot. Report bugs. | Suggested by Superegz | Category:Grammar‎ | #UCB_Category 55/210)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.[1][2]

Formally, a quantization predicate QUA can be defined as follows, where U is the universe of discourse, F is a variable over sets, and p is a mereological part structure on U with <p the mereological part-of relation:[1][2]

(FUp)(QUA(F)(x,y)(F(x)F(y)¬x<py))

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

References

Template:Reflist

Template:Formal semantics


Template:Semantics-stub