Complexity of the interpretability logic IL
Logic
2018-04-09 v4
Abstract
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algorithm, together with the previously known PSPACE hardness of the closed fragment of IL, implies PSPACE-completeness.
Cite
@article{arxiv.1710.05599,
title = {Complexity of the interpretability logic IL},
author = {Luka Mikec and Fedor Pakhomov and Mladen Vuković},
journal= {arXiv preprint arXiv:1710.05599},
year = {2018}
}
Comments
7 pages