The many faces of counts-as: A formal analysis of constitutive rules

The paper proposes a logical systematization of the notion of counts-as which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., forms of classification. Moving from this analytical thesis the paper disentangles three semantically different readings of statements of the type “X counts as Y in context c”, from the weaker notion of contextual classification to the stronger notion of constitutive rule. These many ways in which counts-as can be said are formally addressed by making use of modal logic techniques. The resulting framework allows for a formal characterization of all the involved notions and their reciprocal logical relationships.     

Effortful control, executive attention, and emotional regulation in 7–10-year-old children

In this study, self-regulation was investigated in 7- to 10-year-old children using three different measures: (1) parent and child report questionnaires measuring temperamental effortful control, (2) a conflict task assessing efficiency of executive attention, and (3) the mistaken gift paradigm assessing social smiling in response to an undesirable gift. Both efficiency in executive attention and smiling to the undesired gift increased over age. Executive attention was related to both parent-reported temperamental effortful control and smiling, suggesting links between attentional capacities, broad temperament measures, and social situations requiring attentional control.     

On the Logic of β-pregroups

In this paper we concentrate mainly on the notion of β-pregroups, which are pregroups (first introduced by Lambek [18] in 1999) enriched with modality operators. β-pregroups were first proposed by Fadda [11] in 2001. The motivation to introduce them was to limit (locally) the associativity in the calculus considered. In this paper we present this new calculus in the form of a rewriting system, prove the very important feature of this system - that in a given derivation the non-expanding rules must always proceed non-contracting ones in order the derivation to be minimal (normalization theorem). We also propose a sequent system for this calculus and prove the cut elimination theorem for it. As an illustration we show how to use β-pregroups for linguistical applications. Special Issue Categorial Grammars and Pregroups Edited by Wojciech Buszkowski and Anne Preller     

What ends a worry bout? An analysis of changes in mood and stop rule use across the catastrophising interview task

This paper reports the results of two experiments designed to test predictions from the mood-as-input hypothesis about the factors that contribute to the ending of a worry bout. Experiment 1 looked at changes in self-reported mood across a catastrophising interview task. Experiment 2 investigated whether there were any changes in stop rule deployment between the beginning and end of a catastrophising interview task. Experiment 1 demonstrated that worriers tended to show increases in negative mood and decreases in positive mood over the course of catastrophising. In Experiment 2, participants exhibited a significant shift away from endorsing the use of 'as many as can' stop rules and a significant increasing tendency to endorse the use of 'feel like continuing' stop rules over the course of catastrophising. These results suggest that worriers exhibit increases in negative mood across the worry bout, but shift from the use of 'as many as can' to 'feel like continuing' stop rules. Mood-as-input hypothesis predicts that if high worriers ask the question "do I feel like continuing?" in the context of increasing negative mood, this will imply that the activity is no longer enjoyable or profitable and should be terminated. The results are discussed in the context of mood-as-input accounts of pathological worrying and the therapeutic implications of these findings are reviewed.     

Pure Extensions, Proof Rules, and Hybrid Axiomatics

In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity).We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this requires the use of non-orthodox rules. We discuss these rules in detail and prove non-eliminability and eliminability results. We also show how another type of rule, which reflects the structure of the strong Priorean language, can be employed to give an even wider coverage of frame classes. We show that this deductive apparatus gets progressively simpler as we work our way up the expressivity hierarchy, and conclude the paper by showing that the approach transfers to first-order hybrid logic.A preliminary version of this paper was presented at the fifth conference on Advances in Modal Logic (AiML 2004) in Manchester. We would like to thank Maarten Marx for his comments on an early draft and Agnieszka Kisielewska for help with the proof reading.Special Issue Ways of Worlds II. On Possible Worlds and Related Notions Edited by Vincent F. Hendricks and Stig Andur Pedersen     

Cut-Elimination and Quantification in Canonical Systems

Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to rules with unary quantifiers and show that it remains constructive. Then we provide semantics for such canonical systems using 2-valued non-deterministic matrices extended to languages with quantifiers, and prove that the following properties are equivalent for a canonical system G: (1) G admits Cut-Elimination, (2) G is coherent, and (3) G has a characteristic 2-valued non-deterministic matrix.     

Thomas Aquinas on Virtuous Warfare

Thomas Aquinas, one of the founding fathers of just war theory, offers an account of virtuous warfare in practice. The author argues that Aquinas's approach to warfare, with its emphasis on justice and charity, is helpful in providing a coherent moral account of war to which Christians can subscribe. Particular attention is given to the role of charity, since this virtue is the distinguishing characteristic of the Christian soldier. Charity compels him to soldier justly, and by fighting justly, he is elevated by God to friendship with God. Notable features of this approach are its emphasis on the criteria for judging whether a war is just and its relativizing of the criteria for proper combat behavior.     

Detection of counting pseudoerrors: What helps children accept them?

This study examines children's comprehension of non‐essential counting features (conventional rules). The objective of the study was to determine whether the presence or absence of cardinal values in pseudoerrors and the type of conventional rule violated affects children's performance. A detection task with pseudoerrors was presented through a computer game to 146 primary school children in grades 2 through 4. The same pseudoerrors were presented both with and without cardinal values; the pseudoerrors violated conventional rules of spatial adjacency, temporal adjacency, spatial–temporal adjacency, and left‐to‐right direction. Half of the participants within each age group were randomly assigned to an experimental condition that included pseudoerrors with a cardinal value, and the other half were assigned to a condition that included pseudoerrors without a cardinal value. The results show that when presented with a cardinal value, children more easily recognize the optional nature of non‐essential counting features. Likewise, the type of conventional rule transgressed significantly affected the children's acceptance of pseudoerrors as valid counts. Participants penalized breaches of temporal and spatial–temporal adjacency to a greater degree than breaches of spatial adjacency and left‐to‐right direction.     

Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations

This paper is devoted to the study of techniques allowing one to rank order the elements of a finite set on the basis of a non-necessarily complete or transitive binary relation. In the area of MCDM, such a problem occurs with outranking methods. We review a number of theoretical results concerning this problem and show how they may be useful in order to guide the choice of a particular technique. © 1997 John Wiley & Sons, Ltd.