Morikawa, O. (1989) Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic 30 130--137.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....return arcs, where the exact procedure invoked or the exact invocation point is uncertain) are denoted by may arcs. Other applications await discovery (e.g. cartesian abstraction in the SLAM project [1] and the relationship of our semantic framework to earlier studies of 3 valued modal logic [13, 30, 37] and intuitionistic modal logic [38] deserves examination as well. ....

O. Morikawa. Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic, 30:130-137, 1989.

....transitions that might occur (e.g. procedure call and return arcs, where the exact procedure invoked or the exact invocation point is uncertain) are denoted by may arcs. Other applications await discovery, and the relationships of our semantic framework to earlier studies of 3 valued modal logic [11, 29, 37] and intuitionistic modal logic [39] deserve examination as well. ....

O. Morikawa. Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic, 30:130--137, 1989.

....this problem easier: a constructive solution of the modified problem still requires the construction of an alternating automaton A (M;s0 ) OE as in the proof of Theorem 25. 5 Related Work Most of the existing work on 3 valued modal logic focuses on its proof theory. For example, see [Seg67] [Mor89], and [Fit92a] Our work in Section 3 is closest to [Fit92b] Here Fitting presents two interpretations of modal logic: one a manyvalued version and the other based on obtaining 2 valued interpretations from each of a set of experts. Fitting shows that such a multi expert interpretation ....

Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30(1):130--137, 1989.

....and false. Propositional connectives are dealt with in the obvious way. And for the modal connectives, one sets the truth value of #X at a world to be the inf of the truth values of X at all accessible worlds. This kind of generalization of Kripke semantics has been explored by several people [16, 19, 15, 9, 11, 10, 12]. The key thing to note is that, although a many valued truth value space has been introduced, the underlying notion of a Kripke frame remains classical. In [5] and especially [6] I introduced a somewhat more complicated generalization in which the notion of frame itself was modified: the ....

Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30:130--137, 1989.

....paper, 3] two families of many valued modal logics were examined. Semantically speaking, one family allowed formulas to take on values in a many valued logic at possible worlds, but otherwise the general structure of a Kripke frame was not altered. Such logics, in fact, have a long history, [13, 14, 12, 5, 7, 6, 8]. The other family considered in [3] allowed the accessibility relation itself to be many valued; something apparently new. In this paper the investigation of the second family of logics is continued. It is my hope that others will take up the study of these logics, for their own sakes and for the ....

O. Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30:130--137, 1989.

....logic, if it needs one, rather than reshape the application to fit some narrow class of established logics. In this paper I want to enlarge the variety of logics available by introducing natural blendings of modal and many valued logics. Many valued modal logics have been considered before [12, 13, 11, 6, 8, 7], but perhaps in too narrow a sense. The basic idea was to retain the general notion of possible world semantics, while allowing formulas to have values in a many valued space, at each possible world. What seems not to have been considered is allowing the accessibility relation between possible ....

Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30:130--137, 1989.

....to characterize them can be found in [Sti87, Wal90] Verification techniques based on the divergence preorder are described in [Wal90, CS90] In all this work logical formulas are interpreted normally in the 2 valued sense. To our knowledge none of the work on 3 valued modal logics (e.g. Seg67, Mor89, Fit92] shows how these logics can be used to characterize relations like our completeness preorder. The model checking framework developed in this paper could be extended so it can be performed symbolically following the ideas of [BCM 90] This would require the use of data structures and ....

Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30(1):130--137, 1989.

No context found.

Morikawa, O. (1989) Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic 30 130--137.

No context found.

O. Morikawa. Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic, 30:130-137, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC