首页> 外文会议>New frontiers in artificial intelligence >Derived Nominals and Concealed Propositions
【24h】

Derived Nominals and Concealed Propositions

机译:衍生名词和隐含命题

获取原文
获取原文并翻译 | 示例

摘要

Vendler described derived nominals (DNs) like the collapse/ing of the Germans as ambiguous between event denoting expressions and proposition denoting expressions. DNs can combine with event-selecting predicates (1a), like gradual, which bona fide propositional that-clauses or fact-denoting expressions cannot (1c), and have event-readings, ((1a) can be paraphrased as 'the event of the Germans collapsing was gradual'.) DNs can also combine with proposition-selecting predicates like aware of (2a) which always also allow finite complements (2b) and, in such cases, have propositional readings-(2a) and (2b) are synonymous. We call DNs in the latter cases Concealed Propositions (ConPs), and we defend the idea that they are analogous in important respects to concealed questions (CQs).1 Here we argue against Vendler's Ambiguity Hypothesis (3) and defend an analysis of DNs in which they uniformly denote (or quantify over) events. In doing so, we overcome a challenge, discovered by Zucchi , to the unambiguous event approach, and provide an analysis to both definite and quantified DNs. We show that a copy-theoretic account overcomes the problem and aligns ConPs with concealed questions (CQs) in the analysis of Frana.
机译:温德勒将派生名词(DNs)形容为事件表示和命题表示之间的模棱两可,例如德意志人的崩溃/崩溃。 DN可以与事件选择谓词(1a)结合使用,例如渐进式谓词,其真正的命题子句或事实表示表达式不能(1c),并且具有事件读数,((1a)可以解释为“ DN也可以与命题选择谓词结合使用,例如意识到(2a),它们也总是允许有限补语(2b),并且在这种情况下,命题读数为-(2a)和(2b)是同义。在后一种情况下,我们将DN称为隐性命题(ConPs),我们捍卫它们在重要方面与隐性问题(CQ)类似的观点。1这里,我们反对Vendler的歧义假说(3),并捍卫对DN的分析。他们统一地表示(或量化)事件。通过这样做,我们克服了Zucchi发现的针对明确事件方法的挑战,并提供了对确定的和量化的DN的分析。我们显示,复制理论的帐户可以解决问题,并在Frana的分析中使ConP与隐藏的问题(CQ)保持一致。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号