Emmanuel Chemla

Paul Egré

Suszko's problem: mixed consequence and compositionality

Keywords: Suszko's thesis, truth value, logical consequence, mixed consequence, compositionality, truthfunctionality, many-valued logic, algebraic logic, substructural logics, regular connectives 1

Suszko's problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski's structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. In this paper we give a more systematic perspective on Suszko's problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that (intersective) mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos and Wansing, for logics with various structural properties (reflexivity, transitivity, none, or both). We strengthen these results into exact rank results for non-permeable logics (roughly, those which distinguish the role of premises and conclusions). We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties.

Suszko's problem

This paper deals with an issue famously raised by the Polish logician Roman Suszko concerning many-valuedness in logic. The issue, which we call Suszko's problem, may be presented as follows: given a language and a consequence relation between the formulae of that language, satisfying some general structural constraints, what is the minimum number of truth values required to characterize the relation semantically? line with [START_REF] Andréka | Algebraic logic[END_REF][START_REF] Bloom | Some theorems on abstract logics[END_REF][START_REF] Font | Generalized matrices in abstract algebraic logic[END_REF][START_REF] Jansana | Algebraic propositional logic[END_REF][START_REF] Wójcicki | Theory of logical calculi: basic theory of consequence operations[END_REF], and coming from a different angle (see [START_REF] Chemla | Characterizing logical consequence in many-valued logic[END_REF]. Like French and Ripley, and like Blasio, Marcos and Wansing, we will take advantage of systematic correspondences between the structure of arguments and their semantic interpretations. Our perspective and contribution differ in three ways.

First, the notion of mixed consequence is explicitly given a central role in our inquiry, both as a topic of study and as a technical tool. In section 3, in particular, we prove that intersections of mixed consequence relations constitute an exact counterpart of the structural property of monotonicity. This fact, although implicit in the precursor works of [START_REF] Humberstone | Heterogeneous logic[END_REF] and indeed of [START_REF] French | Valuations: bi, tri, and tetra[END_REF], and [START_REF] Blasio | An inferentially many-valued two-dimensional notion of entailment[END_REF], was not brought to the fore in exactly that form (see in particular [START_REF] Chemla | Characterizing logical consequence in many-valued logic[END_REF] for a closely related result, but missing the simpler characterization). Secondly, we strengthen these results into exact rank results for non-permeable logics, roughly, those which distinguish the role of premises and conclusions: reflexive and transitive logics are of rank exactly 2, logics which are either reflexive or transitive but not both are of rank exactly 3, all others are of rank 4. Third, we give a specific attention to the issue of semantic compositionality. [START_REF] Suszko | The Fregean axiom and Polish mathematical logic in the 1920s[END_REF] pointed out that his reduction technique generally ends up in a semantics that fails compositionality, understood as truth-functionality (see [START_REF] Béziau | Sequents and bivaluations[END_REF][START_REF] Caleiro | Many-valuedness meets bivalence: Using logical values in an effective way[END_REF][START_REF] Caleiro | Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics[END_REF][START_REF] Font | Taking degrees of truth seriously[END_REF][START_REF] Marcos | What is a non-truth-functional logic?[END_REF] for discussions, and our refinements of the notion of compositionality below). This failure, as stressed by [START_REF] Font | Taking degrees of truth seriously[END_REF], makes it "difficult to call it a semantics, which makes the meaningfulness of his Reduction hard to accept". One of our goals in this paper is to clarify this limitation and go beyond it. We will extend the notion of reduction to prove that every compact logic made of connectives satisfying special properties (regular connectives) can be given a truth-functional semantics of the same 2/3/4 ranks depending on their structural properties.

Our work is organized as follows. In section 2, we introduce our framework and natural structural constraints usually imposed on a logic (substitution-invariance, monotonicity, reflexivity, and transitivity), as well as natural semantic constraints on the interpretation of a logic (e.g., compositionality, truth-functionality). In section 3, we prove representation theorems establishing the tight mapping between structural properties and semantic properties. In the first part of section 4, we then apply the Scott-Suszko reduction technique to derive analogues of the Suszko results obtained by French and Ripley, as well as Blasio, Marcos and Wansing. In the rest of section 4, we turn to the problem of truth-functionality. We introduce a novel type of reduction, namely a construction that transforms a semantics into another semantics with fewer truth values, while preserving both the consequence relation and truth-functionality. We call this the truthfunctional Scott-Suszko reduction, allowing us to isolate a natural class of logics -compact regular logics-over which the resulting semantics is truth-functional. This modification is substantive: it brings further significance to Suszko's thesis by proving not only that the notion of logical many-valuedness can be meaningful beyond two values, but also that reduction of many values to a minimum is not necessarily a threat on truth-functionality. In effect, we prove that under appropriate circumstances, the truth values needed to preserve the consequence relation are sufficient to preserve truth-functionality as well.

Framework

