Rough polyadic modal logics

Journal of Applied Non-Classical Logics 1 (1):9-35 (1991)
  Copy   BIBTEX

Abstract

Rough polyadic modal logics, introduced in the paper, contain modal operators of many arguments with a relational semantics, based on the Pawlak's rough set theory. Rough set approach is developed as an alternative to the fuzzy set philosophy, and has many applications in different branches in Artificial Intelligence and theoretical computer science.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,435

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Hereditarily structurally complete modal logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.

Analytics

Added to PP
2014-01-21

Downloads
16 (#894,465)

6 months
2 (#1,214,131)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Many-dimensional arrow logics.Dimiter Vakarelov - 1996 - Journal of Applied Non-Classical Logics 6 (4):303-345.

Add more citations

References found in this work

A companion to modal logic.G. E. Hughes - 1984 - New York: Methuen. Edited by M. J. Cresswell.
Some embedding theorems for modal logic.David Makinson - 1971 - Notre Dame Journal of Formal Logic 12 (2):252-254.
Post completeness in modal logic.Krister Segerberg - 1972 - Journal of Symbolic Logic 37 (4):711-715.
An Essay in Classical Modal Logic.Karl Krister Segerberg - 1971 - Dissertation, Stanford University

Add more references