نتایج جستجو برای: order logic equipped with modal connectives
تعداد نتایج: 9518961 فیلتر نتایج به سال:
We describe a logic of preference in which modal connectives reflect reasons to desire that a sentence be true. Various conditions on models are introduced and analyzed.
A value space is a topological algebra B equipped with a non-empty family of continuous quantifiers : B → B. We will describe first-order logic on the basis of B. Operations of B are used as connectives and its relations are used to define statements. We prove under some normality conditions on the value space that any theory in the new setting can be represented by a classical first-order theo...
Linear logic" (LL; see Girard [6]) was proposed to be of use in computer science, but it can be formulated as a "display logic" (DL; see Belnap [2]), which is a kind of Gentzen calculus admitting easy proof of an Elimination Theorem. Thus LL is naturally placed within a wider prooftheoretical framework that is known to include relevance, intuitionist, and modal logics, etc., and that permits co...
In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending modal logic by a the dependence atom dep(·). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using...
In this paper we define two logics, KLn and BLn, and present resolutionbased proof methods for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar: it is a temporal logic that contains connectives...
Kowalski and Sergot’s Event Calculus (EC ) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. It does so in polynomial time with respect to the number of events. Extensions of its query language with Boolean connectives and operators from modal logic have been sh...
Following earlier work, a modal logic for T -coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yie...
Kowalski and Sergot s Event Calculus EC is a simple tempo ral formalism that given a set of event occurrences derives the maximal validity intervals MVIs over which properties initi ated or terminated by these events hold It does so in polyno mial time with respect to the number of events Extensions of its query language with Boolean connectives and operators from modal logic have been shown to...
Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as distinctive kind of discourse, with its own semantics pragmatics. The goal this essay is study the mechanisms by means which we make in starting from argument connectives such ‘therefore’. While some proposals made literature, they fail account for anaphoric behavior ‘ther...
We consider a general format for sequent rules for not necessarily normal modal logics based on classical or intuitionistic propositional logic and provide relatively simple local conditions ensuring cut elimination for such rule sets. The rule format encompasses e.g. rules for the boolean connectives and transitive modal logics such as S4 or its constructive version. We also adapt the method o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید