|
Sibirskii Matematicheskii Zhurnal, 2003, Volume 44, Number 4, Pages 726–736
(Mi smj1208)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
A criterion for admissibility of inference rules in some class of $S4$-logics without the branching property
E. M. Golovanova Krasnoyarsk State University
Abstract:
We consider a finitely approximable modal $S4$-logic without the branching property. Although Rybakov's criterion is inapplicable, using his method we manage to obtain an algorithmic criterion for admissibility of inference rules in a given logic.
Keywords:
superintuitionistic logic, modal logic, admissible inference rule, decidability with respect to admissibility.
Received: 24.04.2002
Citation:
E. M. Golovanova, “A criterion for admissibility of inference rules in some class of $S4$-logics without the branching property”, Sibirsk. Mat. Zh., 44:4 (2003), 726–736; Siberian Math. J., 44:4 (2003), 568–576
Linking options:
https://www.mathnet.ru/eng/smj1208 https://www.mathnet.ru/eng/smj/v44/i4/p726
|
|