×

An explicit basis for WCP-globally admissible inference rules. (English. Russian original) Zbl 1535.03123

Algebra Logic 62, No. 2, 148-165 (2023); translation from Algebra Logika 62, No. 2, 219-246 (2023).
Summary: Inference rules are examined which are admissible immediately in all residually finite extensions of \(S4\) possessing the weak cocover property. An explicit basis is found for such WCP-globally admissible rules. In case of tabular logics, the basis is finite, and for residually finite extensions, the independency of an explicit basis is proved.

MSC:

03B45 Modal logic (including the logic of norms)
Full Text: DOI

References:

[1] P. Lorenzen, Einf¨uhrung in die Operative Logik und Mathematik, Grundlehren Math. Wiss., 78, Springer-Verlag, Berlin (1955). · Zbl 0068.00801
[2] Harrop, R., Concerning formulas of the types A → B ∨ C, A → ∃xB(x), J. Symb. Log., 25, 1, 27-32, (1960) · Zbl 0098.24201 · doi:10.2307/2964334
[3] Mints, GE, Derivability of admissible rules, Zh. Sov. Mat., 6, 4, 417-421, (1976) · Zbl 0375.02014 · doi:10.1007/BF01084082
[4] Port, J., The deducibilities of S5, J. Phylos. Log., 10, 1, 409-422, (1981) · Zbl 0475.03005 · doi:10.1007/BF00248735
[5] Friedman, H., One hundred and two problems in mathematical logic, J. Symb. Log., 40, 113-129, (1975) · Zbl 0318.02002 · doi:10.2307/2271891
[6] Rybakov, VV, A criterion for admissibility of rules in the modal system S4 and the intuitionistic logic, Algebra and Logic, 23, 5, 369-384, (1984) · Zbl 0598.03013 · doi:10.1007/BF01982031
[7] V. V. Rybakov, Admissibility of Logical Inference Rules, Stud. Logic Found. Math., 136, Elsevier, Amsterdam (1997). · Zbl 0872.03002
[8] A. I. Citkin, “Admissible rules of intuitionistic propositional logic,” Mat. Sb., 102(144), No. 2, 314-323 (1977). · Zbl 0355.02016
[9] Rybakov, VV, Bases of admissible rules for logics S4 and Int, Algebra and Logic, 24, 1, 55-68, (1985) · Zbl 0598.03014 · doi:10.1007/BF01978706
[10] Rimatskii, VV, Finite bases with respect to admissibility for modal logics of width 2, Algebra and Logic, 38, 4, 237-247, (1999) · Zbl 0930.03020 · doi:10.1007/BF02671729
[11] Rimatskii, VV, Bases of admissible rules for K-saturated logics, Algebra and Logic, 47, 6, 420-425, (2008) · Zbl 1241.03033 · doi:10.1007/s10469-008-9033-x
[12] Rybakov, VV; Terziler, M.; Rimazki, V., A basis in semi-reduced form for admissible rules of the intuitionistic logic IPC, Math. Log. Q., 46, 2, 207-218, (2000) · Zbl 0955.03037 · doi:10.1002/(SICI)1521-3870(200005)46:2<207::AID-MALQ207>3.0.CO;2-E
[13] Iemhoff, R., On the admissible rules of intuitionistic propositional logic, J. Symb. Log., 66, 1, 281-294, (2001) · Zbl 0986.03013 · doi:10.2307/2694922
[14] Iemhoff, R., A(nother) characterization of intuitionistic propositional logic, Ann. Pure Appl. Log., 113, 1-3, 161-173, (2002) · Zbl 0988.03045
[15] Rybakov, VV, Construction of an explicit basis for rules admissible in modal system S4, Math. Log. Q., 47, 4, 441-446, (2001) · Zbl 0992.03027 · doi:10.1002/1521-3870(200111)47:4<441::AID-MALQ441>3.0.CO;2-J
[16] E. Jeřábek, “Admissible rules of modal logics,” J. Log. Comput., 15, No. 4, 411-431 (2005). · Zbl 1077.03011
[17] E. Jeřábek, “Independent bases of admissible rules,” Log. J. IGPL, 16, No. 3, 249-267 (2008). · Zbl 1146.03008
[18] V. V. Rimatsky, “An explicit basis for admissible rules of logics of finite width,” Zh. SFU, Mat., Fiz., 1, No. 1, 85-93 (2008).
[19] O. V. Lukina and V. V. Rimatskii, “An explicit basis for admissible inference rules of tabular logic,” Vest. KGU, Fiz. Mat. N., No. 1, 68-71 (2006).
[20] V. V. Rimatskii and V. R. Kiyatkin, “Independent bases for admissible rules of pretabular modal logic and its extensions,” Sib. El. Mat. Izv., 10, 79-89 (2013); http://semr.math.nsc.ru/v10/p79-89.pdf. · Zbl 1330.03046
[21] V. V. Rimatski and V. V. Rybakov, “A note on globally admissible inference rules for modal and superintuitionistic logics,” Bull. Sect. Log., Univ. Łódź, Dep. Log., 34, No. 2, 93-99 (2005). · Zbl 1117.03024
[22] V. V. Rybakov, M. Terziler, and C. Genzer, “An essay on unification and inference rules for modal logics,” Bull. Sect. Log., Univ. Łódź, Dep. Log., 28, No. 3, 145-157 (1999). · Zbl 0952.03019
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.