Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

摘要

In this article, the computational complexity of all axiomatic extensions of Lukasiewicz propositional logic L and the arithmetical complexity of both the general and standard semantics of their corresponding predicate logics is determined.