## Suszko's Thesis

In order to justify his claim that true and false are the only logical values, Suszko (1977) observes that every structural Tarskian many-valued propositional logic can be provided with a bivalent semantics.

### 1. Suszko's reduction

Suszko considers structural Tarskian consequence relations and the notion of an n-valued matrix (i.e., n-valued valuation system and the corresponding n-valued logic). It is standard terminology to call a pair L = (L, ⊦) a Tarskian (structural Tarskian) logic iff ⊦ is Tarskian (structural and Tarskian). Using the above definition of an n-valued model and the notion of characterization of a logic by a valuation system, L is said to be characterized by an n-valued model M iff ⊦L = ⊧M. The logic L is characterized by a class M of n-valued models iff ⊦L = ∩{⊧M | MM}.

Ryszard Wójcicki (1970) showed that every structural Tarskian logic is characterized by its so-called Lindenbaum bundle, which is a certain class of matrices syntactically defined using the formulas of the language as values:

{⟨⟨L, {AL | Δ⊦A}, C⟩, v⟩ | Δ ⊆ L, v is a uniform substitution on L}.

Wójcicki proved:

Theorem 1. Every structural Tarskian logic is characterized by a class of n-valued models, for some at most countably infinite n.

Based on this result Suszko's reduction can be formulated as follows (Suszko 1977, Malinowski 1993):

Theorem 2. Every structural Tarskian logic is characterized by a class of two-valued models.

The idea of the proof is quite simple. Given an n-valued model, an equivalent two-valued model can be defined by evaluating a formula as 1 if it receives a designated value in the n-valued model; otherwise as 0.

