Email this article Axiomatization and Polynomial Solvability of Strictly Positive Fragments of Certain Modal Logics
- Authors: Svyatlovskii M.V.1
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Issue: Vol 103, No 5-6 (2018)
- Pages: 952-967
- Section: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/151017
- DOI: https://doi.org/10.1134/S0001434618050322
- ID: 151017
Cite item
Open Access
Access granted
Subscription Access
Abstract
The fragment of the language of modal logic that consists of all implications A → B, where A and B are built from variables, the constant ⊤ (truth), and the connectives ∧ and ◊1,◊2,...,◊m. For the polymodal logic S5m (the logic of m equivalence relations) and the logic K4.3 (the logic of irreflexive linear orders), an axiomatization of such fragments is found and their algorithmic decidability in polynomial time is proved.
Keywords
About the authors
M. V. Svyatlovskii
Moscow Institute of Physics and Technology (State University)
Author for correspondence.
Email: mikhail.svyatlovskiy@phystech.edu
Russian Federation, Dolgoprudnyi, Moscow Oblast
Supplementary files
