Abstract

In this work we propose a labelled tableau method for Łukasiewicz infinite-valued logic Lω. The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for Lω validity by reducing the check of branch closure to linear programming.