A recursive basis of inference rules is described which are instantaneously admissible in all table (residually finite) logics extending one of the logics Int and Grz. A rather simple semantic criterion is derived to determine whether a given inference rule is admissible in all table superintuitionistic logics, and the relationship is established between admissibility of a rule in all table (residually finite) superintuitionistic logics and its truth values in Int.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. V. Rybakov, Admissibility of Logical Inference Rules, Stud. Log. Found. Math., 136, Elsevier, Amsterdam (1997).
V. V. Rybakov, “Bases of admissible rules for logics S4 and Int,” Algebra Logika, 24, No. 1, 87–107 (1985).
V. V. Rybakov, “Bases of admissible rules for the modal system Grz and the intuitionistic logic,” Mat. Sb., 128(170), No. 3(11), 321–338 (1985).
V. V. Rimatskii, “Bases of admissible inference rules for table modal logics of depth 2,” Algebra Logika, 35, No. 5, 612–622 (1996).
V. V. Rimatskii, “Finite bases of admissible inference rules for modal logics of width 2,” Bull. Sect. Log., Univ. Łodź, Dep. Log., 26, No. 3, 126–134 (1997).
V. V. Rybakov, M. Terziler, and V. Rimazki, “Bases in semi-reduced form for admissible rules of the intuitionistic logic IPC,”Math. Log. Q., 46, No. 2, 207-218 (2000).
A. Chagrov and M. Zakharyaschev, Modal Logics, Oxford Logic Studies, 35, Clarendon, Oxford (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 48, No. 3, pp. 400–414, May–June, 2009.
Rights and permissions
About this article
Cite this article
Rimatskii, V.V. Table admissible inference rules. Algebra Logic 48, 228–236 (2009). https://doi.org/10.1007/s10469-009-9055-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-009-9055-z