نتایج جستجو برای: modal operator diagram

تعداد نتایج: 191576  

1992
Ron Clark

(where an a f f i r m a t i v e sentential operator is informally characterized as one for which a p r i n c i p l e of d i s t r i b u t i o n over conjunction is not o b v i o u s l y implausible). Examples of such operators include the familiar modal operators ~ and 0, and also various epistemic and doxastic operators. I want to consider certain principles that may be held to govern certain ...

2002
Gabriel G. Infante López Carlos Areces Maarten de Rijke

We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce nondeterminism and they feature restrictions on the modal operators, which may lead to substantial reductions in complexity. Our main result is a general game-based characterization of the expressive power of our fragments over the class of finite structures.

1996
Gianni Amati Fiora Pirri

Nonmonotonic logic is a well developed research area gathering the logical formalisms that handle commonsense reasoning. One of the central issue in the area is to establish a notion of nonmonotonic provability, which is usually characterized via some modal logic. In MST93] a clear paradigm has been proposed that classiies modal monotonic logics , augmented with the \negation by fail-ure" to pr...

2004
Guram Bezhanishvili Leo Esakia David Gabelaia Dick De Jongh

In this note we investigate modal logics of submaximal and nodec spaces when the modal diamond is interpreted as the closure operator of a topological space. We axiomatize the modal logic of nodec spaces. We show that the modal logic of submaximal spaces is a proper extension of the modal logic of nodec spaces, axiomatize it, and prove that it coincides with the modal logics of door spaces and ...

Journal: :Fundam. Inform. 2003
Linh Anh Nguyen

We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD , T , KDB , B , KD4, S4, KD5, KD45, and S5. For an MProlog program P and for L being one of the mentioned logics, we define an operator TL,P , which has the leas...

Ali Mokhtarian, Arash Rajaee Mostafa Pirmoradian

The purpose of this article is modal analysis of ionic polymer metal composite beams, then briefing the system to the unique parameters to help in up modeling of the actuator. In this paper at first using of Mathematical analysis and Closed form transfer function of cantilever beam dynamic response to the forces of different inputs (intensive and continuous) is calculated and for different type...

Journal: :Optics letters 2012
Ayman F Abouraddy Timothy M Yarnall Bahaa E A Saleh

We generalize the traditional concept of temporal optical interferometry to any degree of freedom of a coherent optical field. By identifying the structure of a unitary optical transformation that we designate the generalized phase operator, we enable optical interferometry to be carried out in any modal basis describing a degree of freedom. The structure of the generalized phase operator is th...

2010
Norihiro Kamide

A new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from the standard linear-time temporal logic LTL by adding a sequence modal operator which represents a sequence of symbols. By the sequence modal operator of SLTL, we can appropriately express “sequential information” in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the c...

2012
Vedran Čačić Mladen Vuković

In [8], P. Hájek and V. Švejdar determined normal forms for the system ILF, and showed that we can eliminate the modal operator ¤ from IL–formulas. The normal form for the closed fragment of the interpretability logic IL is an open problem (see [13]). We prove that in some cases we can eliminate the modal operator ¤. We give an example where it is impossible to eliminate ¤. AMS subject classifi...

2009
Félix Bou Francesc Esteva Lluis Godo Ricardo Oscar Rodríguez

In [1] the authors considered finitely-valued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this paper we focus on the case of finite chains, and we consider a different approach based on introducing a multim...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید