Many-Valued Modal Logics (1992)
Cached
Download Links
- [comet.lehman.cuny.edu]
- [comet.lehman.cuny.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Fundamenta Informaticae |
| Citations: | 190 - 16 self |
BibTeX
@INPROCEEDINGS{Fitting92many-valuedmodal,
author = {Melvin C. Fitting},
title = {Many-Valued Modal Logics},
booktitle = {Fundamenta Informaticae},
year = {1992},
pages = {365--448},
publisher = {Kluwer Academic Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and completeness are established. 1 Introduction The logics that have appeared in artificial intelligence form a rich and varied collection. While classical (and maybe intuitionistic) logic su#ces for the formal development of mathematics, artificial intelligence has found uses for modal, temporal, relevant, and many-valued logics, among others. Indeed, I take it as a basic principle that an application should find (or create) an appropriate 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...