Proof. Let Λ = (L, ⊦) be a structural Tarskian logic. By Theorem 1, the logic Λ is characterized by a class CΛ of n-valued models. For ⟨⟨V, D, {fc: cC}⟩, v⟩ ∈ CΛ, the function tv from L into {0, 1} is defined as follows:

 tv(A) = { 1 if v(A) ∈ D  0 if v(A) ∉ D

The class {⟨⟨{0, 1}, {1}, {fc: cC}⟩, tv⟩ | ⟨⟨V, D, {fc: cC}⟩, v⟩ ∈ CΛ} of 2-valued models characterizes Λ.

Malinowski (1994, 79) points out that Suszko's reduction does not establish the existence of a characterizing class of structural two-valued models. It has been noted by da Costa et al. (1996) and Caleiro et al. (2005), however, that the condition of structurality can be given up in Wójcicki's Theorem and hence in Theorem 1.

### 2. Malinowski's analysis of Suszko's Thesis

Malinowski (1994, 80 f.) emphasizes that logical bivalence in Suszko's sense is related to the bi-partition of the set of values into the set of designated values and its complement and raises the question “whether logical many-valuedness is possible at all”. He obtains a positive answer to this question by

invoking a formal framework for reasoning admitting rules of inference which lead from non-rejected assumptions to accepted conclusions (Malinowski 1994).

This approach may be viewed as taking ‘true’ and ‘false’ to be expressions that give rise to contrary instead of contradictory pairs of sentence. The pair ‘true’ versus ‘false’ is associated with the contrary pairs ‘designated’ versus ‘antidesignated’ and ‘accepted’ versus ‘rejected’. Admitting algebraic values that are neither designated nor antidesignated amounts to admitting in addition to the logical values true and false the third logical value neither true nor false, so that being false is distinguished from not being true. Whereas the algebraic values that are not designated are already given with the set of designated values D as its set-theoretical complement, the treatment of true and false as values that are independent of each other leads to distinguishing between the set D+ of designated values and the set D of anti-designated values.

Let L be as above. An n-valued q-matrix (quasi-matrix) based on L is defined by Malinowski as a structure M = ⟨V, D+, D, {fc: cC}⟩, where V is a non-empty set of cardinality n≥2, D+ and D are distinct non-empty proper subsets of V such that D+D = ∅, and every fc is a function on V with the same arity as c. A valuation function v in M is a function from L into the set of truth values V, and Malinowski considers only valuations which satisfy conditions (1) and (2).

To obtain a kind of entailment relation that does not admit of a reduction to a bivalent semantics, Malinowski defines q-entailment as depending on both sets D+ and D. A q-matrix M = ⟨V, D+, D, {fc: cC}⟩ determines a q-entailment relation ⊧ MP(LL by defining Δ ⊧ M A iff for every valuation v in M satisfying conditions (1) and (2), v(Δ)∩D = ∅ implies v(A) ∈ D+. A pair M = ⟨⟨V, D+, D, {fc: cC}⟩, v⟩, where M = ⟨V, D+, D, {fc: cC}⟩ is an n-valued q-matrix and v a valuation in M, may be called an n-valued q-model based on M. The relation ⊧MP(L) ×L determined by such a model is defined by the following equivalence: Δ⊧M A iff v(Δ) ∩D = ∅ implies v(A) ∈ D+. If M = ⟨V, D+, D, {fc: cC}⟩ is a q-matrix and D+ is not the complement of D, there is no class of functions v from L into {1, 0} such that Δ ⊧M A iff for every function from that class, v(Δ) ⊆ {1} implies v(A) = 1. Let M = ⟨⟨V , D+, D, {fc: cC}⟩, v⟩ be an n-valued q-model. Malinowski pointed out that an equivalent three-valued q-model M′ = ⟨⟨{0, ½, 1}, {1}, {0}, {fc: cC}⟩, tv⟩ can be defined as follows:

 tv(A) = { 1 if v(A) ∈ D+  ½ iff v(A) ∈ V \ (D+∪D−)  0 if v(A) ∉ D−

A q-entailment relation ⊧ M is a special case of what Malinowski calls a q-consequence relation. A q-consequence relation on L is a relation ⊩ ⊆ P(L) ×L such that for every AL and every Δ, Γ ⊆ L:

 If Δ ⊩ A then Δ ∪ Γ ⊩ A (Monotonicity) (9) Δ ∪ {B | Δ ⊩ B} ⊩ A iff Δ ⊩ A (Quasi-closure) (10)

A pair (L, ⊩) is said to be a q-logic; it is structural iff ⊩ is structural. A q-logic (L, ⊩) is said to be characterized by an n-valued q-matrix M iff ⊩ = ⊧ M, (L, ⊩) is characterized by an n-valued q-model M iff ⊩ = ⊧M, (L, ⊩) is characterized by a class K of n-valued q-matrices (q-models) iff ⊩ = ∩{⊧M | MK} (⊩ = ∩{⊧M | MK}).

If Δ ⊆ L, let D+Δ = {AL | Δ ⊩ A} and DΔ = L \ (Δ ∪ {AL | Δ ⊩ A}). Malinowski (1990) showed that every structural q-logic is characterized by the following Lindenbaum bundle:

{⟨⟨L, D+Δ, DΔ, C⟩, v⟩ | Δ ⊆ L, v is a uniform substitution on L}.

Malinowski proved:

Theorem 3. Every structural q-logic is characterized by a class of n-valued q-models, for some at most countably infinite n.

By the above definition of three-valued q-models M ′ and by the Suszko Reduction for the case that V \ (D+D ) = ∅, it follows that q-logics are logically two-valued (if D is the complement of D+) or three-valued (if D is distinct from the complement of D+).

Malinowski also proved:

Theorem 4. Every structural q-logic is characterized by a class of two-valued q-models or by a class of three-valued q-models.

### 3. Inferential many-valuedness and generalized valuation systems

Suszko does not define the notion of a logical value except for stating that true and false are the only logical values, but he claims that “any multiplication of logical values is a mad idea” (Suszko 1977, 378). This latter pronouncement, however, might be resisted. One may ask by virtue of which properties true and false are to be considered as logical values. Truth is preserved in a valid inference from the premises to the conclusion (or the conclusions in a multiple-conclusion setting). In the matrix semantics, the logical value true is given with a non-empty proper subset D of the set of algebraic values and with the corresponding notion of entailment, understood as the preservation of membership in D from the premises to the conclusion(s). This notion of entailment can be referred to as t-entailment. A formula A is logically true iff A is t-entailed by the empty set (iff for every assignment v of algebraic values to the formulas of the language under consideration, v(A) is designated), and A is logically false iff A t-entails the empty set (iff for every assignment v, v(A) is not designated). If the set of algebraic values is bi-partitioned, falsity is identified with the complement of D. Now, it is characteristic for falsity to be preserved in the reverse direction, i.e., from the conclusion(s) to at least one of the premises. One might wish to consider a notion of f-entailment understood as the backward preservation of values associated with falsity. Obviously, membership in the complement of D is preserved from the conclusion(s) to the premises, but this gives the very same relation as t-entailment. Since D is uniquely determined by its complement, and vice versa, logical two-valuedness is, in fact, reduced to logical mono-valuedness if there is just one entailment relation defined as truth preservation form the premises to the conclusion. Thus, classical propositional logic is not logically two-valued in this sense.

Malinowski's notion of a q-matrix can serve as a starting point for developing the notion of logical or inferential many-valuedness. One obtains a generalized q-matrix by giving up the condition that D+D = ∅. If the set of truth values is not dichotomized, but at least trisected, this may have a significant impact on the very concept of logical entailment. Indeed, since truth (D+) does not generally coincide with non-falsity (the complement of D) any more, and falsity (D) may differ from non-truth (the complement of D+), the expressions ‘B is true whenever A is true’ and ‘B is not false whenever A is not false’ need no longer mean the same. Moreover, the other usual characterizations of entailment (e.g., for single premises and conclusions): “in any case either A is false or B is true” and “it is impossible that A is true and B false”, also become non-equivalent. Hence, the relations determined by these conditions may also be different. That is, in addition to the simple preservation of truth from the premises to the conclusion(s) and the simple preservation of falsity in the backward direction, there come to mind at least two other notions of entailment based on an obvious interplay between D+ and D which have a clear intuitive appeal. In this way the framework of generalized q-matrices allows no less than four basic entailment relations (t-entailment, f-entailment, q-entailment and p-entailment) defined as follows:

 Δ ⊧t B iff ∀a[(∀A ∈ Δ: va(A) ∈ D+) ⇒ va(B) ∈ D+] (11) Δ ⊧f B iff ∀a[(∀A ∈ Δ: va(A) ∉ D−) ⇒ va(B) ∉ D−] (12) Δ ⊧q B iff ∀a[(∀A ∈ Δ: va(A) ∉ D−) ⇒ va(B) ∈ D+] (13) Δ ⊧p B iff ∀a[(∀A ∈ Δ: va(A) ∈ D+) ⇒ va(B) ∉ D−] (14)

Whereas t-entailment is a generalization of the standard truth-preserving relation, f-entailment incorporates the idea of non-falsity preservation (cf. Dunn 2000, p.10). Malinowski's relation of q-entailment qualifies derivations of true sentences from non-refuted premises (understood as hypotheses) as valid, and p-entailment (p for “plausibility”) has been studied by Frankowski, who tried to explicate “reasonings wherein the degree of strength of the conclusion (i.e. the conviction it is true) is smaller th[a]n that of the premisses” (Frankowski 2004, 41).

This approach can be developed further. By a canonical definition of entailment one may understand a definition of entailment as a relation that preserves membership in a certain set of algebraic values either from the premises to the conclusion(s) of inferences, or from the conclusion(s) to the premises. Every such set may be associated with some logical value, and the corresponding entailment relations will be Tarskian: since preservation of a logical value from the conclusion(s) to the premises means that if the (every) conclusion possesses the value, then so does at least one of the premises, whereas preservation from the premises to the conclusion(s) means that if every premise possesses the value, then so does (at least one of) the conclusion(s). The relations of q-entailment and p-entailment, for example, are not canonical as opposed to t-entailment and f-entailment. Two logical values are independent of each other iff the canonically defined entailment relations determined by these values are distinct.

This idea of multiple logical truth values has been developed in Wansing and Shramko 2008. Although it is neither Malinowski's nor Suszko's understanding of logical truth values, it may quite appropriately be expressed by using Malinowski's term “inferential many-valuedness”. One may consider the notion of a generalized valuation system (an n-valued k-dimensional matrix, or just k-matrix) which is a structure M = ⟨V, D1,…, Dk, {fc: cC}⟩, where V is a non-empty set of cardinality n (2 ≤ n), 2 ≤ k, every Di (1 ≤ ik) is a non-empty proper subset of V, the sets Di are pairwise distinct, and every fc is a function on V with the same arity as c (cf. Wójcicki 1988, 189; Czelakowski 2001, 410 ff.). A logic may then be said to be logically (or inferentially) k-valued if it is a language together with k canonically defined and pairwise distinct entailment relations on (the set of formulas of) this language. Each of these k entailment relations is Tarskian.

Note that interpretations of distinguished sets of algebraic values need not appeal to truth or falsity. In a series of papers, Jennings, Schotch, and Brown, for example, have argued that paraconsistent logic can be developed as a logic that preserves a degree of incoherence from the premises to the conclusion of a valid inference, see Brown and Schotch 1999, Jennings and Schotch 1984, and the references given there.

The above considerations on inferential many-valuedness are of interest also because they affect the definition of the notion of a logical system. Even if one is not committed to the idea of entailment as preservation of semantical values from the premises to the conclusion(s) of an inference (or vice versa), it may still be quite natural to conceive of a logical system as comprising more than only one entailment relation.

This is a file in the archives of the Stanford Encyclopedia of Philosophy.