This section lays out the basic ingredients for the rest of this paper. We define a logic in syntactic terms, and right away highlight the main structural constraints on consequence relations isolated by Tarski and the Polish school (see [START_REF] Bloom | Some theorems on abstract logics[END_REF][START_REF] Tarski | On some fundamental concepts of metamathematics[END_REF][START_REF] Wójcicki | Matrix approach in methodology of sentential calculi[END_REF][START_REF] Wójcicki | Theory of logical calculi: basic theory of consequence operations[END_REF], namely: substitution-invariance, monotonicity, reflexivity and transitivity. Those properties play a central role in Suszko's reduction. We then articulate what we mean by a semantics for a logic, and state various semantic properties which we will prove to be counterparts of those structural properties in section 3.

Syntactic notions

Logic

Throughout the paper, we work within a multiple-premise multiple-conclusion logic, following the tradition of [START_REF] Gentzen | Investigations into logical deduction[END_REF], [START_REF] Scott | Completeness and axiomatizability in many-valued logic[END_REF] and [START_REF] Shoesmith | Multiple-conclusion logic[END_REF]. One of the reasons for doing so is simplicity in that premises and conclusions are handled symmetrically. This choice is not neutral and some of our results are likely to differ in a multi-premise single-conclusion setting. We leave that issue aside, and define a logic as follows:

Definition 2.1 (Logic). A logic is a triple L, C, , with L a language (set of formulae), C a (possibly empty) set of connectives, and a consequence relation, what we call a formula-relation (i.e. a subset of P (L) × P (L), also called a set of arguments, where each argument is a relation between sets of formulae).

Definition 2.2 (Sentential Language). A language is called sentential if it is obtained in the usual way from a set A of atomic formulae (a subset of L) and a set C of connectives, that is formulafunctions of type c : L n -→ L. A logic is called sentential if it is defined over a sentential language.

We will only consider sentential languages and sentential logics in what follows.

Definition 2.3 (Substitution). A substitution σ for a sentential language is an endomorphism of L, such that for every formula F(p 1 , ..., p n ) constructed from the atoms p i , F[σ] = F(σ(p 1 ), ..., σ(p n )).

Fundamental structural properties

Definition 2.4 (Substitution-invariance). A consequence relation is substitution-invariant iff for every substitution σ:

If Γ ∆, then Γ[σ] ∆[σ] Definition 2.5 (Monotonicity). A consequence relation is monotonic if: ∀Γ 1 ⊆ Γ 2 , ∆ 1 ⊆ ∆ 2 : Γ 1 ∆ 1 implies Γ 2 ∆ 2 .
Definition 2.6 (Reflexivity). A consequence relation is reflexive if for every formula F:

F F Definition 2.7 (Transitivity). A consequence relation is transitive iff: if Γ ∆, then there are Γ ⊇ Γ, ∆ ⊇ ∆ such that Γ ∆ and Γ ∪ ∆ = L.
There are numerous ways of defining transitivity, in particular in multi-conclusion settings. They are extensively reviewed in [START_REF] Ripley | On the 'transitivity' of consequence relations[END_REF]. The definition proposed above is the strongest definition from this survey, this is the one that will prove relevant in the next section.2

Definition 2.8. We say that a logic is substitution-invariant / monotonic / reflexive / transitive if it has a substitution-invariant / monotonic / reflexive / transitive consequence relation, respectively.

A further structural constraint: non-permeability

We have introduced structural properties from the Tarskian tradition, which are supposed to delineate what an appropriate consequence relation may be. These properties, however, do not exclude pathological consequence relations, such as the null and the universal consequence relations, or relations for which there would be no non-empty Γ and ∆ such that Γ ∆. We introduce here a formal property that a consequence relation should not have: Definition 2.9 (Permeability). A consequence relation is permeable if it is left-to-right or right-to-left permeable, in the following sense:

Left-to-right permeability: ∀Γ, ∆, Σ : Γ, Σ ∆ ⇒ Γ Σ, ∆ Right-to-left permeability: ∀Γ, ∆, Σ : Γ Σ, ∆ ⇒ Γ, Σ ∆ By extension, a logic is called permeable if its consequence relation is permeable.
If a logic is not permeable, then its consequence relation is neither universal nor trivial (when negated, either constraint implies non-triviality as per the antecedent and non-universality as per the denied consequent). We may describe a permeable consequence relation as one that would confuse the role of premises with the role of conclusions, or the reverse. But we need to introduce more semantic machinery before we describe the full virtue of this constraint (see Theorem 2.28).

Semantic notions

Semantics

We call a semantics a structure that interprets each of the components of a logic, namely formulae, connectives, and the consequence relation. The natural semantic counterpart for formulae are propositions, understood as functions from worlds to truth values. The semantic counterpart of a connective is therefore a function from propositions to propositions, and the semantic counterpart of a consequence relation is a relation between sets of propositions. But functions and relations over sets of propositions may be obtained from functions and relations over sets of truth values: just like connectives may be interpreted through truth-functions, we show that consequence relations may be interpreted algebraically through what we call truth-relations. An overview of the definitions to be introduced is given in Table 1.

Semantics with propositions

Definition 2.10 (Semantics). A semantics for a logic is a triple V, W, _ , with

• V a set of truth values,
• W a set of worlds,

• _ an interpretation function, which associates to every formula F in L a proposition F , defined as a function from worlds to truth values, to every n-ary connective c in C a function c from n-tuples of propositions to propositions, and to it associates a relation between sets of propositions (henceforth |=).

Semantics can match syntax to a variable extent. Below are two main properties which pertain both to the connectives and to the consequence relation: Definition 2.11 (Compositionality, Soundness-and-completeness, Adequacy). Given a logic and a semantics:

• The interpretation of an n-ary connective c is compositional if for all formulae F 1 , ..., F n c(F 1 , ..., F n ) = c ( F 1 , ..., F n )

Semantics from truth values

So far, the consequence relation and the connectives have been interpreted at the level of propositions. But a semantics may intrinsically follow from a definition of connectives and consequence relations at the level of truth values, and uniformly so world by world:

Definition 2.12 (Truth-Functionality, Truth-Relationality, Truth-Interpretability). Given a logic and a semantics:

• The interpretation of an n-ary connective c is truth-functional if there is a truth-function [[[c]]],
that is a function from n truth values to truth values (of type V n → V) such that:

for all propositions P 1 , ..., P n : ∀v ∈ W : c (P 1 , ..., 1. Summary of the properties introduced in parallel for connectives and consequence relations (or both, when combined at the level of their logic). These properties belong to the level of propositions, or truth values (or both, if we consider the conjunction of the properties at the proposition level and its associate at the truth-value level).

P n )(v) = [[[c]]](P 1 (v), ..., P n (v))
Note that according to our definitions, it would be possible for a semantics to be truthfunctional without being compositional proper (for example, it could happen that for all v,

( ¬ F )(v) = [[[¬]]]( F (v)
), but ¬ F = ¬F , simply note that the first truth-functional equality does not involve ¬F). When the semantics is defined directly at the truth-value level, however, truth-functionality directly implies compositionality (and therefore coincides with truthcompositionality), as the following shows.

Fact 2.15. An efficient, and usual way to determine a truth-functional semantics is to define the interpretation function for formulae only on atoms and extend it to all formulae by defining directly the truth-functions [[[C]]] for all connectives:

C(F 1 , ..., F n ) is defined as ∀v : C(F 1 , ..., F n ) (v) := [[[C]]]( F 1 (v), ..., F n (v))
Similarly, a truth-relational semantics may be obtained by choosing a truth-relation |≡ and then deriving the interpretation of the consequence relation |= as:

Γ |= ∆ iff (def) ∀v : Γ (v) |≡ ∆ (v)

Truth-relationality

We pause on the notion of truth-relationality, which is the least standard (see [START_REF] Chemla | Characterizing logical consequence in many-valued logic[END_REF].

First, we note that in the absence of other constraints, the truth-relationality of some sound and complete semantics for a logic is always guaranteed. In fact, the conjunction of all properties above can always be achieved:

Fact 2.16. Every sentential logic has a truth-adequate semantics.

Proof. Given a logic, let V := L, W := {v 0 }, F (v 0 ) := F, and let [[[c]]] be c itself for every connective and |≡ be itself. By construction, V, W, _ is a truth-interpretable semantics, compositional ( C ( F 1 , ...,

F n ) = C(F 1 , ..., F n ) = C(F 1 , ..., F n ) ) and sound and complete (Γ ∆ iff for all v ∈ W, Γ (v) |≡ ∆ (v)).
Despite that result, truth-relationality is not unsubstantial, and it certainly does not follow from the other properties a semantics may have.

Fact 2.17. Not every adequate semantics that is truth-functional is truth-relational.

Proof. Many degenerated examples could be used to demonstrate the result, but let us consider the richer case of so-called supervaluationism (viz. Cobreros et al., 2012a). Consider the language L of standard propositional logic over a denumerable set of atoms A with set of connectives C = {¬, ∨, ∧}. We can define the so-called supervaluationist semantics on L, which is exactly like the classical bivalent strong semantics over L, with W as the set of all valuations (see 2.18), except that the relation is interpreted as:

Γ |= sv ∆ iff (def) ∀I ⊆ W : (∀F p ∈ Γ : ∀v ∈ I : F p (v) = 1) ⇒ (∃F c ∈ ∆ : ∀v ∈ I : F c (v) = 1)
Supervaluationist consequence induces a supervaluationist sv syntactic consequence relation over L (Γ sv ∆ iff (def) Γ |= sv ∆ ). The supervaluationist semantics is sound and complete by construction, it is compositional and truth-functional just like classical logic. But there could be no truth-relation. The reason is as follows:

• |= sv p , ¬p . To prove this, call the (empty) premise set Γ and the conclusion set ∆. Even though ∀F p ∈ Γ :

∀v ∈ W : F p (v) = 1 (trivially satisfied because Γ = ∅), it is not the case that ∃F c ∈ ∆ : ∀v ∈ W : F c (v) = 1.

• |= sv p ∨ ¬p , p ∧ ¬p , this is because p ∨ ¬p is the constant proposition with value 1.

• For all valuations, { p (v), ¬p (v)} = {0, 1} = { p ∧ ¬p (v), p ∨ ¬p (v)}.

The three facts above are incompatible with the possibility of a truth-relation, which would sometimes have to hold for {0, 1} in its second argument and sometimes not.

The semantics we proposed for supervaluationism is therefore compositional and truth-functional, but not truth-relational. The logic it corresponds to may have a truth-relational semantics, but this may require another set of truth values and another set of worlds. A similar example can be found in [START_REF] Chemla | Characterizing logical consequence in many-valued logic[END_REF], with a discussion of a logic and a natural semantics for it that is adequate, truth-functional but not truth-relational, namely the trivalent semantics ss ∪ tt for, e.g., some propositional language (the union of strong Kleene consequence and LP consequence).

Fundamental semantic properties

We now state several fundamental properties of a semantics. We will refer to these properties as semantic properties for short. In the next section, we will prove that they are parallel to the structural constraints we stated for a logic (an overview of the parallelism is given in Table 2).

Definition 2.18. A semantics for a sentential logic is called valuational if its set of worlds is the set of valuations, functions from atoms to truth values, and if for all atoms p and all valuations v, p (v) = v(p).

Fact 2.19. For a truth-compositional semantics it is also appropriate (and will be useful) to interpret worlds as valuations: the truth value assigned to a formula in a given world is entirely determined by the truth values assigned to the atoms (involved in the formula) in that world, by way of the successive application of the truth-functions of the connectives that make up the formula. As a consequence, one may drop redundant worlds/valuations that would assign the same values to all atoms. Truth-compositionality does not entail valuationality, however, because W may not cover the whole set of possible valuations.

Notation 2.20. For a valuational semantics V, V A , _ , we may drop from the notation the set of worlds W = V A and refer to it as V, _ . Furthermore, we may refer to F (v) as v(F), by extension of the notation for atomic formulae, whenever the interpretation of worlds as valuations is warranted (for valuational semantics or truth-compositional semantics as in Fact 2.19).

Definition 2.21 (Strong semantics). We say that a semantics is strong if it is truth-adequate and valuational (all the properties above).

Definition 2.22 (Mixed truth relation). A truth-relation |≡ over a set of truth values V is called mixed if there are two sets D p and D c included in V such that for all sets of values γ and δ:

γ |≡ δ iff γ ⊆ D p entails δ ∩ D c = ∅ When those two sets exist, the relation is written |≡ D p ,D c . Definition 2.23. A mixed truth-relation |≡ D p ,D c is called p-mixed iff D p ⊆ D c . Definition 2.24. A mixed truth-relation |≡ D p ,D c is called q-mixed iff D c ⊆ D p . Definition 2.25. A truth-relation |≡ is called pure if it is a mixed relation such that D p = D c , hence
if it is both p-mixed and q-mixed.

Definition 2.26. A semantics is called intersective mixed (respectively intersective p-mixed / intersective q-mixed / intersective pure) if it is truth-relational and its truth-relation is an intersection of mixed relations (respectively of p-mixed / q-mixed / pure relations).

A mixed semantics is trivially intersective mixed, but the converse is not true: an intersection of mixed semantics is not in general expressible as a mixed semantics, see [START_REF] Chemla | Characterizing logical consequence in many-valued logic[END_REF] Theorem 2.15, with ss ∩ tt as a representative case in 3-valued semantics.

A further semantic property: polarization

Our definitions so far put no structure on the set of truth values. On an inferentialist perspective, however, it is often desirable to single out two special truth values, True and False, matching propositions with specific inferential roles. The value False is attached to the principle that from a contradictory proposition anything follows (ex falso quodlibet), but also to the principle that if an argument is not valid, then the addition of a contradiction to the conclusions won't make it valid. The roles for the True are dual: a tautology should follow from any premise whatsoever, but if an argument is not valid, adding it among the premises will not make it valid either. Using 1 and 0 to represent the True and the False, those principles correspond to:

(T1) ∀γ, δ : γ |≡ δ, 1 (T2) ∀γ, δ : γ, 1 |≡ δ implies γ |≡ δ (F1) ∀γ, δ : γ, 0 |≡ δ (F2) ∀γ, δ : γ |≡ δ, 0 implies γ |≡ δ
However, none of the semantic properties we have introduced so far for truth-relations guarantees that there will be truth values playing the roles of the True and the False. Consider for instance a relation of the form |≡ {α},{β} , requiring that when all premises take the value α, some conclusion must take the distinct value β. The value β is the only one that could follow from any set of values (|≡ β), but it is not the case that adding it as a premise has no effect on validity (e.g., α |≡ ∅, but α, β |≡ ∅). One can construct other odd truth-relations in which there is no room for special values such as True and False. The following property blocks some of these possibilities: The virtues of polarization become especially apparent when put in parallel with the structural property introduced in Definition 2.9. There, we argued that permeable logics were odd, even if the standard Tarskian constraints on consequence relations do not rule them out. The following result shows that ruling out permeability at the structural level involves the admission of values playing the role of True and False at the semantic level.

Theorem 2.28. A sound and complete intersective mixed semantics for a non-permeable logic is polarized.

Proof. Consider a sound and complete intersective mixed semantics for a non-permeable logic, such that |≡= λ∈Λ |≡ D λ p ,D λ c . The failure of left-to-right permeability corresponds to F-polarization, and the failure of right-toleft permeability corresponds to T-polarization. Choose Γ, ∆, Σ such that Γ, Σ ∆ and Γ Σ, ∆. Hence, there is some world w such that: Γ (w) |≡ Σ, ∆ (w) and Γ, Σ (w) |≡ ∆ (w). It follows that there is some member

|≡ D λ p ,D λ c of |≡ such that: Σ (w) ∩ D λ c = ∅ and Σ (w) ⊆ D λ p , i.e.
there is a truth value, in fact any of those in Σ (w), which is not in D λ p , and not in D λ c either. This proves F-polarization. Similarly, choose Γ, ∆, Σ such that Γ Σ, ∆ and Γ, Σ ∆. Hence, there is some world w such that: Γ, Σ (w) |≡ ∆ (w) and Γ (w) |≡ Σ, ∆ (w). It follows that there is some member

|≡ D λ p ,D λ c of |≡ such that: Σ (w) ⊆ D λ p and Σ (w) ∩ D λ c = ∅, i.e. D λ p ∩ D λ c = ∅, which proves T-polarization.
This result is the first connection we establish between a structural property and a semantic property. In the next section, we proceed to flesh out more systematic parallelisms between semantic properties and structural properties, a summary of which is given in Table 2.

Correspondence between structural and semantic properties

In this section we state and prove representation theorems establishing a systematic correspondence between structural properties of a logic and fundamental properties of a semantics it may be associated with. We start with a semantic characterization of substitution-invariance. We find antecedent characterizations, in particular in the work of Wójcicki (see [START_REF] Bloom | Some theorems on abstract logics[END_REF][START_REF] Wójcicki | Matrix approach in methodology of sentential calculi[END_REF][START_REF] Wójcicki | Theory of logical calculi: basic theory of consequence operations[END_REF], but in the context of Tarskian consequence relations (using logical matrices). Our result, on the other hand, offers a semantic counterpart of substitution-invariance, singled out from other Tarksian properties. The next result, Theorem 3.2, may be viewed as the cornerstone, for it shows that monotonicity, among all of Tarski's constraints, corresponds tightly to mixed consequence. We then inspect further Tarskian properties, reflexivity, transitivity and their conjunction, which show up as particular types of mixed consequence. We give a summary of the main correspondences in Table 2.

Closely related results were stated independently by French and Ripley (2018) (Theorem 2), and by [START_REF] Blasio | An inferentially many-valued two-dimensional notion of entailment[END_REF] (Theorem 10, Theorem 11), see also [START_REF] Humberstone | Heterogeneous logic[END_REF] for a precursor. Even though formulated and proved differently, some of these results are exactly equivalent in so far as substitution-invariance is dropped (an exception is [START_REF] Blasio | An inferentially many-valued two-dimensional notion of entailment[END_REF]) and, correspondingly, in so far as its semantic counterpart valuationality is dropped (replace strong semantics with truth-adequate semantics in our formulations; we thus give two versions of those results in what follows, versions marked with a prime drop the substitution-invariance assumption). Overall, they establish a similar correspondence between structural properties of consequence relations and semantic properties.

Logic

Substitution-invariant Monotonic Reflexive Transitive

Tarskian

Semantics Strong Intersective Mixed Intersective p-Mixed Intersective q-Mixed Intersective Pure Table 2.
Correspondence between structural properties of a logic and semantic properties of semantics for it. The properties should be read cumulatively from top to bottom, and existentially from left to right: substitution-invariant logic = existence of a strong semantics; (substitution-invariant + monotonic) logic = existence of a (strong + intersective mixed) semantics; etc.

Substitution-invariance = Strong semantics

Theorem 3.1. A logic is substitution-invariant iff it has a strong semantics.

Proof. (⇐) Assume that a logic L, C, has a strong semantics V, _ . Suppose Γ ∆, and σ is a substitution. Then: ∀v : v(Γ) |≡ v(∆) (by truth-relationality and adequacy), hence

∀v : v • σ(Γ) |≡ v • σ(∆) (by valuationality: if v is a valuation, then v • σ is a valuation); moreover ∀v : v(Γ[σ]) |≡ v(∆[σ]) (v • σ(A) = v(A[σ]
) for all formulae A, by valuationality for A an atom, and by truth-functionality for the induction for more complex formulae), so Γ[σ] ∆[σ] (by truth-relationality and adequacy).

(⇒) Assume that a logic L, C, is subtitution-invariant. We define a strong semantics V,

_ with V = L, [[[ ]]] = , [[[c]]] = c.
Valuationality, truth-interpretability and compositionality are built in (see Fact 2.15) by completing the semantics: we consider all valuations and assign an interpretation inductively for complex formulae. Let us prove soundness and completeness:

Γ ∆ iff ∀σ : Γ[σ] ∆[σ] (by substitution-invariance), iff ∀σ : σ(Γ) |≡ σ(∆) (by construction for all F: σ(F) = F[σ]
here), and substitutions are worlds/valuations (worlds here are all functions from A to the set of truth values, which is L here).

Monotonic relations = intersection of mixed relations

Theorem 3.2. A logic is substitution-invariant and monotonic iff it has a strong intersective mixed semantics.

Theorem 3.2 . A logic is monotonic iff it has a truth-adequate intersective mixed semantics.

Proof. (⇐) Assume that we have a strong intersective mixed semantics. Substitution-invariance follows from Theorem 3.1. The monotonicity of the truth-relation and therefore of the consequence relation is straightforward based on Definition 2.22.

(⇒) Consider a substitution-invariant and monotonic logic. We will construct a strong and intersective mixed semantics. For this, we use a method that closely follows methods attributed to Adolph Lindenbaum, used by, e.g., Tarski and Wójcicki and described in, e.g., [START_REF] Bloom | Some theorems on abstract logics[END_REF]; [START_REF] Surma | On the origin and subsequent applications of the concept of the Lindenbaum algebra[END_REF]. Take V = L and let the interpretation function _ on formulae and connectives be as in Theorem 3.1 under (⇒). Note λ = (Γ, ∆) such that Γ ∆. Then define |≡ λ as the mixed consequence truth-relation on the sets: D λ p = Γ and D λ c = V \ ∆. Define |≡ as the intersection of these mixed consequence relations (to account for the universal consequence relation, i.e. with no Γ ∆: we will consider that it is indeed the intersection of an empty set of mixed consequence relations, alternatively any semantics with an empty set of worlds W would be appropriate). The resulting semantics is valuational, compositional, truth-interpretable and intersective mixed, by construction. We can show that it is sound and complete for the logic, in the sense that Γ ∆ iff ∀v, ∀λ : v(Γ) |≡ λ v(∆).

• Assume Γ ∆. Then take λ = (Γ, ∆), v the identity valuation, it is clear that v(Γ) |≡ λ v(∆) and therefore that it's not the case that ∀λ : ∀v : v(Γ) |≡ λ v(∆).

• Assume Γ ∆. Then suppose it's not the case that ∀λ , ∀v : v(Γ) |≡ λ v(∆). That is, there is λ = (Γ , ∆ ) such that Γ ∆ and v such that v(Γ) ⊆ Γ and v(∆) ⊆ ∆ . But v(Γ) and v(∆) are simply obtained by atomic substitutions in Γ and ∆, and therefore v(Γ) v(∆) holds by substitution-invariance. By monotonicity we would then obtain that Γ ∆ , which was excluded.

The proof of the primed version is obtained similarly, by considering the same construction but reduced to a single valuation, the identity valuation, as in Fact 2.16.

Monotonic + reflexive relations = intersection of p-mixed relations

Theorem 3.3. A logic is substitution-invariant, monotonic and reflexive iff it has a strong intersective p-mixed semantics.

Theorem 3.3 . A logic is monotonic and reflexive iff it has a truth-adequate intersective p-mixed semantics.

Proof. (⇐) Clearly every p-mixed consequence relation is reflexive, and so is an intersection of p-mixed relations. (⇒) That is because in the previous proof, we take |≡ (Γ,V \∆) for Γ ∆, but if the relation is reflexive the latter requires that

Γ ∩ ∆ = ∅, therefore Γ ⊆ V \ ∆, hence D λ p ⊆ D λ c
, making the relation p-mixed for every λ.

The proof of the primed version is obtained similarly, by considering the same construction but reduced to a single valuation, the identity valuation, as in Fact 2.16.

Monotonic + transitive relations = intersection of q-mixed relations

Theorem 3.4. A logic is substitution-invariant, monotonic and transitive iff it has a strong intersective q-mixed semantics.

Theorem 3.4 . A logic is monotonic and transitive iff it has a truth-adequate intersective q-mixed semantics.

Proof. (⇐) Consider a strong intersective q-mixed semantics, and Γ ∆.

\ (Γ )) ∩ D λ c ⊆ v(L \ (Γ )) ∩ D λ p = ∅, since D λ c ⊆ D λ p .
(⇒) Now consider a substitution-invariant, monotonic and transitive logic. We can construct a valuational and intersective q-mixed truth semantics. We will use the same type of 'Lindenbaum' construction as used in the proof of Theorem 3.2, but we will only consider a subset of the truth-relations for the intersection. Consider the λ = ( Γ, ∆) such that Γ ∆ but now also Γ ∪ ∆ = V. We will consider |≡ Λ , the intersection of the |≡ λ s defined as the mixed relation with D λ p = Γ and D λ c = V \ ∆ (as before). The rest of the proof amounts to showing soundness and completeness, it relies on three results:

1. The |≡ λ s are q-mixed: since Γ ∪ ∆ = V, (V \ ∆) ⊆ Γ, i.e. D λ c ⊆ D λ p .
2. If Γ ∆ then ∀v : v(Γ) v(∆): this holds for |≡ Λ (see above) and therefore also for |≡ Λ which is weaker since it is an intersection of fewer truth-relations.

3. If Γ ∆, then by transitivity we can find λ = ( Γ, ∆) such that Γ ∆ and

Γ ∪ ∆ = V. Γ |≡ ( Γ,V \ ∆) ∆: this is so because by construction Γ |≡ ( Γ,V \ ∆) ∆ and Γ ⊆ Γ and ∆ ⊆ ∆.
The proof of the primed version is obtained similarly, by considering the same construction but reduced to a single valuation, the identity valuation, as in Fact 2.16.

Monotonic + reflexive + transitive = intersection of pure relations

Theorem 3.5. A logic is substitution-invariant, monotonic, reflexive and transitive iff it has a strong intersective pure semantics.

Theorem 3.5 . A logic is monotonic, reflexive and transitive iff it has a truth-adequate intersective pure semantics.

Proof. (⇐) follows from the previous two theorems. (⇒) Consider the construction from the proof of Theorem 3.4. The λ must be compatible with reflexivity, that is Γ ∩ ∆ = ∅. Hence we obtain not only that Γ ⊆ (V \ ∆) as in Theorem 3.4, but also necessarily that Γ ⊇ (V \ ∆) as in Theorem 3.3.

The proof of the primed version is obtained similarly, by considering the same construction but reduced to a single valuation, the identity valuation, as in Fact 2.16.

Ranks and truth-functional reduction

What is the least number of values needed to semantically represent a logic? Suszko's response to the question was two. Malinowski answered three, but relaxing some of the structural constraints that Suszko took for granted for a consequence relation. On our view, the answer to this question depends not just on the structural desiderata that are put on a consequence relation, but also on the desiderata that are placed on the semantics. In this section, we start out by reviewing Suszko's proposal: we basically explain the sort of reduction that both Scott and Suszko used in order to reduce truth values to a minimum 'logical' rank [START_REF] Scott | Completeness and axiomatizability in many-valued logic[END_REF][START_REF] Suszko | The Fregean axiom and Polish mathematical logic in the 1920s[END_REF]. As observed by several authors and first by Suszko himself [START_REF] Béziau | Sequents and bivaluations[END_REF][START_REF] Caleiro | Dyadic semantics for many-valued logics[END_REF][START_REF] Caleiro | Many-valuedness meets bivalence: Using logical values in an effective way[END_REF][START_REF] Font | Taking degrees of truth seriously[END_REF][START_REF] Marcos | What is a non-truth-functional logic?[END_REF][START_REF] Shramko | Truth and falsehood: An inquiry into generalized logical values[END_REF][START_REF] Suszko | The Fregean axiom and Polish mathematical logic in the 1920s[END_REF], this kind of reduction on the number of algebraic truth values meets weak demands, in particular regarding compositionality (see Appendix A for a more nuanced view). Although the reduction does not respect truth-compositionality in general, we show that a modification of it does so for compact logics operating with what we call regular connectives. In an Appendix, Appendix C, we investigate another notion of reduction, namely grouping reduction, which does preserve many of the relevant structural properties we are interested in in all cases, but also incurs limitations.

Importantly, in what follows we focus mostly on notions of rank, namely the minimum number of truth values needed to represent a logic. We do not present actual Suszko reductions of specific logics for that matter, but mostly use the notion toward irreducibility arguments. In that regard, our perspective differs from the important work of [START_REF] Caleiro | Many-valuedness meets bivalence: Using logical values in an effective way[END_REF] and [START_REF] Caleiro | Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics[END_REF], who propose a constructive method to compute Suszko reductions from arbitrary semantics. Their approach is in a sense more general, because it is not restricted to logics for which the reduction preserves truth-functionality, and it is output-oriented. Our goal is different, however, and input-oriented: it is to identity constraints on the connectives of the base logic that will deliver a truth-functional reduction. This is what leads us to isolate the notion of a regular logic.

The Suszko rank and the Scott-Suszko reduction

Definition 4.1 (Suszko rank). The Suszko rank of a logic is the least cardinal of truth values needed to get a sound and complete intersective mixed semantics for that logic.

The restriction to intersective mixed semantics was not explicitly part of the issue in some past descriptions. But it is unproblematic given the results above for monotonic logics. Furthermore, previous results were always stated through mixed semantics, and we therefore propose immediately a stronger notion of rank, which will prove not to be very different: Definition 4.2 (mixed Suszko rank). The mixed Suszko rank of a logic is the least cardinal of truth values needed to get a sound and complete mixed semantics for that logic.

Scott and Suszko came up with a method which outputs ranks 2, 3 or 4, depending on the structural constraints assumed to begin with. In their original approach, restricted to rank 2, this method consists in defining what Suszko calls logical valuations (and Scott truth valuations). Logical valuations are functions from formulae to the values {1, 0}, defined on the basis of standard algebraic valuations, namely functions from formulae to algebraic truth values. A logical valuation is derived from an algebraic valuation h and a pure truth-relation, that is a set of designated algebraic values: it assigns a formula F the value 1 if h assigns F a designated value, and 0 otherwise. In our framework, the reduction can be described as follows: Definition 4.3 (Scott-Suszko reduction). Consider some intersective mixed semantics V, W, _ for a logic, assuming that the truth-relation is given by the intersection of the |≡ D λ p ,D λ c for λ = (D λ p , D λ c ) in Λ. Its associated Scott-Suszko reduction is the semantics defined as follows, where we leave aside the interpretation of the connectives (which may be interpreted arbitrarily for now).

V

* := {1, # p , # c , 0}, W * := Λ × W, |≡ * :=|≡ {1,# p },{1,# c } , F * (λ, v) := t λ ( F (v)), with t λ : V -→ V * α -→          1 if α ∈ D λ p ∩ D λ c 0 if α ∈ D λ p ∪ D λ c # p if α ∈ D λ p \ D λ c # c if α ∈ D λ c \ D λ p
Theorem 4.4. The Scott-Suszko reduction of a sound and complete, intersective mixed semantics is a sound and complete, mixed semantics.

⇔: ∀(λ, v) ∈ W * : if t λ ( Γ (v)) ⊆ {1, # p }, then t λ ( ∆ (v)) ∩ {1, # c } = ∅ ⇔: ∀(λ, v) ∈ W * : if Γ (v) ⊆ D λ p then ∆ (v) ∩ D λ c = ∅ ⇔: ∀v : Γ (v)( Λ |≡ D λ p ,D λ c ) ∆ (v) ⇔: Γ ∆ (in
virtue of the truth-relationality and soundness and completeness of the input semantics).

The following corollary puts upper bounds on Suszko rank for monotonic consequence relations with various syntactic properties. This is the exact analog of Corollary 1 in [START_REF] French | Valuations: bi, tri, and tetra[END_REF], and of statements (M1) and (M2) in [START_REF] Blasio | An inferentially many-valued two-dimensional notion of entailment[END_REF]:

Corollary 4.5 (Maximum Suszko rank theorems). A monotonic consequence relation is of Suszko rank:

• at most 2 if it is reflexive and transitive,

• at most 3 if it is transitive or reflexive,

• at most 4 in general. We can further show that these upper bounds are reached. Malinowski famously did it for rank 3 and transitive relations. The following gives an example of a 4-valued logic which is not further reducible.

Fact 4.6. There exist substitution-invariant monotonic logics of Suszko rank exactly 4.

Proof. Consider the language of propositional logic, the valuational semantics {0, 1, # p , # c }, _ such that |≡=|≡ {1,# p },{1,# c } . We may give an interpretation to connectives (e.g., conjunction and disjunction interpreted as min and max with 0 being lower than any other value, 1 being higher, and by definition min(# p , # c ) = 0, max(# p , # c ) = 1, negation could be defined as, e.g., ¬# p = ¬# c = 0). But most importantly, we add to the language four 0-ary connectives, which will receive constant truth-functions in this semantics. This semantics can be used to complement the language with a consequence relation The resulting logic cannot be given a truth-relational semantics with less than 4 semantic values.

Pick an intersective semantics. Given the syntactic properties of the formulae , ⊥, # p and # c , there are constraints on the truth values they may receive. For instance, requires that all the truth values received by be in all of the D λ c s, and the fact that requires that at least one truth value received by be outside of at least one D λ 0 c . Further similar constraints are given in the table below; each line corresponds to the constraints imposed on the truth values of the formula given in the first column, as derived from each of the statements between parentheses.

(∅

) : all values in all D c ( ∅): some value outside some D p ⊥ (⊥ ) : all values outside all D p ( ⊥) : some value in some D c # c (# c ) : all values outside all D p ( # c ) : all values in all D c # p (# p # p ): some value in a given D p but not in its D c counterpart It follows that the semantics has at least four values. First, it has a value x 1 in all D c s but outside some D p (first line). Second, it has a value x 2 outside all D p s but in some D c , this cannot be x 1 which is in some D p . Third, it has a value x 3 outside all D p s (hence it is not x 1 ) and outside all D c s (hence it is not x 2 ). Finally, it has a value x 4 in a given D p but not in its D c counterpart. This cannot be x 1 because x 1 is in all D c s, it cannot be x 2 or x 3 because they are both outside all D p s.

More generally, we can obtain an exact correspondence between mixed Suszko rank and structural properties for non-permeable logics: Corollary 4.7 (Exact Suszko rank theorems). A monotonic, non-permeable consequence relation is of mixed Suszko rank:

• exactly 2 if and only if it is reflexive and transitive,

• exactly 3 if and only if it is transitive or reflexive but not both,

• exactly 4 if and only if it is neither transitive nor reflexive.

Proof. Consider a truth-adequate mixed semantics of minimal rank for such a logic, we note its truth-relation |≡ D p ,D c . In virtue of Theorem 2.28, some truth value is in both D p and D c (call one of them 1), and some value is in neither (call one of them 0).

• The rank for all logics we are concerned with here is at least 2 (the set of truth values contains 0 and 1), and hence it is exactly 2 for reflexive and transitive logics (for which the rank is at most 2, by Corollary 4.5).

• If the semantics is two-valued, then the truth-relation is essentially of the form |≡ {1},{1} . Hence, the truth-relation is pure and by Theorem 3.5 , the logic is reflexive and transitive.

• If the semantics is 3-valued, call # the third truth value. In virtue of Theorem 2.28, the truth-relation will be either: |≡ {1},{1} , |≡ {1,#},{1} , |≡ {1},{1,#} or |≡ {1,#},{1,#} . It follows (Theorems 3.3 and 3.4 ) that the logic is reflexive or transitive (or both). Hence, logics which are neither transitive nor reflexive will be of rank at least 4, and given Corollary 4.5, of rank exactly 4.

Stronger notions of rank: the problem of truth-functionality

Suszko's focus was on the notion of a logical truth value, and only concerns the existence of a sound and complete semantics for a logic. However, one may demand more from a semantics, such as valuationality, compositionality and truth-functionality (see [START_REF] Font | Taking degrees of truth seriously[END_REF][START_REF] Marcos | What is a non-truth-functional logic?[END_REF]. Such properties may be seen as irrelevant in relation to logical truth values, insofar as they concern connectives more than consequence relations, but they surely are relevant in relation to the notion of an algebraic truth value. The Suzsko problem is about finding the rank of a logic, for more or less stringent notions of rank, depending on the demands of the semantics.

Definition 4.8 (Notions of rank). We introduce a sample of possible definitions of logical/algebraic rank, i.e. possible alternatives to Suszko rank from Definition 4.1:

• The compositional rank of a logic is the least cardinal of truth values needed to construct an adequate intersective mixed semantics for it.

• The truth-functional rank of a logic is the least cardinal of truth values needed to construct a truth-adequate intersective mixed semantics for it.

• The strong rank of a logic is the least cardinal of truth values needed to construct a strong intersective mixed semantics for it.

As we did for the Suszko rank and the mixed Suszko rank, we can define parallel and in fact very similar notions of mixed compositional rank, mixed truth-functional rank and mixed strong rank, by requiring in each of the above definitions that the semantics be mixed (and not only intersective mixed).

Compositionality in our general sense is a very weak demand and a very minor modification of Scott and Suszko's reduction guarantees it, in a trivial sense. We make this explicit in Appendix A, where the reader can also find a more direct construction to obtain a Scott-Suszko like semantics for a logic, without going through the trouble of the reduction of some pre-existing semantics (this is to be compared to French and Ripley's approach).

Hence, in the remainder of this paper, we will be interested in truth-functionality, and therefore in the truth-functional rank, not in the compositional rank. In general, the truth-functional rank is strictly more demanding than the Suszko rank for monotonic logics: even though the Suszko rank is at most 2 for monotonic, reflexive and transitive logics (Corollary 4.5), for a variety of such logics the truth-functional rank is higher than 2, as [START_REF] Suszko | The Fregean axiom and Polish mathematical logic in the 1920s[END_REF] emphasized, a point we illustrate with the following Fact: Fact 4.9. Some monotonic, reflexive and transitive logic has no bivalent, truth-adequate intersective mixed semantics.

Proof. Consider the language of propositional logic, with a trivalent semantics for the connectives and formulae (over the set {1, 1 2 , 0}), and the order-theoretic consequence relation, which here is simply based on the truth-relation |≡ {1},{1} ∩ |≡ {1, 1 2 },{1, 1 2 } . Also assume that it has a formula for the tautology (constant proposition of value 1) and one formula ⊥ for the contradiction (constant proposition of value 0). It is substitution-invariant, monotonic, reflexive and transitive, since it has a valuational, intersective pure semantics. Consider, for reductio, a bivalent truth-adequate semantics.

We first need to show that the truth-relation necessarily is the classical bivalent consequence truth-relation. The

truth-relation |≡ is intersective: it is the intersection of all |≡ D λ p ,D λ c such that D λ p |≡ (V \ D λ c
) (the reasoning is similar to the one in the proof of Theorem 3.2). One of the two values in V, call it 1, has to be in all D λ c s, for otherwise there could be no validity (

) and in some D λ p (otherwise it cannot be that ). One value, call it 0, has to be in no D λ p , for otherwise there could be no proposition that validates the empty set of conclusions (⊥ ) and outside of some D λ c (⊥ ). The truth-relation is therefore the intersection of some of the following: |≡ ∅,{1,0} , |≡ ∅,{1} , |≡ {1},{1,0} , |≡ {1},{1} . The last one is more stringent than any of the others, and it is the only one that allows for ⊥ (the other relations hold as soon as the premises and the conclusions are not empty). Hence, |≡ is |≡ {1},{1} .

Then let us consider what the truth-function for negation would be. For an atom p: p ¬p. Hence, there is a valuation in which p takes the value 1 and ¬p the value 0, i.e., [[[¬]]](1) = 0. Similarly, ¬p p, from which it follows that [[[¬]]](0) = 1. But under those assumptions, we should have p, ¬p, which does not hold. Hence, no such semantics can be truth-functional.

In fact, the discrepancy is more extreme, since even though the Suszko rank is at most 4 for any monotonic logics (Corollary 4.5), the strong rank is unbounded: Theorem 4.10. For any n, there is some monotonic logic of truth-functional rank n, i.e. with no truth-adequate semantics with fewer than n truth values.

Proof. Consider the language of propositional logic over a fixed set of connectives, with a semantics over n totally ordered truth values {α 1 , ..., α n }, some truth-functions for the connectives, and the associated order-theoretic consequence relation, defined as γ |≡ δ iff min(γ) ≤ max(δ). This truth-relation is also the intersection of all pure |≡ D i ,D i , with D i = {α k : k ≥ i}, for i ∈ {2, ..., n}. Also extend the language (and the semantics) with n 0-ary truthfunctional connectives C 1 , ..., C n , with values corresponding to each of the n truth values. This yields a logic which is substitution-invariant, monotonic, reflexive and transitive, since it has a valuational, intersective pure semantics. In any truth-adequate semantics, the 0-ary connectives correspond to a truth value (a constant truth-function), and they all have to be different truth values because the formulae C i s have pairwise different behaviors (C i C j iff i ≤ j). Hence, any truth-adequate semantics has at least n truth values. Facts 4.9 and Theorem 4.10 may be related to [START_REF] Gödel | On the intuitionistic propositional calculus[END_REF]'s result showing that there is no finite-valued characterization of intuitionist logic. Intuitionist consequence is monotonic, reflexive, transitive, and nonpermeable.4 From Corollary 4.7, it follows that it must have a two-valued semantic characterization. There is no contradiction with Gödel's result, however, for what Gödel's result really establishes is that there is no truth-functional characterization of intuitionistic logic with finitely many values.

A solution for 'regular' connectives and compact logics: the truth-functional Scott-Suszko reduction

The counterexample given in the previous section to the truth-functionality of Scott-Suszko reductions involved connectives with particular properties: a negation for which it could be that Γ, P ∆ without Γ ¬P, ∆ (Theorem 4.9) or 0-ary connectives specifically targeting algebraic truth-values, so to speak (Theorem 4.10). Here we show that under certain conditions, the truth-functional rank is not higher than the Suszko rank. We exhibit a modification of the Scott-Suszko reduction that preserves truth-relationality and soundness and completeness, but also truth-functionality. But this happens only for compact logics and certain types of connectives that we will call regular.

Compact and regular logics

Compactness is a standard structural notion from the Tarskian tradition:

Definition 4.11 (Compactness). A logic is compact if Γ ∆ entails that there are Γ and ∆ finite subsets of Γ and ∆, such that Γ ∆ .

As for regular connectives, a formal definition is given in 4.13. In essence, they are connectives such that their structural behavior can be read off from the consequence relation. The formulation of the definition is a bit complicated, but the spirit is simple and a couple of examples could help clarify. Whether a relation holds when the premise contains a formula headed by negation can, in well-behaved cases, be deduced from whether related relations without that negation hold. And similarly when the formula headed by negation is in conclusion. More generally, whether Γ, C(F 1 , ..., F n ) ∆ is often dictated by a conjunction of statements of the form "Γ, F 1 F 2 , ∆", "Γ, F 2 , F 3 F 1 , ∆", etc.

Example 4.12. Examples of typical relations that make connectives regular:

Negation Γ, ¬P ∆ iff Γ P, ∆ Γ ¬P , ∆ iff Γ, P ∆ Conjunction Γ, P ∧ Q ∆ iff Γ, P, Q ∆ Γ P ∧ Q , ∆ iff Γ P, ∆ and Γ Q, ∆ Disjunction Γ, P ∨ Q ∆ iff Γ, P ∆ and Γ, Q ∆ Γ P ∨ Q , ∆ iff Γ P, Q, ∆ Conditional Γ, P→Q ∆ iff Γ, Q ∆ and Γ P, ∆ Γ P→Q , ∆ iff Γ, P Q, ∆
All of those correspond to invertible sequent calculus rules for classical propositional logic (viz. [START_REF] Scott | Completeness and axiomatizability in many-valued logic[END_REF]. The general definition of regular connectives is as follows.

Definition 4.13 (Regular connectives, regular logics). A connective C is regular if there exist B p ⊆ P ({1, ..., n}) × P ({1, ..., n}) and B c ⊆ P ({1, ..., n}) × P ({1, ..., n}) such that ∀Γ, ∆ :

Γ, C(F 1 , ..., F n ) ∆ iff (B p ,B c )∈B p Γ, {F i : i ∈ B p } {F i : i ∈ B c }, ∆ Γ C(F 1 , ..., F n ), ∆ iff (B p ,B c )∈B c Γ, {F i : i ∈ B p } {F i : i ∈ B c }, ∆
A logic is called regular if all its connectives are regular. For a regular connective C, we may refer to rules as above as its regularity rules, and note the corresponding sets B p and B c , leaving C implicit. We do so without implying that these are uniquely determined.

Regular logics include not only classical logic, but also some substructural logics, such as the logics ST and TS of Cobreros et al. (2012b).5 Non-regular logics include for example intuitionistic logic or Łukasiewicz's three-valued logic Ł3: in particular, in both systems the negation is not regular. 6 Intuitively, the notion of regularity is tied to the proof-theoretical notion of analyticity, namely for a logic to enjoy the subformula property (all formulas occurring in a derivation of a provable sequent are subformulae of formulae in the end-sequent). We may conjecture that regularity is a sufficient condition for a logic to enjoy the subformula property. We leave a further exploration of that issue for another occasion (see Lahav and Zohar 2018 for a recent study).

The truth-functional Scott-Suszko reduction and the truth-functional rank

We can exploit the regularity of a logic to propose a version of the Scott-Suszko reduction designed to preserve truth-functionality, modifying the construction from Definition 4.3. In this reduction, we now say explicitly how to treat (regular) connectives. V

* := {1, # p , # c , 0}, W * := Λ × W, |≡ * := |≡ {1,# p },{1,# c } , p * (λ, v) := t λ ( p (v)
) for all atoms p, and we extend the interpretation function inductively through the definition of a truth-function for all (regular) connectives:

[[[C]]](x 1 , ..., x n ) ∈ {1, # p } iff (B p ,B c )∈B p ({x i : i ∈ B p } ⊆ {1, # p } ⇒ {x i : i ∈ B c } ∩ {1, # c } = ∅) [[[C]]](x 1 , ..., x n ) ∈ {1, # c } iff (B p ,B c )∈B c ({x i : i ∈ B p } ⊆ {1, # p } ⇒ {x i : i ∈ B c } ∩ {1, # c } = ∅)
This reduction relies on a canonical way of associating a truth-function to a regular connective. In Appendix B, we provide reasons to compare the resulting truth-functions with Strong Kleene truth-tables. For current purposes, we want to ensure that these truth-functions deliver truthfunctionality:

Theorem 4.15. The truth-functional Scott-Suszko reduction of a sound and complete, intersective semantics for a regular and compact logic is a truth-adequate, mixed semantics.

Proof. By construction, the truth-functional Scott-Suszko reduction is truth-compositional and mixed, see Fact 2.15. We will now prove that it is sound and complete in three steps: the induced syntactic consequence relation (i) is sound and complete on sets of premises and conclusions only made of atoms, (ii) respects the regularity of the connectives, (iii) is inductively sound and complete everywhere since by compactness and regularity all relations can be inferred from relations between atomic formulae only.

(i) On atoms, the semantics is clearly sound and complete: it coincides with the traditional Scott-Suszko reduction.

(ii) This semantics respects the regularity of the connectives. We first show this for cases where the connective is in the premise set: the first member of the chain of equivalence below corresponds to Γ, C(F 1 , ..., F n ) ∆ and the last member corresponds to its regular representation

(B p ,B c )∈B p Γ, {F i : i ∈ B p } {F i : i ∈ B c }, ∆. ∀v * = (λ, v) : [v * (Γ) ⊆ {1, # p } ∧ v * (C(F 1 , ..., F n )) ∈ {1, # p }] ⇒ v * (∆) ∩ {1, # c } = ∅ iff v * (Γ) ⊆ {1, # p } ∨ v * (C(F 1 , ..., F n )) ∈ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅ iff v * (Γ) ⊆ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅ ∨ (Bp,Bc )∈B p {v * (F i ) : i ∈ B p } ⊆ {1, # p } ⇒ {v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ iff (Bp,Bc ) [{v * (F i ) : i ∈ B p } ⊆ {1, # p } ∨ {v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ ∨ v * (Γ) ⊆ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅] iff (Bp,Bc ) [{v * (F i ) : i ∈ B p } ⊆ {1, # p } ∧ v * (Γ) ⊆ {1, # p }] ⇒ [{v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ or v * (∆) ∩ {1, # c } = ∅]
Similarly, for cases where the connective is in the conclusion set: the first member of the chain of equivalence below corresponds to Γ C(F 1 , ..., F n ), ∆ and the last one to its regular representation

(B p ,B c )∈B c Γ, {F i : i ∈ B p } {F i : i ∈ B c }, ∆. ∀v * = (λ, v) : v * (Γ) ⊆ {1, # p } ⇒ [v * (∆) ∩ {1, # c } = ∅ ∨ v * (C(F 1 , ..., F n )) ∈ {1, # c }] iff v * (Γ) ⊆ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅ ∨ v * (C(F 1 , ..., F n )) ∈ {1, # c } iff v * (Γ) ⊆ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅ ∨ (Bp,Bc )∈B c {v * (F i ) : i ∈ B p } ⊆ {1, # p } ⇒ {v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ iff (Bp,Bc ) [{v * (F i ) : i ∈ B p } ⊆ {1, # p } ∨ {v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ ∨ v * (Γ) ⊆ {1, # p } ∨ v * (∆) ∩ {1, # c } = ∅] iff (Bp,Bc ) [{v * (F i ) : i ∈ B p } ⊆ {1, # p } ∧ v * (Γ) ⊆ {1, # p }] ⇒ [{v * (F i ) : i ∈ B c } ∩ {1, # c } = ∅ ∨ v * (∆) ∩ {1, # c } = ∅]
(iii) From the two items above, using compactness and induction on the complexity of the (finite number of) formulae involved, we complete the proof that this semantics is sound and complete.

For regular and compact logics, Corollary 4.5 about Suszko rank can now be subsumed by parallel results about the more stringent notion of truth-functional rank: Theorem 4.16 (Maximum truth-functional rank theorems). A monotonic, regular and compact logic is of truth-functional rank:

• at most 2 if it is reflexive and transitive,

• at most 3 if it is transitive or reflexive,

• at most 4 in general.

Proof. with reflexivity To a monotonic reflexive logic, we apply Theorem 3.3 , obtain a truth-adequate p-mixed semantics for it, and apply the truth-functional Scott-Suszko reduction. We can be sure that no formula is assigned in any valuation v the value # p . Otherwise, such a formula F p would violate reflexivity:

F p F p because in the relevant valuation v p : v p (F p ) ⊆ {1, # p } and v p (F p ) ∩ {1, # c } = ∅.
Hence, the truth-functional Scott-Suszko reduction is adequate, truth-interpretable and at most trivalent, over (some subset of) the set of truth values {1, # c , 0}, which shows that monotonic, reflexive logics are of truth-functional rank at most 3.

with transitivity If the logic is transitive, we can associate to it a truth-adequate q-mixed semantics by Theorem 3.4 , and take the truth-functional Scott-Suszko reduction of it. This semantics does not make use of # c , neither for the atoms, nor for more complex formulae: no # c shows up in the atoms, that is in what we called V * v above, because D λ c \ D λ p = ∅; furthermore, if a # c is generated for some formula F c in some valuation v c , then that valuation can safely be dropped. If it could not be dropped, there would be Γ ∆ such that ∀v = v c , v(Γ) |≡ * v(∆). But then Γ ∆ while both Γ, F c ∆ and Γ F c , ∆ would hold. This would violate transitivity. Hence, we can obtain a truth-adequate mixed semantics over (a subset of) {1, # p , 0}: the truth-compositional rank is at most 3.

with reflexivity and transitivity The previous construction for a transitive logic yields reflexivity if and only if # p does not appear in any formula (a formula involving # p would violate reflexivity, as explained above). The truth-functional rank is therefore at most 2.

without reflexivity nor transitivity We apply the truth-functional Scott-Suszko reduction to a semantics given by Theorems 3.2 to obtain a truth-adequate, mixed semantics over (a subset of) {1, # p , # c , 0}.

As before in Corollary 4.7, we can also obtain exact rank theorems for non-permeable logics:

Theorem 4.17 (Exact truth-functional rank theorems). A non-permeable, monotonic, regular and compact logic is of mixed truth-functional rank:

• exactly 2 if and only if it is reflexive and transitive,

• exactly 3 if and only if it is transitive or reflexive but not both.

• exactly 4 if and only if it is neither transitive nor reflexive.

Proof. The proof is exactly the same as the proof for Corollary 4.7, except that the reference for the upper bounds is not Corollary 4.5 but Theorem 4.16, of course.

Hence, we obtained complete analogs of Corollaries 4.5/4.7 for regular and compact logics in Theorems 4.16/4.17. We find that the Suszko rank is essentially the same as the a priori more stringent truth-functional rank. Under these circumstances, then, logical and algebraic truth values are fundamentally the same, given appropriate reductions.7 These results obtain only for compact and regular logics. If these restrictions are unsatisfying to some readers, Appendix C explores a way to study more general logics, through what we call grouping reductions, but we exhibit limitations of this other approach.

Conclusions

Let us summarize our progression in this paper. We have defined a logic syntactically, as consisting of a set of formulae, a set of connectives, and a consequence relation definable as a set of arguments over that language. In parallel, we have defined a semantics as a structure allowing us to map formulae, connectives, and the consequence relation to their interpretations. The rest of the paper has dealt with representation theorems, relating structural properties of a logic with general constraints on their semantic interpretation.

Firstly, we have addressed Suszko's problem in its general form: what is the least number of truth values needed to characterize a logic semantically? We showed that if one is only interested in finding a sound and complete semantics, the least number of truth values needed to characterize a monotonic logic lies between 2 and 4, and the precise number is tied to whether the consequence relation is reflexive, transitive or neither of those. Similar results were first obtained by French and Ripley, using different techniques, and by Blasio, Marcos and Wansing. As the former emphasize, only partial correspondence results were obtained earlier (in particular by [START_REF] Humberstone | Heterogeneous logic[END_REF][START_REF] Malinowski | Q-consequence operation[END_REF][START_REF] Tsuji | Many-valued logics and Suszko's thesis revisited[END_REF][START_REF] Frankowski | Formalization of a plausible inference[END_REF].

Secondly, we have pointed out that the rank theorems obtained no longer hold in full generality if we require the semantics of the connectives to be truth-functional. However, truth-functionality is a natural desideratum, and Suszko's problem can be extended as follows: what is the least number of truth values needed to represent a logic by means of a truth-functional semantics? About this, we showed that for a natural class of logics, this generalization is not more demanding than Suszko's original question: the least number of truth values needed to truth-functionally characterize a monotonic, compact and regular logic is, again, exactly 2 if the logic is reflexive and transitive, exactly 3 if it is only one of those, exactly 4 if it is neither reflexive nor transitive. This result is of significance for the understanding of what ought to count as a truth value. Suszko pointed out that, given a logic, the number of algebraic truth values for a truth-functional semantics is in general arbitrary. On the other hand, he defended a notion of logical truth values, whose number is not arbitrary, but at the risk of losing truth-functionality. Our approach shows that we can have a notion of truth value that is tailored for truth-functionality and that may coincide with the logical notion.

Nevertheless, this result depends on the restriction to a special class of connectives and logics. To gain more generality, in Appendix C we investigate whether more radical departures from the notion of reduction employed by Scott and Suszko could preserve truth-functionality including for noncompact nonregular logics. We introduce one possible candidate, the notion of grouping reduction. The notion is plausible from a semantic point of view in that it proposes to assimilate truth values that may be intersubstituted salva consequentia. As we show there, however, it also leaves us with problems calling for further work. Because both the Scott-Suszko types of reduction and grouping reductions have limitations, more candidates may need to be considered to define an adequate notion of reduction, not only preserving consequence and truth-functionality, but ensuring that the reduction always helps reach an optimal number of truth values and may therefore reveal the rank of any logic and, in fact, a canonically associated semantic. How do the above truth-tables compare with other truth-tables proposed for many-valued negation, conjunction, conditionals, ...? Below we highlight two properties of such truth-tables.

({α i : i ∈ B p } ⊆ {1, # p } ⇒ {α i : i ∈ B c } ∩ {1, # c } = ∅)
None of these two statements would become false if some α i was changed from # p to 1. Hence, we would have C(π(α 1 ), ..., π(α n )) = # c , with π(0) := 0, π(1) := 1 and π(# p ) := 1. And this would violate the stability of {0, 1}. This proves the closure of {1, 0, # p }. The proof for the closure of {1, 0, # c } is similar: no conjunct in the statement above can become true if some α i is changed from # c to 0.

As a result, if we ignore one of the non-classical truth value as an argument, # p or # c , we are left with a trivalent connective in its output too. In other words, removing the # p row and the # p column in the truth-table above for instance, leaves us with a truth-table which does not contain # p anymore. On these three-valued spaces then, either {1, # c , 0} or {1, # p , 0}, we recognize the usual trivalent Strong Kleene tables, in the following sense: It would be useful to investigate a structural characterization of bivalent-stable connectives, of Strong Kleene connectives and, in connection to this, to ask when several regularity rules may co-exist for a connective (it certainly is so for 'xor') because they could lead to different 'canonical' truth-functions (although there is a canonical way to decide between several regularity rules, by picking the conjunction of them all, which remains a regularity rule). We leave such a systematic investigation of connectives for another occasion.

Hence, strong g-reductions do not reduce a semantics to the point of destroying compositionality. But g-reductions may be too weak: one may like to ensure that strong g-reductions reach the strong rank. This further desideratum is not satisfied: Theorem C.8. Some strong semantics may not be g-reducible to a semantics for which the cardinal of the set of truth values is the strong rank of the logic.

Proof. Consider propositional logic and its classical semantics. Now consider the product semantics: V * = V × V, F * := ( F , F ), (γ 1 , γ 2 ) |≡ * (δ 1 , δ 2 ) iff (def) (γ 1 |≡ biv δ 1 and γ 2 |≡ biv δ 2 ), with |≡ biv the classical bivalent truthrelation |≡ {1},{1} . We show that (i) this semantics is strong (the main issue is whether it is adequate), (ii) this semantics cannot be g-reduced.

(i) ∀v * : v * (Γ)

|≡ * v * (∆) iff ∀v 1 , v 2 : (v 1 (Γ), v 2 (Γ)) |≡ * (v 1 (∆), v 2 (∆)) iff ∀v 1 , v 2 : (v 1 (Γ) |≡ 1 v 1 (∆) and v 2 (Γ) |≡ 2 v 2 (∆)) iff (∀v 1 : v 1 (Γ) |≡ 1 v 1 (∆) and ∀v 2 : v 2 (Γ) |≡ 2 v 2 (∆)) iff Γ ∆
(ii) None of the values (0, 0), (0, 1), (1, 0), (1, 1) are equivalent (see Theorem C.6), hence there is no strict relation-greduction of this semantics.

It is important to note that over V × V, one could also define the truth-relation as γ |≡ δ iff (def) π 1 (γ) |≡ π 2 (δ), ignoring the second member of each pair, and yet obtain an adequate semantics. The semantics with this truth-relation could be g-reduced, however, even though it is essentially the same. The theorem obtains because some semantics cannot be g-reduced, but it suggests an extension of our notion of reduction, starting by a reduction of the representation as intersection of mixed consequence relations, but first dropping any member of the intersection that can be dropped, and then applying a g-reduction.

Hence, the constraint is too stringent in that g-reductions do not always allow us to reach the rank (Theorem C.8). If we give up the Suszko rank in favor of the truth-compositional rank or strong rank, and want to study not only compact and regular logics but all logics, future research is needed to find a constructive reduction that can reveal the minimal number of truth values for a truth-relational and (truth-)compositional semantics. This appendix shows that it will involve a deeper re-organization of truth values than simply grouping them together.

Definition 2 .

 2 27 (Polarization, True and False). A mixed truth-relation |≡ D p ,D c is polarized iff it is T-polarized and F-polarized, in the following sense: T-polarization: D p ∩ D c = ∅ F-polarization: V \ (D p ∪ D c ) = ∅ The elements of D p ∩ D c are all candidates for True; the elements of V \ (D p ∪ D c ) are all candidates for False. An intersective mixed truth-relation is called polarized if one of the mixed relations of which it is the intersection is T-polarized and one is F-polarized. 3

  Hence, there is λ and v such that v(Γ) ⊆ D λ p and v(∆) ∩ D λ c = ∅. Let Γ = {P|v(P) ∈ D λ p }. Then Γ, Γ ∆, L \ (Γ ), which proves transitivity. The reason is that (i) v(Γ, Γ ) ⊆ D λ p , by construction and (ii) v(∆, L \ (Γ )) ∩ D λ c = ∅ because on the one hand, v(∆) ∩ D λ c = ∅ (see above), and on the other hand, v(L

  Proof. The t λ s from the Scott-Suszko reduction may yield at most 4 values. In fact, 3 values are sufficient if the relation is reflexive (one can choose an intersective semantics with, for all λs, D λ p \ D λ c = ∅, by Theorem 3.3 ) or transitive (one can choose D λ c \ D λ p = ∅, by Theorem 3.4 ). Finally, 2 values are sufficient if the relation is transitive and reflexive because we can then choose a representation such that D λ p = D λ c (Theorem 3.5 ).

Definition 4 .

 4 14 (Truth-functional Scott-Suszko reduction). Consider some intersective mixed semantics V, W, _ for a logic, assuming that the truth-relation is given by the intersection of the |≡ D λ p ,D λ c for λ = (D λ p , D λ c ) in Λ. Its truth-functional Scott-Suszko reduction is the semantics defined as follows:

Definition B. 1

 1 (Closure). A set of truth values V ⊆ V is closed under a truth-function [[[C]]] iff ∀α 1 , ..., α n ∈ V : C(α 1 , ..., α n ) ∈ V Definition B.2. A regular connective C is called bivalent-closed if {0, 1} is closed under its canonically associated truth-function [[[C]]]. Theorem B.3. For a bivalent-closed connective C, {0, 1, # p } and {0, 1, # c } are closed under [[[C]]].Proof. Assume that {0, 1} is closed and that α 1 , ...,α n ⊆ {0, 1, # p }. Assume that C(α 1 , ..., α n ) = # c , then [[[C]]](α 1 , ..., α n ) ∈ {1, # p } so (B p ,B c )∈B p ({α i : i ∈ B p } ⊆ {1, # p } ⇒ {α i : i ∈ B c } ∩ {1, # c } = ∅) [[[C]]](α 1 , ..., α n ) ∈ {1, # c } so (B p ,B c )∈B c

Definition B. 4 (

 4 Strong Kleene). A truth-function isStrong Kleene if for α 1 , ..., α k-1 , α k+1 , ..., α n ⊆ {0, 1}, whenever [[[C]]](α 1 , ..., α k-1 , 0, α k+1 , ..., α n ) and [[[C]]](α 1 , ..., α k-1 , 1, α k+1 , ..., α n ) take the same value, then [[[C]]](α 1 , ..., α k-1 , α, α k+1 , ..., α n ) takes this same value for all truth values α.Interestingly, the canonical truth-functions of the 16 classical bivalent binary connectives are Strong Kleene, as can be seen from the computations of all these truth-functions in the auxiliary file:Fact B.5. The truth-functions canonically associated to the 16 classical binary connectives are Strong Kleene.

  ) is the value taken by the constant proposition c (α 1 , ..., α n ), where α 1 , ..., α n are truth values and α 1 , ..., α n constant propositions taking these values. Similarly, the truth-relation of a truth-relational consequence relation is determined by γ |≡ δ iff γ |= δ, with γ, δ sets of truth values and γ, δ the corresponding sets of constant propositions.

	• The truth-function [[[C]]] associated to a truth-functional connective C is uniquely determined
	by C .
	• The truth-relation |≡ associated to a truth-relational consequence relation is uniquely
	determined by |=.
	Proof. Truth-functionality and truth-relationality alike are about the fact that [[[_]]] is uniform across worlds. The relevant
	truth-functions and truth-relation are simply that constant function (value) or relation taken in each of the worlds.
	To put it differently, a truth-functional connective associates a constant proposition as the output of its application
	to constant propositions; the truth-function ought to preserve this and therefore is determined by: [[[c]]](α 1 , ..., α n

• A semantics for a logic is called truth-functional if it interprets every connective in a truthfunctional way, truth-relational if it interprets the relation in a truth-relational way, truthinterpretable if it has both properties. Theorem 2.13. To validate the previous definition, and in particular the notations [[[C]]] and [[[ ]]]/|≡, we state that (for W = ∅, which is what we are interested in):

Table 1

 1 summarizes the semantic definitions introduced so far, in parallel for connectives and relations, first at the level of propositions (Definition 2.11) and then at the level of truth values (Definition 2.11). In this Table we also introduce names for conjunctions of properties:

Definition 2.14. A compositional

  and truth-functional semantics is called truth-compositional; a sound and complete and truth-relational semantics is called truth-(sound and complete); an adequate and truth-interpretable semantics is called truth-adequate.

		Proposition level	Truth-value level	Conjunctively
	Connectives	compositional	truth-functional	truth-compositional
	Consequence	sound and complete truth-relational	truth-(sound and complete)
	Conjunctively adequate	truth-interpretable truth-adequate

Table

Our work was developed independently of the work of[START_REF] Blasio | An inferentially many-valued two-dimensional notion of entailment[END_REF], and only referred to the work of[START_REF] French | Valuations: bi, tri, and tetra[END_REF] at the time we submitted the first version of this paper. We are grateful to J. Marcos for bringing his joint paper with C. Blasio and H. Wansing to our notice. We do not undertake a detailed comparison of the three frameworks here: suffice it to point out that they differ both in style and in what they assume as the basic notions.

Let us show why the usual notion of transitivity follows. Consider that A C. The above notion entails that there are Γ, ∆ such that B is in one of them and A, Γ C, ∆. It follows by monotonicity that either B C (B ∈ Γ) or that A B (B ∈ ∆). By contraposition we obtain that A B and B C entail A C.

This is a weak requirement given the discussion above. It will be sufficient for all relevant purposes because most of the time we will be able to replace all intersective mixed consequence relations with mixed consequence relations.

Proof. This follows from the examination of the two ends in the following chain of equivalence:∀(λ, v) ∈ W * : Γ * (λ, v) |≡ {1,# p },{1,# c } ∆ * (λ, v) ⇔: ∀(λ, v) ∈ W * : t λ ( Γ (v)) |≡ {1,# p },{1,# c } t λ ( ∆ (v))

For the intuitionistic calculus,[START_REF] Gentzen | Investigations into logical deduction[END_REF] allows only one formula to appear as conclusion in a sequent. This may appear to restrict monotonicity to premises only. However, Gentzen's restriction is primarily concerned with the application of operational rules, namely the rules for the connectives. In other words, an intuitionistically valid sequent can be augmented with more conclusions and remain valid under the intuitionistic reading of the comma as a disjunction on the conclusion side.

We refer to[START_REF] Chemla | From many-valued consequence to many-valued connectives[END_REF] for a detailed investigation of regular connectives in such logics.

The classic rule of Example 4.12 fails in either logic. Moreover, none of the other options to make negation regular is valid: neither Γ, ¬A ∆ iff Γ A, ∆; nor Γ, ¬A ∆ iff Γ, A ∆; nor Γ, ¬A ∆ iff Γ ∆.

As an example of nontrivial truth-functional reduction, we may give the case of Smith (2008)'s fuzzy logic. Smith proposes an infinite-valued semantics for the language of first-order logic and gives a definition of logical consequence which he shows to coincide with classical consequence. His proof is an instance of a Scott-Suszko reduction, which preserves truth-functionality. See[START_REF] Cobreros | Tolerance and degrees of truth[END_REF] for discussion and further comparisons with Smith's logic.

Some of the results below may be derived in a more abstract setting. We are indebted to a referee for pointing out that Theorem C.6 in particular is an instance of a more general result on Leibniz congruences, see in particular[START_REF] Blok | Algebraizable logics[END_REF] Pigozzi (1989), Font (1991).

Acknowledgements: We are grateful to Johan van Benthem, Denis Bonnay, Pablo Cobreros, Andreas Fjellstad, Ole Hjortland, João Marcos, Francesco Paoli, David Ripley, Robert van Rooij, Lorenzo Rossi, Philippe Schlenker, Benjamin Spector, Shane Steinert-Threlkeld, Heinrich Wansing for various exchanges and helpful suggestions. We are particularly grateful to David Ripley and João Marcos for their encouragements and for enlightening discussions regarding each of their respective works on this topic. We thank Andrew Arana and two anonymous referees for valuable comments that helped improve the paper. We also thank audiences in workshops held in Pamplona, Munich, Paris, and Amsterdam. This research was partially supported by the program "Logic and Substructurality", grant number FFI2017-84805-P, from the Ministerio de Economía, Industria y Competitividad, Government of Spain, by the French ANR program TRILOGMEAN (ANR-14-CE30-0010), by the European Research Council under the European Union's Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 313610, and by grant ANR-10-IDEX-0001-02 for research carried out at the DEC-ENS in Paris.

Appendices Appendix A: Simple compositionality in a Scott-Suszko reduction

Compositionality, without truth-functionality, is a very weak demand. In particular, compositionality is met as soon as no two formulae are interpreted by the same proposition: there is then no real constraint on the interpretation of connectives at the level of propositions. This suggests two ways to artificially achieve compositionality. First, one may multiply the number of truth-values, even if they play roughly the same inferential role, just so that the truth values of formulae can differ in at least one world, even if in fact the truth values they are assigned are essentially the same. If one is looking for semantics with a minimal number of truth values, this is not the way to go, however. Another option is to distinguish semantically between formulae by multiplying the number of worlds: idle worlds may be added so that different formulae are assigned different truth values in these worlds, even if these worlds play no real inferential role. We pursue this second option in this Appendix.

To do so, we present a slightly different method to arrive at what is essentially the output of the original Scott-Suszko reduction. This construction is to be compared directly to the approach in [START_REF] French | Valuations: bi, tri, and tetra[END_REF]. Interestingly, this construction is not a reduction per se: it does in one step what was done in several steps in the core of the text (and in earlier discussions on the topic), that is, it exhibits a semantics with few truth values, not by reducing an existing semantics (typically obtained by the Lindenbaum method), but by extracting this semantics directly from the syntactic consequence relation. More to the point of this appendix, this method delivers a semantics in which each formula will most commonly be assigned to a unique proposition, because the semantics will use many worlds, and hence will be compositional (albeit not necessarily truth-functional).

Definition A.1. The direct Scott-Suszko semantics of a logic is defined as follows:

V

Theorem A.2. The direct Scott-Suszko semantics of a monotonic logic is sound and complete.

Proof.

Hence, by monotonicity, Γ ∆.

Theorem A.3. If there is at most one formula F such that ∀Γ, ∆ : Γ, F ∆ and Γ F, ∆, then the direct Scott-Suszko semantics of a monotonic logic assigns a different proposition to all formulae.

Proof. Let F be a formula such that it is not the case that ∀Γ, ∆ : Γ, F ∆ and Γ F, ∆. By monotonicity, this amounts to F or F. If the former is the case, then F is the only formula such that F (w ({F},∅) ) ⊆ {1, # p }; if the latter is the case, then F is the only formula such that F (w (∅,{F}) ) ⊆ {0, # p }.

Compositionality is a very weak demand, it holds in particular if all formulae are assigned a different proposition. Thus, compositionality of the direct Scott-Suszko semantics is an immediate corollary:

Corollary A.4. If every formula F is involved in at least one relation that does not hold (∃Γ, ∆ : F ∈ (Γ ∪ ∆) and Γ ∆), the direct Scott-Suszko semantics of a monotonic logic is compositional.

The reader can see why from this construction we obtain (mixed) compositional rank results similar to the (mixed) Suszko rank results: certainly compositional rank is at most 4, and reflexivity would lead to drop # p and transitivity can help drop # c as a truth value (although it is a little more complicated for transitivity, which requires to take a subset of W and therefore lose some of the leverage to assign a unique proposition to each formula).

Appendix B: The canonical truth-functions of classical connectives

The truth-functional version of the Scott-Suzsko reduction (Definition 4.14) introduces a canonical way to associate truth-functions to regular connectives, given their regularity rules. For usual connectives from, say, bivalent logic, which come with regularity rules, these truth-functions offer a canonical 4-valued extension of their bivalent truth-function. Below we show the truthtables associated in this way to the connectives mentioned in Example 4.12, see the regularity rules reported up there. More connectives are shown with their regularity rules and canonical truth-tables in the semi-automatic Excel file attached with this paper as an ancillary document.

Negation

Conjunction Disjunction Conditional

Appendix C: Grouping reductions

This section presents a notion of reduction which is natural from an algebraic perspective, but in fact less efficient than the Suszko reduction, for reasons explained hereafter. 8

C.1 Definition of grouping reductions

Can we study more stringent notions of rank for non-compact and non-regular logics? To do so, one may like to exhibit a reduction that preserves truth-adequacy, and reaches the truthcompositional rank -just like Scott-Suszko reductions preserve truth-relationality and reach their associated rank under appropriate circumstances (see Corollary 4.7 and Theorem 4.17). With this in hand, we would have a canonical way to construct an optimized (algebraic) semantics for any logic: start from any semantics that can be obtained for a logic, e.g., the Lindenbaum construction we described, and apply the reduction.

A natural way to reduce the number of truth values is to group functionally similar truth values together. In other words, one could form new truth values as equivalence classes of old truth values. Formally, we may project the set of truth values into a smaller set of truth values, essentially collapsing truth values with the same image in this new set. We propose a formal description of this process, exhibiting constraints to preserve the soundness and completeness of the relation on the one hand, and compositionality for connectives on the other hand.

Definition C.1 (Grouping reductions and associated properties). Consider a logic and an intersective semantics for it over the set of truth values V 1 , with truth-relation |≡ 1 , and connectives generically called

V 2 is called a grouping-reduction (abbreviated g-reduction) and can be qualified:

• ρ is a strong g-reduction if it is both a relation-g-reduction and a C-g-reduction for all connectives.

The above definition articulates a constraint concerning the truth-relation and a constraint for connectives. The former is in line with Scott and Suszko's approach (although the constraint here is more stringent, as we will see). The latter however builds into the enterprise the hope that compositionality will be maintained. The following theorem, indeed, shows how a strong g-reduction provides a way to define a truth-relational semantics with |V 2 |-many truth values. We will also call a semantics defined in this way a strong g-reduction:

Theorem C.2. Consider a logic, with a strong intersective mixed semantics for it (over the set of truth values V 1 ) and a strong g-reduction of it ρ : V 1 V 2 . A strong, intersective mixed semantics for the logic can be defined over V 2 .

Proof. We exhibit a valuational, compositional, truth-relational and truth-functional semantics over V 2 by defining its interpretation function inductively (see Fact 2.15). Pick an inverse function ρ -1 for the surjective function ρ

The core of the proof is to show that this semantics is adequate. This holds because of the equivalence between 1 and 8 below. In fact, we will prove that all the following statements are equivalent:

1⇔2 is the adequacy of semantics 1. 2⇔3 is because ρ is a relation-reduction. 2⇔4 is because ρ is a relation-reduction and ρ(ρ -1 (X)) = X for all X since ρ surjective. 4⇔5 is the definition of |≡ 1 as an intersection of mixed consequence relations. 3⇔6 is the definition of |≡ 1 as an intersection of mixed consequence relations. 8⇔9 is the definition of |≡ 2 as an intersection of mixed consequence relations.

. This is shown by induction. It is clear if F is an atom. And then:

for all v 1 ∼ ρ/A v 2 (by truth-functionality) 6⇒7 Suppose 7 does not hold, then pick some

We obtain a violation of 6 because:

C.2 Reduction and equivalence classes of truth values

G-reductions group together truth values that play the same role. The truth values after reduction are classes of truth values, grouped together based on their image by ρ. Here we show that under certain circumstances, the optimal equivalence relation can be inferred from the truth-relation.

Definition C.3. Given a semantics, we define an equivalence relation over truth values as

The surjection from truth values to their equivalence class is called the canonical g-reduction, noted ρ.

The following theorem shows that relation-g-reductions can only collapse truth values that the canonical g-reduction collapses. The canonical g-reduction therefore imposes a lower bound on the number of truth values a relation-g-reduction may involve.

Theorem C.4. For any relation-g-reduction ρ, if ρ(x) = ρ(y) then ρ(x) = ρ(y).

Proof. Suppose ρ(x) = ρ(y). Then ∀γ, δ : ρ(γ, x) = ρ(γ, y) and ρ(δ, x) = ρ(δ, y). Since ρ is a relation-reduction, it follows that: (γ, x |≡ δ iff γ, y |≡ δ) and (γ |≡ x, δ iff γ |≡ y, δ), i.e. x ∼ y, i.e. ρ(x) = ρ(y).

But this lower bound is not necessarily reached, because the canonical g-reduction is not in general a relation-g-reduction (Example C.5). Theorem C.6, however, shows that with some finiteness assumptions it is a relation-g-reduction (Theorem C.6).

Example C.5. The canonical g-reduction is not in general a relation-g-reduction.

Proof. Consider V = {0, 1} ∪ {# n : n ∈ N}, and |≡= D finite subset of V \{0} |≡ D,{1} . For all i, j, # i ∼ # j . But the following shows that this does not yield a reduction: for {# n : n ∈ N} = {# 1 }, and {# n : n ∈ N} |≡ 0, but # 1 |≡ 0. In other words, one cannot collapse all the # n s into finitely many values #.

Theorem C.6. When a semantics has a relation-g-reduction with a finite number of truth values, the canonical g-reduction is a relation-g-reduction, one using the fewest possible truth values given Theorem C.4.

Proof. Consider γ, δ, γ , δ such that ρ(γ) = ρ(γ ), ρ(δ) = ρ(δ ). We will show that γ |≡ 1 δ ⇔ γ |≡ 1 δ by assuming one of them arbitrarily, say γ |≡ 1 δ and show that the other follows.

• Assume first that γ, δ, γ , δ are finite. By monotonicity, we note that γ, γ |≡ 1 δ, δ . From there, we can replace elements of γ and δ one by one with equivalent elements in γ and δ respectively, until γ ∪ γ is reduced to γ and δ ∪ δ is reduced to δ . The equivalence relation guarantees that the relation is preserved at each step and since there are finitely many replacements, we obtain γ |≡ 1 δ .

• Consider a g-reduction ρ : V 1 V 2 with V 2 finite, and an 'inverse' function for the surjection:

. We obtain that:

-γ and δ are finite, since V 2 is finite.

-(γ |≡ 1 δ iff γ |≡ 1 δ), because γ and δ and γ and δ have the same images by ρ, which is a relation g-reduction.

ρ(γ) = ρ(γ) and ρ(δ) = ρ(δ) (by Theorem C.4).

For all γ, γ , δ, δ we can thus reason with their γ, γ , δ, δ finite counterparts and apply the argument from the previous step.

C.3 Properties of grouping reductions

Strong g-reductions are defined by constraining how truth values are grouped together depending on the role they play for the truth-relation (relation-g-reduction) and for each connective C (C-greduction). We can provide an example showing how strong g-reductions differ from the original Scott-Suszko reduction. In Theorem 4.10, we showed that the Scott-Suszko reduction can fail to provide a truth-adequate semantics when we start from an order-theoretic semantics, that is a semantics for which the truth-relation is essentially obtained by a total order on the set of truth values and the rule γ |≡ δ iff Inf(γ) ≤ Sup(δ). A strong g-reduction would not fall into this problem, simply because there is no strict strong g-reduction of an order-theoretic semantics.

Theorem C.7. A strong order-theoretic semantics has no strong g-reduction.

Proof. Consider a strong order-theoretic semantics, that is a strong semantics of which the truth-relation is derived from a well-order ≤ on truth values as γ |≡ δ iff (def) Inf(γ) ≤ Sup(δ). Then for any two distinct truth values, x |≡ x but either x |≡ y or y |≡ x. Hence, x ∼ y, and Theorem C.4 guarantees that no g-reduction would collapse x and y.