Helping when the desire is low: Expectancy as a booster

Motivation and Emotion - One might assume that the desire to help (here described as Want) is the essential driver of helping declarations and/or behaviors. However, even if desire to help (Want)...     

Discrete Dualities for Double Stone Algebras

We present two discrete dualities for double Stone algebras. Each of these dualities involves a different class of frames and a different definition of a complex algebra. We discuss relationships between these classes of frames and show that one of them is a weakening of the other. We propose a logic based on double Stone algebras.     

Correlations of spaces of pencils

The paper introduces an axiomatic system of a conjugacy in partial linear spaces, and provides its analytical characterization in spaces of pencils. A correlation of a space of pencils is defined and it is shown to correspond to a polarity of the underlying projective space, i.e. to a reflexive sesqui-linear form, or also to an involutory collineation, i.e. to an injective semi-linear map, in the self-dual case. A geometric characterization of segment subspaces in spaces of pencils is also provided.     

Logic of nondeterministic information

In the paper we define a class of languages for representation o knowledge in those application areas when a complete information about a domain is not available. In the languages we introduce modal operators determined by accessibility relations depending on parameters.     

Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus

We present a general framework for proof systems for relational theories. We discuss principles of the construction of deduction rules and correspondences reflecting relationships between semantics of relational logics and the rules of the respective proof systems. We illustrate the methods developed in the paper with examples relevant for the Lambek calculus and some of its extensions.     

“When the going gets tough,the tough get going”: Motivation towards closure and effort investment in the performance of cognitive tasks

Previous studies have demonstrated that the need for closure (NFC), which refers to an individual’s aversion toward uncertainty and the desire to quickly reduce it, leads to reluctance to invest effort in judgments and decision making. However, we argue that NFC may lead to either an increase or a decrease in effort depending on the availability of easy vs. difficult means to achieve closure and perceived importance of the task goal. We found that when closure could be achieved via both less and more demanding means, NFC was associated with decreased effort unless the task was perceived as important (Study 1). However, when attaining closure was possible via demanding means only, NFC was associated with increased effort, regardless of the task importance (Study 2). Moreover, NFC was related to choosing a more instrumental strategy for the goal of closure, even if this strategy required effort (Study 3). The results are discussed in the light of cognitive energetics theory.