×

Description of modal logics which enjoy co-cover property. (English) Zbl 07593949

Summary: Here we use admissible rules to determine whenever modal logic satises weak co-cover property. We prove that logic \(\lambda\) over \(S4\) satises such property iff the given set of rules are admissible in \(\lambda \).

MSC:

03B45 Modal logic (including the logic of norms)

References:

[1] V.V. Rybakov, Admissibility of logical inference rules, Studies in Logic and the Foundations of Mathematics, 136, Elsevier, Amsterdam, 1997. Zbl 0872.03002 · Zbl 0872.03002
[2] R. Harrop, Concerning formulas of the typesA→B∨C, A→(∃x)B(x)in intuitionistic formal systems, J. Symb. Log., 25:1 (1960), 2732. Zbl 0098.24201
[3] G.E. Mints, Derivability of admissible rules, J. Sov. Math., 6:4 (1976), 417421. Zbl 0375.02014 · Zbl 0358.02031
[4] J. Porte, The deducibilities of S5, J. Phylos. Logic, 10:1 (1981), 409422. Zbl 0475.03005 · Zbl 0475.03005
[5] P. Lorenzen. Einfung in die operative Logik und Mathematik, Springer-Verlag, BerlinGottingen-Heidelberg, 1955. Zbl 0068.00801 · Zbl 0066.24802
[6] H. Friedman, One hundred and two problems in mathematical logic, J. Symb. Log., 40:3 (1975), 113130. Zbl 0318.02002 · Zbl 0318.02002
[7] V.V. Rybakov, A criterion for admissibility of rules in the modal system S4 and intuitionistic logic, Algebra Logic, 23:5 (1984), 369384. Zbl 0598.03013 · Zbl 0598.03013
[8] R. Iemho, A(nother) characterization of intuitionistic propositional logic, Ann. Pure Appl. Logic, 113:1-3 (2002), 161173. Zbl 0988.03045
[9] V.V. Rybakov, An explicit basis for rules admissible in modal system S4, Bull. Sect. Log., Univ. Lodz, Dep. Log., 28:3 (1999), 135143. Zbl 0961 · Zbl 0961.03021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.