Two's company: The Humbug of many logical values

Abstract

The Polish logician Roman Suszko has extensively pleaded in the 1970s for a restatement of the notion of many-valuedness. According to him, as he would often repeat, there are but two logical values, true and false. As a matter of fact, a result by Wójcicki-Lindenbaum shows that any tarskian logic has a many-valued semantics, and results by Suszko-da Costa-Scott show that any many-valued semantics can be reduced to a two-valued one. So, why should one even consider using logics with more than two values? Because, we argue, one has to decide how to deal with bivalence and settle down the trade-off between logical 2-valuedness and truth-functionality, from a pragmatical standpoint. This paper will illustrate the ups and downs of a two-valued reduction of logic. Suszko's reductive result is quite non-constructive. We will exhibit here a way of effectively constructing the two-valued semantics of any logic that has a truth-functional finite-valued semantics and a sufficiently expressive language. From there, as we will indicate, one can easily go on to provide those logics with adequate canonical systems of sequents or tableaux. The algorithmic methods developed here can be generalized so as to apply to many non-finitely valued logics as well- or at least to those that admit of computable quasi tabular two-valued semantics, the so-called dyadic semantics.