Quasi-characteristic inference rules for modal logics
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.
Unable to display preview. Download preview PDF.
- 1.Citkin A.I. On Admissible Rules of Intuitionistic Prepositional Logic. Math. USSR Sbornik, V.31, 1977, No.2, 279–288.Google Scholar
- 2.Mints G.E. Derivability of Admissible Rules. J. of Soviet Mathematics, V. 6, 1976, No. 4, 417–421.Google Scholar
- 3.Rybakov V. V. Criteria for Admissibility of Inference Rules. Modal and Intermediate Logics with the Branching Property. Studia Logica, V.53, 1994, No.2, 203–225.Google Scholar
- 4.Rybakov V. V. Preserving of Admissible Inference Rules in Modal Logic. In Book: Logical Foundations of Computer Science, Lecture Notes in Computer Science, Eds.: A.Nerode, Yu.V.Matiyasevich, V.813, 1994, Springer-Verlag, 304–316.Google Scholar
- 5.Rybakov V.V. Hereditarily Structurally Complete Modal Logics. J. of Symbolic Logic, V.60, 1995, No.1, 266–288Google Scholar