Many-Valued Modal Logics

@article{citeulike:125414, 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...}, author = {Fitting, Melvin C. }, citeulike-article-id = {125414}, journal = {Fundamenta Informaticae}, keywords = {logic, many-valued, modal, multi-valued}, pages = {235--254}, posted-at = {2005-03-12 16:50:26}, priority = {0}, title = {Many-Valued Modal Logics}, url = {http://citeseer.ist.psu.edu/323416.html}, volume = {XV}, year = {1991} }

TY - JOUR ID - citeulike:125414 L3 - citeulike-article-id:125414 TI - Many-Valued Modal Logics JF - Fundamenta Informaticae VL - XV SP - 235 EP - 254 N2 - . 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... KW - logic KW - many-valued KW - modal KW - multi-valued AU - Fitting, Melvin PY - 1991/// UR - http://citeseer.ist.psu.edu/323416.html ER -