When Authoritarians Confront Prejudice. Differential Effects of SDO and RWA on Support for Hate‐Speech Prohibition

Two nationwide representative studies (N = 653 adolescents; N = 1007 adults) investigated the psychological correlates of the intention to penalize public expressions of prejudice in the form of support for hate‐speech prohibition. We presented participants with preselected examples of hate speech from the Internet and other mass media and assessed their willingness to support the prohibition of public expressions of such remarks. Both studies found that social dominance orientation and right‐wing authoritarianism are positively correlated with outgroup prejudice, but they have differential effects on hate‐speech prohibition. Social dominance orientation was positively related to the acceptance of hate speech, whereas right‐wing authoritarianism was positively related to hate‐speech prohibition. In discussing this counterintuitive finding, we suggest that right‐wing authoritarians are particularly vigilant toward norm violations—and this makes them more punitive toward counternormative expressions of prejudice, such as hate speech.     

Annotation Theories over Finite Graphs

In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph’s nodes. Such theories, which we call annotation theories, can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, specification of preferred models and model checking problem. We show that most of considered problems are NPTime- or co-NPTime-complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of annotation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21].     

Towards a Rough Mereology-Based Logic for Approximate Solution Synthesis. Part 1

We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely.     

Sheaves over Heyting lattices

For a complete Heyting lattice , we define a category Etale (). We show that the category Etale () is equivalent to the category of the sheaves over , Sh(), hence also with -valued sets, see [2], [1]. The category Etale() is a generalization of the category Etale (X), see [1], where X is a topological space.     

Short-term memory capacity (7 ± 2) predicted by theta to gamma cycle length ratio

The number of items that can be held in human short-term memory (STM) is limited to 7 (± 2) elements. Lisman and Idiart's theoretical model of STM proposes that this value depends on the number of gamma cycles that can fit in one theta cycle. Previous studies on animals and humans provided support for this hypothesis but direct evidence from human EEG scalp recordings has not previously been reported. We recorded spontaneous EEG activity from 17 participants and measured their verbal STM capacity with a modified digit span task from the Wechsler battery. The strong and positive correlation we found between verbal STM capacity and theta/gamma cycle length ratio thus provides a direct argument in favor of this STM theoretical model. In this study we also demonstrated a new method for assessing individual theta and gamma frequencies by detecting functional coupling between these oscillations.     

An erotetic approach to explanation by specification

In earlier publications of the first author it was shown that intentional explanation of actions, functional explanation of biological traits and causal explanation of abnormal events share a common structure. They are called explanation by specification (of a goal, a biological function, an abnormal causal factor, respectively) as opposed to explanation by subsumption under a law. Explanation by specification is guided by a schematic train of thought, of which the argumentative steps not concerning questions were already shown to be logically valid (elementary) arguments.Independently, the second author developed a new, inferential approach to erotetic logic, the logic of questions. In this approach arguments resulting in questions, with declarative sentences and/or other questions as premises, are analyzed, and validity of such arguments is defined.In the present paper it is shown that all four kinds of erotetic argumentative steps occurring in the train of thought of explanation by specification are valid arguments in the sense of inferential erotetic logic. Hence, in view of the fact that the other argumentative steps were already shown to be valid, it may be concluded that the logical structure of explanation by specification can be as well-established as that of explanation by nomological subsumption. Moreover, explanation by specification provides some illustrations of the applicability of erotetic logic in everyday life and some empirical sciences.     

On the reducibility of questions

The concepta question is reducible to a non-empty set of questions is defined and examined. The basic results are: (1) each question which is sound relative to some of its presuppositions is reducible to some set of binary (i.e. having exactly two direct answers) questions; (b) each question which has a finite number of direct answers is reducible to some finite set of binary questions; (c) if entailment is compact, then each normal question (i.e. sound relative to its presuppositions) is reducible to some finite set of binary questions.