The complexity of admissible rules of {\L}ukasiewicz logic
Logic in Computer Science
2013-05-22 v2 Computational Complexity
Logic
Abstract
We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of {\L} are PSPACE-complete. In contrast, derivable rules of {\L} are known to be coNP-complete.
Keywords
Cite
@article{arxiv.1108.6261,
title = {The complexity of admissible rules of {\L}ukasiewicz logic},
author = {Emil Jeřábek},
journal= {arXiv preprint arXiv:1108.6261},
year = {2013}
}
Comments
14 pages, 2 figures; to appear in Journal of Logic and Computation