The complexity of admissible rules of Lukasiewicz logic

E. Jerabek
2012 Journal of Logic and Computation  
We investigate the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic (Ł). It was shown in [13] that admissibility in Ł is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of Ł are PSPACE-complete. In contrast, derivable rules of Ł are known to be coNP-complete.
doi:10.1093/logcom/exs007 fatcat:jwopddmyqfbljbk7n2sbpkukqi