首页> 外文会议>International Tbilisi symposium on logic, language, and computation >Whence Long-Distance Indefinite Readings? Solving Chierchia's Puzzle with Dependent Types
【24h】

Whence Long-Distance Indefinite Readings? Solving Chierchia's Puzzle with Dependent Types

机译:远距离不确定的读数从何而来?用依存类型解决Chierchia难题

获取原文

摘要

Indefinites (e.g. a man, some woman) have given rise to a number of puzzles concerning their scopal and dynamic behavior. One such puzzle about long-distance indefinites seems to be unsettled in the literature [3]. In this paper we show how Chierchia's puzzle of long-distance indefinites can be handled in semantics with dependent types. The proposal builds on our formal system combining generalized quantifiers [1,17,22] with dependent types [19,20,24] in [9,11].
机译:不定式(例如,男人,一些女人)引起了许多有关其骨和动态行为的困惑。关于长距离不定式的这样一个难题似乎在文献中尚未解决[3]。在本文中,我们展示了如何在依存类型的语义中处理Chierchia的长途不定难题。该建议建立在我们将广义量词[1,17,22]与[9,11]中的从属类型[19,20,24]相结合的正式系统的基础上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号