Abstract
Using the criterion of this paper, we solve the substitution problem and obtain an algorithm for determining the solvability of logical equations in the modal logic S4.α N . Another corollary of the criterion is the solvability of the corresponding quasiequational theory of the free modal algebra whose signature is enriched with constants for the free generators.
Similar content being viewed by others
References
Rybakov V. V., “Equations in a free topoboolean algebra and the substitution problem,” Soviet Math. Dokl., 33, 428–431 (1986).
Rybakov V. V., “Logical equations and admissible rules of inference with parameters in modal provability logics,” Studia Logica, 49, No. 2, 215–239 (1990).
Rybakov V. V., Admissibility of Logical Inference Rules, Elsevier Sci. Publ.; North-Holland, New York; Amsterdam (1997) (Stud. Logic Found. Math., 136).
Kiyatkin V. R., “Inference rules with metavariables and logical equations in the pretabular modal logic PM1,” Siberian Math. J., 41, No. 1, 74–80 (2000).
Rutskiy A. N., “Decidability of modal logics S4 ⊕ α N , S4 ⊕ ξ N +1 w.r.t. admissible inference rules,” Bull. Sect. Logic, 30, No. 4, 181–189 (2001).
Author information
Authors and Affiliations
Additional information
Original Russian Text Copyright © 2007 Rutskiĭ A. N.
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 2, pp. 396–407, March–April, 2007.
Rights and permissions
About this article
Cite this article
Rutskii, A.N. An admissibility criterion for inference rules with metavariables in the modal logic S4.α N . Sib Math J 48, 317–326 (2007). https://doi.org/10.1007/s11202-007-0033-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11202-007-0033-1