with a consistent and complete proof system that enables one to prove properties of mobile systems. Keywords: Mobile Code Languages, Temporal Logics of Programs, Coordination Models. 1 Introduction The increasing use of wide area networks, especially the World Wide Web, is calling for new programming

by non-standard modal models. The corresponding axiomatics is also presented in the paper and its soundness and completeness have been proved. A limitation of the \Sigma logic is that sentences in the scope of modalities are sentences of Propositional Calculus. Finally, it is shown how the logic can

it for one representative. In this paper, we present inference rules that typify this kind of reasoning. The rules lead us to a complete axiomatization of a linear time temporal logic, all formulas of which are trace consistent. The axiomatization is presented in a layered manner so that we can attempt

Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with vague knowledge. One of the most basic reasoning tasks in (fuzzy) Description Logics is to decide whether an ontology representing a knowledge domain is consistent. Surprisingly, not much is known

We give a sufficient condition for Kripke completeness of the extension of a modal logic with the transitive closure modality. More precisely, we show that if a logic is canonical and admits what we call definable filtration (ADF), then such an extension is complete (and again ADF). The transitive

-determination has been hypothesized to be associated with enhanced psychological functioning In addition, much experimental (laboratory) research reveals that individuals who are induced to become externally regulated persist much less than those who are intrinsically motivated (see Deci & Ryan, 1985, for a

difficult a natural and concise modelling as well as an efficient solving of a class of NP-complete combinatorial search problems dealing with sets. To overcome these problems, we propose a solution which consists in extending the notion of integer domains to that of set domains (sets of sets). We specify a

task-free resting state. These results indicate that the rFIC is likely to play a major role in switching between distinct brain networks across task paradigms and stimulus modalities. Our findings have important implications for a unified view of network mechanisms underlying both exogenous

We study a propositional bimodal logic consisting of two S4 modalities and [a], together with the interaction axiom scheme #a## # #a##. In the intended semantics, the plain is given the McKinsey-Tarski interpretation as the interior operator of a topology, while the labelled [a] is given

Guarded fragments of first-order logic were recently introduced by Andr'eka, van Benthem and N'emeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many