Algorithmic properties of QK4.3 and QS4.3
Logic
2023-07-07 v1 Logic in Computer Science
Abstract
We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in languages with two individual variables, one modandic predicate letter, and one proposition letter.
Cite
@article{arxiv.2307.02800,
title = {Algorithmic properties of QK4.3 and QS4.3},
author = {M. Rybakov and D. Shkatov},
journal= {arXiv preprint arXiv:2307.02800},
year = {2023}
}
Comments
Smirnov Readings, 2021, Moscow