The criterion-related validity of conscientiousness in personnel selection: A meta-analytic reality check

A key finding in personnel selection is the positive correlation between conscientiousness and job performance. Evidence predominantly stems from concurrent validation studies with incumbent samples but is readily generalized to predictive settings with job applicants. This is problematic because the extent to which faking and changes in personality affect the measurement likely vary across samples and study designs. Therefore, we meta-analytically investigated the relation between conscientiousness and job performance, examining the moderating effects of sample type (incumbent vs. applicant) and validation design (concurrent vs. predictive). The overall correlation of conscientiousness and job performance was in line with previous meta-analyses ($\overline{r}=.17,k=102,n=23,305$). In our analyses, the correlation did not differ across validation designs (concurrent: $\overline{r}=.18,k=78,n=19,132$; predictive: $\overline{r}=.15,k=24,n=4173$), sample types (incumbents: $\overline{r}=.18,k=92,n=20,808$; applicants: $\overline{r}=.14,k=10,n=2497$), or their interaction. Critically, however, our review revealed that only a small minority of studies (~12%) were conducted with real applicants in predictive designs. Thus, barely a fraction of research is conducted under realistic conditions. Therefore, it remains an open question if self-report measures of conscientiousness retain their predictive validity in applied settings that entail faked responses. We conclude with a call for more multivariate research on the validity of selection procedures in predictive settings with actual applicants.     

A family of Gödel hybrid logics

In this paper, we define a family of fuzzy hybrid logics that are based on Gödel logic. It is composed of two infinite-valued versions called ${\mathsf{GH}}_{\infty }$ and ${\mathsf{WGH}}_{\infty }$, and a sequence of finitary valued versions ${({\mathsf{GH}}_n)}_{0<n<\infty }$. We define decision procedures for both ${\mathsf{WGH}}_{\infty }$ and ${({\mathsf{GH}}_n)}_{0<n<\infty }$ that are based on particular sequents and on a set of proof rules dealing with such sequents. As these rules are strongly invertible the procedures naturally allow one to generate countermodels. Therefore we prove the decidability and the finite model property for these logics. Finally, from the decision procedure of ${\mathsf{WGH}}_{\infty }$, we design a sound and complete sequent calculus for this logic.     

The psychology of inferring conditionals from disjunctions: A probabilistic study

There is a new probabilistic paradigm in the psychology of reasoning that is, in part, based on results showing that people judge the probability of the natural language conditional, if $A$then $B$, $P\left(ifAthenB\right)$, to be the conditional probability, $P(B\mid A)$. We apply this new approach to the study of a very common inference form in ordinary reasoning: inferring the conditional if not-$A$then $B$ from the disjunction $A$ or $B$. We show how this inference can be strong, with $P$(if not-$A$then $B$) “close to” $P\left(AorB\right)$, when $A$ or $B$ is non-constructively justified. When $A$ or $B$ is constructively justified, the inference can be very weak. We also define suitable measures of “closeness” and “constructivity”, by providing a probabilistic analysis of these notions.     

Combining linear-time temporal logic with constructiveness and paraconsistency

It is known that linear-time temporal logic (LTL), which is an extension of classical logic, is useful for expressing temporal reasoning as investigated in computer science. In this paper, two constructive and bounded versions of LTL, which are extensions of intuitionistic logic or Nelson's paraconsistent logic, are introduced as Gentzen-type sequent calculi. These logics, $\mathrm{IB}[l]$ and $\mathrm{PB}[l]$, are intended to provide a useful theoretical basis for representing not only temporal (linear-time), but also constructive, and paraconsistent (inconsistency-tolerant) reasoning. The time domain of the proposed logics is bounded by a fixed positive integer. Despite the restriction on the time domain, the logics can derive almost all the typical temporal axioms of LTL. As a merit of bounding time, faithful embeddings into intuitionistic logic and Nelson's paraconsistent logic are shown for $\mathrm{IB}[l]$ and $\mathrm{PB}[l]$, respectively. Completeness (with respect to Kripke semantics), cut–elimination, normalization (with respect to natural deduction), and decidability theorems for the newly defined logics are proved as the main results of this paper. Moreover, we present sound and complete display calculi for $\mathrm{IB}[l]$ and $\mathrm{PB}[l]$.In [P. Maier, Intuitionistic LTL and a new characterization of safety and liveness, in: Proceedings of Computer Science Logic 2004, in: Lecture Notes in Computer Science, vol. 3210, Springer-Verlag, Berlin, 2004, pp. 295–309] it has been emphasized that intuitionistic linear-time logic (ILTL) admits an elegant characterization of safety and liveness properties. The system ILTL, however, has been presented only in an algebraic setting. The present paper is the first semantical and proof-theoretical study of bounded constructive linear-time temporal logics containing either intuitionistic or strong negation.     

Reasoning about negligibility and proximity in the set of all hyperreals

We consider the binary relations of negligibility, comparability and proximity in the set of all hyperreals. Associating with negligibility, comparability and proximity the binary predicates N, C and P and the connectives $[N]$, $[C]$ and $[P]$, we consider a first-order theory based on these predicates and a modal logic based on these connectives. We investigate the axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic.