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.
Finite-valued reductions of infinite-valued logics / S. Aguzzoli, B. Gerla. - In: ARCHIVE FOR MATHEMATICAL LOGIC. - ISSN 0933-5846. - 41:4(2002 Apr), pp. 361-399. [10.1007/s001530100118]
Finite-valued reductions of infinite-valued logics
S. AguzzoliPrimo
;
2002
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
