Computational complexity of one-variable fragments of products with T
Logic
2021-12-08 v1
Abstract
We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result for products and expanding relativized products containing as a factor the logic KTB of reflexive and symmetric Kripke frames.
Keywords
Cite
@article{arxiv.2112.03833,
title = {Computational complexity of one-variable fragments of products with T},
author = {K. Aleksandrov and M. Rybakov and D. Shkatov},
journal= {arXiv preprint arXiv:2112.03833},
year = {2021}
}
Comments
10 pages, in Russian