Finite-valued reductions of infinite-valued logics

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.

[1]  Jan Krajícek,et al.  Embedding Logics into Product Logic , 1998, Stud Logica.

[2]  Stefano Aguzzoli,et al.  Finiteness in Infinite-Valued Łukasiewicz Logic , 2000, J. Log. Lang. Inf..

[3]  C. Chang,et al.  Algebraic analysis of many valued logics , 1958 .

[4]  Brunella Gerla,et al.  Finite-valued approximations of product logic , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[5]  Reiner Hähnle,et al.  Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[6]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[7]  Robert McNaughton,et al.  A Theorem About Infinite-Valued Sentential Logic , 1951, J. Symb. Log..

[8]  Daniele Mundici,et al.  Satisfiability in Many-Valued Sentential Logic is NP-Complete , 1987, Theor. Comput. Sci..