In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and proof-theoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a model-theoretic way and then the semantic representations can be understood inferentially in a proof-theoretic way. Considered in this way, MTTs arguably have unique advantages when employed for formal semantics.
|Title of host publication||Logical Aspects of Computational Linguistics|
|Subtitle of host publication||8th International Conference, LACL 2014, Toulouse, France, June 18-24, 2014. Proceedings|
|Editors||Nicholas Asher, Sergei Soloviev|
|Number of pages||12|
|Publication status||Published - 2014|
|Name||Lecture Notes in Computer Science|