Abstract
In this paper we present a method to reduce the decision problem of several infinite-valued propositional logics to their finite-valued counterparts. We apply our method to Łukasiewicz, Gödel and Product logics and to some of their combinations. As a byproduct we define sequent calculi for all these infinite-valued logics and we give an alternative proof that their tautology problems are in co-NP.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 6 April 2000 / Published online: 27 March 2002
Rights and permissions
About this article
Cite this article
Aguzzoli, S., Gerla, B. Finite-valued reductions of infinite-valued logics. Arch. Math. Logic 41, 361–399 (2002). https://doi.org/10.1007/s001530100118
Issue Date:
DOI: https://doi.org/10.1007/s001530100118