Quasi-characteristic inference rules for modal logics

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this paper is to develop techniques characterizing quasi-characteristic inference rules for modal logics. We describe a necessary and sufficient condition for a quasi-characteristic rule to be valid on an algebra and obtain basic properties concerning derivability of quasi-characteristic rules. Using this approach we characterize all structurally complete logics with the finite model property. The main results of this paper characterize admissible quasi-characteristic inference rules for modal logics S4 and K4. We also show that the set of all quasi-characteristic inference rules admissible in the logic S4 have a finite basis consisting of three special rules which are precisely described.

Cite

CITATION STYLE

APA

Rybakov, V. V. (1997). Quasi-characteristic inference rules for modal logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1234, pp. 333–341). Springer Verlag. https://doi.org/10.1007/3-540-63045-7_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free