Complexity Issues in Axiomatic Extensions of Łukasiewicz Logic

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