|
Admissibility and unification in the modal logics related to S4.2
V. V. Rybakovab a Institute of Mathematics and Computer Science, Siberian Federal University, Krasnoyarsk
b A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
We study unification and admissibility for an infinite class of modal logics. Conditions superimposed to these logics are to be decidable, Kripke complete, and generated by the classes of rooted frames possessing the greatest clusters of states (in particular, these logics extend modal logic S4.2). Given such logic $L$ and each formula $\alpha$ unifiable in $L$, we construct a unifier $\sigma$ for $\alpha$ in $L$, where $\sigma$ verifies admissibility in $L$ of arbitrary inference rules $\alpha/\beta$ with a switched-modality conclusions $\beta$ (i.e., $\sigma$ solves the admissibility problem for such rules).
Keywords:
modal logic, unification, admissibility problem, computation of unifiers, projective formulas, admissible rules.
Received: 12.04.2023 Revised: 08.10.2023 Accepted: 28.11.2023
Citation:
V. V. Rybakov, “Admissibility and unification in the modal logics related to S4.2”, Sibirsk. Mat. Zh., 65:1 (2024), 198–206
Linking options:
https://www.mathnet.ru/eng/smj7849 https://www.mathnet.ru/eng/smj/v65/i1/p198
|
Statistics & downloads: |
Abstract page: | 44 | References: | 15 | First page: | 10 |
|