Cross-modal priming occurs when a prime presented in one sensory modality influences responses to a target in a different sensory modality. Currently, demonstrations of cross-modal evaluative priming have been sparse and limited. In the present study, we seek to partially rectify this state of affairs by examining cross-modal evaluative priming from auditory primes to visual targets. Significan...

In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program comp...

Paraconsistent logic was born in the vicinity of modal logic. Moreover, as every other non-classical logicians, paraconsistentists have very often flirted with modalities. The first known system of paraconsistent logic was in fact defined as a fragment of S5, in the late 40s. But a fragment of a modal system is not necessarily a modal system. I will show here, indeed, that Jaśkowski’s D2 is not...

This paper introduces a multi-modal polymorphic type theory to model epistemic processes characterized by trust, defined as a second-order relation affecting the communication process between sources and a receiver. In this language, a set of senders is expressed by a modal prioritized context, whereas the receiver is formulated in terms of a contextually derived modal judgement. Introduction a...

Kripke-style models with two accessibility relations, one intuitionistio and the other modal, are given for analogues of the modal system K based on Heyting's propositional logic. I t is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddi...

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called can...

The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of knowledge as well as temporal logics and polymodal K are discussed. All those products form rather...

The theory of rough sets is an extension of set theory with two additional unary set-theoretic operators deened based on a binary relation on the universe. These two operators are related to the modal operators in modal logics. By exploring the relationship between rough sets and modal logics, this paper proposes and examines a number of extended rough set models. By the properties satissed by ...

We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given by linear constraints on the arguments of operators. The implementation uses binary decision diagrams for propositional connectives and a linear programming library for the modal ...

modal verbs and their different meanings can be investigated on the basis of various theoretical frameworks. in this paper, persian modal verbs are examined and analyzed in terms of degrees and kinds of modality proposed by palmer (1990). our analysis shows that although bǎyad ‘must’ does not entail the proposition, it is used to express three degrees of epistemic modality, two degrees of dynam...