Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators.     

Structural equation modelling of human judgement

Structural equation modelling (SEM) is outlined and compared with two non-linear alternatives, artificial neural networks and “fast and frugal” models. One particular non-linear decision-making situation is discussed, that exemplified by a lexicographic semi-order. We illustrate the use of SEM on a dataset derived from 539 volunteers' responses to questions about food-related risks. Our conclusion is that SEM is a useful member of the armoury of techniques available to the student of human judgement: it subsumes several multivariate statistical techniques and permits their flexible combination, and it provides robust goodness-of-fit statistics and is available in (generally) easy-to-use computer packages. Although the number of tasks for which SEM provides a persuasive psychological model is small, it is very useful in identifying the important variables and their inter-relations that contribute to task performance, and thus can constitute a valuable intermediate staging point between raw data and a fully fledged psychological theory.     

Methodological practices in cognitive style research: Insights and recommendations from the field of business and psychology

This study provides insights and recommendations concerning methodological practices of cognitive style research applied to the field of business and psychology. Based on a carefully designed selection process, 139 style-related articles published between 1986 and 2010 were content-analysed. In terms of research design, we found the field to be dominated by quantitative, cross-sectional, and single-source designs that relied heavily on self-reports, sample surveys, and student samples. While this might indicate a potential vulnerability in terms of internal and external validity, a strong emphasis on construct validity was also found, exemplified by high attention to reliability, and exploratory and confirmatory factor analyses. With regard to construct measurement, although more than 30 different instruments were used, the field was dominated by three of these. Regarding data analysis, traditional approaches have been mainly used and more advanced and novel approaches have not yet permeated through the cognitive style field. Implications and suggestions for future research are offered. This is the first review of methodological practices in cognitive style research and represents an important step in the advancement of the field.     

The Undecidability of Grisin's Set Theory

We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.     

Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication

In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. We then show that for most of the systems under consideration the labelling mechanism can be avoided by choosing an appropriate way of structuring theories. One peculiar feature of our proof systems is the use of restart rules which allow to re-ask the original goal of a deduction. In case of K, K4, S4 and G, we can eliminate such a rule, without loosing completeness. In all the other cases, by dropping such a rule, we get an intuitionistic variant of each system. The present results are part of a larger project of a goal directed proof theory for non-classical logics; the purpose of this project is to show that most implicational logics stem from slight variations of a unique deduction method, and from different ways of structuring theories. Moreover, the proof systems we present follow the logic programming style of deduction and seem promising for proof search [Gabbay and Reyle 84, Miller et al. 91].     

Many-Valued Logics and Suszko's Thesis Revisited

Suszko's Thesis maintains that many-valued logics do not exist at all. In order to support it, R. Suszko offered a method for providing any structural abstract logic with a complete set of bivaluations. G. Malinowski challenged Suszko's Thesis by constructing a new class of logics (called q-logics by him) for which Suszko's method fails. He argued that the key for logical two-valuedness was the "bivalent" partition of the Lindenbaum bundle associated with all structural abstract logics, while his q-logics were generated by "trivalent" matrices. This paper will show that contrary to these intuitions, logical two-valuedness has more to do with the geometrical properties of the deduction relation of a logical structure than with the algebraic properties embedded on it.     

Leaping to Conclusions: Why Premise Relevance Affects Argument Strength

Everyday reasoning requires more evidence than raw data alone can provide. We explore the idea that people can go beyond this data by reasoning about how the data was sampled. This idea is investigated through an examination of premise non‐monotonicity, in which adding premises to a category‐based argument weakens rather than strengthens it. Relevance theories explain this phenomenon in terms of people's sensitivity to the relationships among premise items. We show that a Bayesian model of category‐based induction taking premise sampling assumptions and category similarity into account complements such theories and yields two important predictions: First, that sensitivity to premise relationships can be violated by inducing a weak sampling assumption; and second, that premise monotonicity should be restored as a result. We test these predictions with an experiment that manipulates people's assumptions in this regard, showing that people draw qualitatively different conclusions in each case.     

On Vagueness,Truth Values and Fuzzy Logics

Some aspects of vagueness as presented in Shapiro’s book Vagueness in Context [23] are analyzed from the point of fuzzy logic. Presented are some generalizations of Shapiro’s formal apparatus. Presented by Daniele Mundici     

Subjective Situations and Logical Omniscience

The beliefs of the agents in a multi-agent system have been formally modelled in the last decades using doxastic logics. The possible worlds model and its associated Kripke semantics provide an intuitive semantics for these logics, but they commit us to model agents that are logically omniscient. We propose a way of avoiding this problem, using a new kind of entities called subjective situations. We define a new doxastic logic based on these entities and we show how the belief operators have some desirable properties, while avoiding logical omniscience. A comparison with two well-known proposals (Levesque's logic of explicit and implicit beliefs and Thijsse's hybrid sieve systems) is also provided.