Deontic and epistemic reasoning in children

It is widely accepted that adults show an advantage for deontic over epistemic reasoning. Two published studies (Cummins, 1996b; Harris and Núñez, 1996, Experiment 4) found evidence of this “deontic advantage” in preschool-aged children and are frequently cited as evidence that preschoolers show the same deontic advantage as adults. However, neither study has been replicated, and it is not clear from either study that preschoolers were showing the deontic advantage under the same conditions as adults. The current research investigated these issues. Experiment 1 attempted to replicate both Cummins’s and Harris and Núñez’s studies with 3- and 4-year-olds (N = 56), replicating the former with 4-year-olds and the latter with both 3- and 4-year-olds. Experiment 2 modified Cummins’s task to remove the contextual differences between conditions, making it more similar to adult tasks, finding that 4-year-olds (n = 16) show no evidence of the deontic advantage when no authority figure is present in the deontic condition, whereas both 7-year-olds (n = 16) and adults (n = 28) do. Experiment 3 removed the authority figure from the deontic condition in Harris and Núñez’s task, again finding that 3- and 4-year-olds (N = 28) show no evidence of the deontic advantage under these conditions. These results suggest that for preschoolers, the deontic advantage is reliant on particular contextual cues such as the presence of an authority figure, in the deontic condition. By 7 years of age, however, children are reasoning like adults and show evidence of the advantage when no such contextual cues are present.     

A logic for deontic dilemmas

The possibility of deontic dilemmas poses a significant problem for deontic logic. Here I review some proposals to resolve this problem, and then offer a new account. This is a simple modification of standard deontic logic that enables the system to accommodate deontic dilemmas without inconsistency and without deontic explosion, while at the same time accounting for the range of genuinely valid inferences.     

话务员成就目标与工作倦怠关系的研究

目的:探讨话务员成就目标与工作倦怠的关系。方法:采用修订的成就目标量表、工作倦怠量表调查270名移动一线话务员。结果:1.掌握目标取向与负性的情绪耗竭以及玩世不恭存在显著负相关,而与成就动机存在显著正相关;2.表现趋向以及表现回避与情绪耗竭、玩世不恭存在显著正相关,与成就动机存相关系数不显著;3.掌握目标取向负向预测情绪耗竭以及玩世不恭,而正向预测成就动机,而表现回避正向预测情绪耗竭和玩世不恭。结论:掌握目标取向的个体感受的倦怠程度越低,而表现回避和表现趋向的得分越高的个体感受职业倦怠程度越高。     

Logical dynamics of some speech acts that affect obligations and preferences

In this paper, illocutionary acts of commanding will be differentiated from perlocutionary acts that affect preferences of addressees in a new dynamic logic which combines the preference upgrade introduced in DEUL (dynamic epistemic upgrade logic) by van Benthem and Liu with the deontic update introduced in ECL II (eliminative command logic II) by Yamada. The resulting logic will incorporate J. L. Austin’s distinction between illocutionary acts as acts having mere conventional effects and perlocutionary acts as acts having real effects upon attitudes and actions of agents, and help us understand why saying so can make it so in explicit performative utterances. We will also discuss how acts of commanding give rise to so-called “deontic dilemmas” and how we can accommodate most deontic dilemmas without triggering so-called “deontic explosion”.     

Substantive and procedural norms in normative multiagent systems

Procedural norms are instrumental norms addressed to agents playing a role in the normative system, for example to motivate these role playing agents to recognize violations or to apply sanctions. Procedural norms have first been discussed in law, where they address legal practitioners such as legislators, lawyers and policemen, but they are discussed now too in normative multiagent systems to motivate software agents. Procedural norms aim to achieve the social order specified using regulative norms like obligations and permissions, and constitutive norms like counts-as obligations. In this paper we formalize procedural, regulative and constitutive norms using input/output logic enriched with an agent ontology and an abstraction hierarchy. We show how our formalization explains Castelfranchi's notion of mutual empowerment, stating that not only the agents playing a role in a normative system are empowered by the normative system, but the normative system itself is also empowered by the agents playing a role in it. In our terminology, the agents are not only institutionally empowered, but they are also delegated normative goals from the system. Together, institutional empowerment and normative goal delegation constitute a mechanism which we call delegation of power, where agents acting on behalf of the normative system become in charge of recognizing which institutional facts follow from brute facts.     

Remarks on Gregory's “Actually” Operator

In this note we show that the classical modal technology of Sahlqvist formulas gives quick proofs of the completeness theorems in [8] (D. Gregory, Completeness and decidability results for some propositional modal logics containing actually operators, Journal of Philosophical Logic 30(1): 57–78, 2001) and vastly generalizes them. Moreover, as a corollary, interpolation theorems for the logics considered in [8] are obtained. We then compare Gregory's modal language enriched with an actually operator with the work of Arthur Prior now known under the name of hybrid logic. This analysis relates the actually axioms to standard hybrid axioms, yields the decidability results in [8], and provides a number of complexity results. Finally, we use a bisimulation argument to show that the hybrid language is strictly more expressive than Gregory's language.     

Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators

The addition of actually operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing actually operators has concentrated entirely upon extensions of KT5 and has employed a particular model-theoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing actually operators, the weakest of which are conservative extensions of K, using a novel generalisation of the standard semantics.     

Stochastic λ-calculi: An extended abstract

It is shown how the operators in the “graph model” for λ-calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for “random combinators”. The result then is a model for a new language for random algorithms.     

含有新算符的代数运算规则学习的有效样例设计

为了探索含有新算符的代数运算规则学习的有效样例设计方式,分别采用“转换标记法”和“解释法”设计“指-对数转换”运算和对数运算的样例,考察了初中三年级学生代数运算规则样例学习的迁移效果。结果显示：(1)采用“转换标记法”设计的样例可以明显提高“指-对数转换”规则样例学习的迁移效果;(2)采用“解释法”设计的运算样例,能够明显促进“对数运算规则”的样例学习迁移效果,并与被试的基础知识有关。