A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The complexity of admissible rules of Lukasiewicz logic
2012
Journal of Logic and Computation
Preserved Fulltext
Other Versions
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