Computational complexity of one-variable fragments of products with T

2021/12/07 by Aleksandrov, K., Rybakov, M., Shkatov, D.
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2112.03833

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.

Related

• Modelling of logical systems by means of their fragments
• Some prospects for semiproducts and products of modal logics
• Logics with the axiom of convergence: complexity with a small number of variables in the language (extended version)
• Modal Logics with Hard Diamond-free Fragments
• On partitioning Kripke frames of finite height