最后通牒游戏中接收者拒绝行为的情绪义务模型

公平偏好使人们在面对不公平的分配时通常会有所表示,在最后通牒游戏中具体表现为对不公平报价的拒绝,有很多研究把拒绝的原因归结为不公平厌恶和互惠主义等社会偏好,但这并不能解释一些最后通牒变体游戏中的拒绝行为。但这恰恰支持了情绪义务模型。     

Combining classical logic, paraconsistency and relevance

We present a logic with has both a simple semantics and a cut-free Gentzen-type system on one hand, and which combines relevance logics, da Costa's paraconsistent logics, and classical logic on the other. We further show that the logic has many other nice properties, and that its language is ideal from the semantic point of view.     

公平加工的情境依赖性：来自ERP的证据

公平是人类社会生活的重要概念。大量研究采用最后通牒博弈, 发现人们具有不公平厌恶倾向, 即宁愿牺牲个人的经济利益, 也要拒绝不公平的分配提议。已有研究表明, 损失情境会增强不公平厌恶, 但其神经机制尚不清楚。本实验采用ERP技术, 运用最后通牒博弈范式, 考察两个情境因素：域(损失或获益)和博弈对象(人或计算机)对公平加工的影响。发现损失域下对不公平分配的拒绝率更高, 而博弈对象对决策行为无影响; 获益域下, 对家为人比对家为计算机诱发了更负的N1; 人机博弈时, 获益域比损失域诱发了更大的P2和LPP, 损失域比获益域、不公平提议比公平提议诱发了更大的N350, 而公平提议比不公平提议诱发了更大的LPP; 人际博弈时, 这些差异均不显著。这些结果表明, 对分配提议的大脑加工受博弈对象的调节, 人际博弈时, 对损益域、公平与不公平提议的加工类似, 而人机博弈时, 损失域和不公平提议涉及更多的抑制加工和冲突解决, 获益域和公平提议则更富动机性意义, 证实公平加工具有情境依赖性。     

汉语句子加工中句法信息与语义信息的交互作用：来自ERP的证据

采用ERP技术考察句子加工过程中句法信息和语义信息交互作用的时间进程。以汉语“把字句”为实验材料,分别比较句法违例句与双重违例句的LAN和P600效应、语义违例句与双重违例句的N400效应。与句法违例句相比,双重违例句的LAN效应的波幅更负,潜伏期更长,皮层分布更广泛;双重违例句的P600效应出现减弱趋势;双重违例句的N400效应的潜伏期显著长于语义违例句。结果表明,在句子加工的各个阶段,句法信息和语义信息呈持续交互作用,支持句子的平行加工模型。     

Proto-Semantics for Positive Free Logic

This paper presents a bivalent extensional semantics for positive free logic without resorting to the philosophically questionable device of using models endowed with a separate domain of non-existing objects. The models here introduced have only one (possibly empty) domain, and a partial reference function for the singular terms (that might be undefined at some arguments). Such an approach provides a solution to an open problem put forward by Lambert, and can be viewed as supplying a version of parametrized truth non unlike the notion of truth at world found in modal logic. A model theory is developed, establishing compactness, interpolation (implying a strong form of Beth definability), and completeness (with respect to a particular axiomatization).     

First Order Common Knowledge Logics

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies.     

On Intermediate Predicate Logics of some Finite Kripke Frames,I. Levelwise Uniform Trees

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.     

Consensus effects in categorization decisions

A previous study (Gilat et al., J. Exp. Psychol. Appl. 3 (1997) 83) has shown that the incentive to reach consensus can raise the tendency to rely on base rates in signal detection decisions and can reduce the probability that less likely events will be accurately classified. This phenomenon was named the “consensus effect”. The current study assesses the conditions under which this effect develops and in particular the effects of information about the game and of the incentive structure on the learning process. The results of three experiments show that the learning process slows when participants have information about the actual state of nature. This finding is captured by a reinforcement learning model with the assumption that information narrows the distribution of the initial propensities for choosing among cutoffs. The results are further evidence for the utility of the combination of learning models and analyses of cognitive processes for the prediction of decision making in situations involving multiple players.     

Algebraic Kripke Sheaf Semantics for Non-Classical Predicate Logics

In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic.