arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.01075cs.AImath.LO
收藏

分类推理、概率随附性与规则制定

Classificatory Sorites, Probabilistic Supervenience, and Rule-Making

University of Connecticut(康涅狄格大学);Purdue University(普渡大学)

Damir D. Dzhafarov, Ehtibar N. Dzhafarov

摘要:

我们认为刺激作用于一个系统,并唤起这个系统的反应。对刺激的反应的随附性意味着它们要么缺乏耐受性(即,它们在某些刺激的每个邻近区域都发生变化),或者刺激并不总是通过连续成员"非常相似“的有限刺激链连接起来。如果随附性不成立,容忍性和连通性的性质就不能被公式化,因此严格序列就不能被构造。我们假设,在经验系统(如人回答问题)的随附性从根本上是概率。对刺激的反应概率的随附性是稳定的,从这个意义上说,“高阶”概率分布总是可以简化为“普通”概率分布。在制定哪些刺激应该对应于哪些反应的规则时,批判情境中选择的主要特征是它们的任意性。我们认为,任意性对经典逻辑没有任何问题。

英文摘要:

We view sorites in terms of stimuli acting upon a system and evoking this system's responses. Supervenience of responses on stimuli implies that they either lack tolerance (i.e., they change in every vicinity of some of the stimuli), or stimuli are not always connectable by finite chains of stimuli in which successive members are `very similar'. If supervenience does not hold, the properties of tolerance and connectedness cannot be formulated and therefore soritical sequences cannot be constructed. We hypothesize that supervenience in empirical systems (such as people answering questions) is fundamentally probabilistic. The supervenience of probabilities of responses on stimuli is stable, in the sense that `higher-order' probability distributions can always be reduced to `ordinary' ones. In making rules about which stimuli ought to correspond to which responses, the main characterization of choices in soritical situations is their arbitrariness. We argue that arbitrariness poses no problems for classical logic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