Non-Boolean classical relevant logics II: Classicality through truth-constants

This paper gives an account of Anderson and Belnap’s selection criteria for an adequate theory of entailment. The criteria are grouped into three categories: criteria pertaining to modality, those pertaining to relevance, and those related to expressive strength. The leitmotif of both this paper and its prequel is the relevant legitimacy of disjunctive syllogism. Relevant logics are commonly held to be paraconsistent logics. It is shown in this paper, however, that both E and R can be extended to explosive logics which satisfy all of Anderson and Belnap’s selection criteria, provided the truth-constant known as the Ackermann constant is available. One of the selection criteria related to expressive strength is having an “enthymematic” conditional for which a deduction theorem holds. I argue that this allows for a new interpretation of Anderson and Belnap’s take on logical consequence, namely as committing them to pluralism about logical consequence.


Introduction
Tradition has it that relevant logics are inherently paraconsistent; that is they don't license the inference from the premise set {A, ∼A} to B for arbitrary A's and B's. In the prequel to this paper, Non-Boolean Classical Relevant Logics I, I presented a The quote is from ch. 173 of Neckam's De Naturis Rerum, here requoted from Read (1988, p. 31).

B Tore Fjetland Øgaard
Tore.Ogaard@uib.no 1 Department of Philosophy, University of Bergen, PB 7805, 5020 Bergen, Norway logic E which has both the variable sharing property, the Entailment theorem, the enthymematical deduction theorem, as well as a definable S4 modality. The Hilbert consequence relation of E , however, is not paraconsistent, but explosive and therefore validates the principles called disjunctive syllogism; the rule {A, ∼A ∨ B} h B is derivable for arbitrary A's and B's. E is quite closely related to Anderson and Belnap's favorite logic E. In order to prove the variable sharing property, however, the transitivity axioms of E had to be weakened ever so slightly. As a result, its modal features had to be added as primitive postulates. Ever since Ackermann (1956) (who did so under inspiration from Johansson) have logicians considered adding truthconstants to relevant logics in order to increase expressivity. This paper shows that one can do better than E provided that 't,' the truth-constant known as the Ackermann constant, is admitted into the language.
Relevant logics came about as an attempt at providing a theory of entailment, that is, logical consequence, free of the so-called paradoxes of implication. Not only, however, did they seek a new concept of entailment, Anderson and Belnap argued in their Grammatical propaedeutic-the appendix to Anderson and Belnap (1975)-that even though entailment belongs to the "meta-language," this is merely a grammatical fact with little or no significance for theorizing about logical consequence. They therefore sought not only a new concept of entailment, but a theory of entailment in which entailment itself was to be expressible. 1 In Ackermann's first attempt at such a conditional it is clear that the conditional is added to classical logic: the →-free fragment of Ackermann's logic is classical logic. Thus one might simply view as harboring two notions of conditionality: that expressed by the material conditional and that expressed by what Ackermann called strenge Implikation-the added connective →. This sets Ackermann's approach apart from that of Anderson and Belnap (A&B from now on).
As we shall see, A&B also sought a theory of entailment with two kinds of conditionals. Their favorite logic E-their "logic of entailment"-is obtained by essentially dropping from its primitive rule {A, ∼A ∨ B} B-that is modus ponens for the material conditional, or disjunctive syllogism, named by Ackermann as simply (γ ). Not only did A&B regard the material conditional as not expressing entailment-in fact they acknowledged that "it is not unmistakably clear whether or not anyone ever seriously took material implication to express 'valid argument' " (Anderson and Belnap 1961, p. 715)-but thought furthermore that the material conditional should not even be viewed as a conditional: "But of course A ∨ B is no kind of conditional, since modus ponens fails for it, as we have remarked ad nauseam before." (Anderson and Belnap 1975, p. 259). 2 Of course, if all they intended by claiming that modus ponens fails for the material conditional is that it fails in the case of E, that would be rather uninteresting. What I take them to argue, however, is that the properties of any theory of entailment are such as to rule out modus ponens holding for the material conditional; in short, they claim that modus ponens for the material conditional fails on broadly conceived relevant grounds. The main purpose of this paper is to show that this is not the case, not even if, to borrow A&B's phrase, 3 we bend over backward trying to be fair to their "non-official" position and require that the theory contains all that A&B's theory contains, i.e. that the logic extends E, without, of course, extending it too much so as to loose the properties deemed valuable by A&B.
A&B never gave a systematic presentation of their selection criteria for a theory of entailment, and so just what properties they did deem valuable is open for interpretation. In this paper I have tried to give a more systematic account of what I take to be A&B's selection criteria and some of the reasons at least for why they opted for these. I have categorized the criteria into three main categories: -modality; -relevance properties; and -expressive strength.
A&B thought of entailment as a modal notion and thought that modality ought to be expressible within the theory of entailment. The theory of entailment should, according to A&B, be strong enough to express modality, but not too strong so as to trivialize the modality, or so as to validate so-called modal fallacies. I call a theory of entailment which satisfies these criteria modally nice. Section 2 will first define what I call the Hilbertian consequence relation for any logic. It also shows how A&B's favorite logics E and R are pieced together. Section 3 then introduces the truth-constants known as the Ackermann constant t and the Church constant and defines the explosive logics AE and M. The logics AE and M are new with this paper. Relevant logics are known for not validating the explosion axiom A ∧ ∼A → B unrestrictedly. Note, then, that AE and M are obtained from, respectively, E t -E augmented by the Ackermann and Church constants-and R t by adding the axiom t ∧ f → A, where f = d f ∼t. Section 4 then looks at the modal features of E t and AE and shows how to extend them into S5-type modal logics. Here I will properly state what I take the property of modal niceness to be and will show that both E t and AE are in fact modally nice. Section 5 then digresses on the topic of conservative extension. It turns out that AE and AE5 do not conservatively extend E, but rather interpret, respectively, classical modal S4 and S5. M, on the other hand, conservatively extends R. That this is so follows from the fact that these logics are closely related to CE and CR, E and R with Boolean negation added. 4 An adequate theory of entailment must, according to A&B, avoid the "implicational paradoxes." Such paradoxes are branded fallacies of relevance by A&B as they, intuitively, are claims of logical entailment where the premises are irrelevant to the conclusion. A&B presented two formal criteria to safe-guard against such paradoxes: 3 Cf. Anderson and Belnap (1975, p. 258). 4 I should also like to mention a recent novel approach to the implicational paradoxes, namely that argued for by Kerr (2019). Kerr argues that the logic KR-R augmented by A∧∼A → B (which, then, also extends CR)-is both superior to classical logic in that it does not validate genuine implicational paradoxes such as A → (B → A), and superior to R in that it validates disjunctive syllogism. That relevant logics generally do not validate this rule is identified as the "most unsavoury and counterintuitive aspect of relevant logics" (Kerr 2019, § 5). Kerr appeals to the normativity of logic in classifying A ∧ ∼A → B and A → (B → B) as merely illusory implicational paradoxes. Kerr's approach the problem of disjunctive syllogism is highly interesting. Going further into issues connected to the normativity of logic, or Kerr's distinction between genuine and illusory implicational paradoxes is regrettably beyond the scope of this paper. the variable sharing property and the Entailment theorem. The first such criterion is usually stated for logics without truth-constants. Section 6 discusses the variable sharing property in the context of truth-constants. It is shown that AE and M satisfy the same variable sharing properties as E t and R t do. In fact it is shown that the two available suggestions for how to deal with such constants are equivalent. The Entailment criterion is often called the use-criterion as it it was thought to ensure that if A entails B, then every proof of B must somehow use A. A&B viewed this criterion as necessary and sufficient for avoiding the relevant fallacies. However, it was shown in the prequel to this paper that even though E and R do satisfy the use-criterion, so does classical logic. The proof applies to any sufficiently strong logic in the vicinity of E having no more rules than adjunction and modus ponens. Section 8 shows how to slightly alter the notion of a relevant deduction so as to make the Entailment theorem provable also for logics with disjunctive syllogism as a primitive rule.
Not only should a theory of entailment be such as to avoid the modal and relevant fallacies, but it should have certain properties best viewed as relating to expressive strength. I should note already now, however, that this is where I find A&B to be the most unclear. I've marked out two such "effable" properties, namely having a definable "enthymematic" conditional for which a deduction theorem relative to the Hilbert consequence relation holds, and having the property of rule normality. These are both dealt with in Sect. 7. I both state A&B's reasons for wanting an enthymematic conditional and show that AE and M are alike E t and R t in validating the deduction theorem with regards to the conditional does. A&B stated that adding (γ ) to E "destroys practically every nice property of E" (Anderson et al. 1992, p. 138). One such property which is left rather implicit by A&B is that of rule normality, that any primitive rule of the theory of entailment should by the lights of the theory itself be a true entailment. From the definition of rule normality it will be evident that E t , R t , AE, and M are all rule-normal logics, but that E t [γ ] and R t [γ ] are not.
A&B's selection criteria for an adequate theory of entailment, then, do not differentiate between E t (R t ) and AE(M), and so the conclusion is that the material conditional does not fail to be a proper conditional on, broadly conceived, relevant grounds. Even though the main goal is in this sense negative, this paper contributes positively to the philosophy of relevant logics and should therefore also be of interest to those who think, for whatever reason, that modus ponens in fact fails to hold for the material conditional. In addition to, to highlight some of what I've already stated, (i) systematizing the adequacy criteria of Anderson and Belnap, (ii) showing that logics with (γ ) as a primitive rule can satisfy the Entailment theorem and (iii) have an enthymematical deduction theorem, this paper also provides a new interpretation of A&B's often highly polemical and often unsystematic philosophy of logic. Relevant logics are philosophically often presented as monistic theories of logical consequence: in some cases it is the Hilbertian consequence relation which is thought of as logical consequence, whereas in other cases it is a different "relevant" notion of logical consequence which is presented as the one true theory of logical consequence. As we shall see, A&B are quite explicit on their misgivings about the Hilbertian consequence relation, and so it would stand to reason that they regarded their notion of relevant consequence as the one true theory of logical consequence. Section 9 displays how the Hilbertian and A&B's version of a relevant consequence relation of E t , E t [γ ] and AE are related before Sect. 10suggests a philosophically unifying theory under which to make, I think, a more fruitful account of A&B's view of logical consequence, namely as adhering to pluralism about logical consequence, and more precisely to the type of pluralism Hjortland (2013) calls intra-theoretic pluralism. Section 11 then finally summarizes.
Although this paper is a sequel to Øgaard (2019), I've tried to make it as independent as possible so as to make them independently readable. As a result, they do occasionally overlap.

E, R and the Hilbert consequence relation
This section defines the Hilbert consequence relation of a logic and presents the axioms and rules of the logics E and R. The following section then introduces the Ackermann and Church constants and defines the explosive siblings of E and R, namely AE and M.
Every logic in this paper will be thought of as a set of axioms together with a set of rules. Rules will be on the form Γ A where Γ is a finite set. For each logic there are two different consequence relations which both will be important in this paper. The easiest one to specify is the Hilbert consequence relation for a logic: Definition 1 (The Hilbert consequence relation) A Hilbert proof of a formula A from a set of formulas Γ in the logic L is defined to be a finite list A 1 , . . . , A n such that A n = A and every A i≤n is either a member of Γ , a logical axiom of L, or there is a set Δ ⊆ {A j | j < i} such that Δ A i is an instance of a rule of L. The existential claim that there is such a proof is written Γ h L A and expressed as "there exists a Hilbert-derivation of A from Γ in the logic L," or more casually as "the rule Γ h A is derivable in L." The notion of a derivable rule does apply to consequence relations in general. It is, however, important to distinguish between such derivable rules from merely admissible rules. The following definition makes this distinction clear: Definition 4 (Parenthesis conventions and defined connectives) ∨ and ∧ are to bind tighter than →, and so I'll usually drop parenthesis enclosing conjunctions and disjunctions whenever possible. The material conditional ⊃, relevant equivalence ↔, the modal operators and ♦, the strict conditional , and the two enthymematic conditionals → and → are defined as follows: Definition 5 (E) The following list of axioms and rules defines the logic E: Lemma 1 Any logic considered in this paper will have the following derived rules: Proof Left for the reader.
As we shall see in the next section, E is a S4 type modal logic. The stronger logic R, on the other hand, was from the outset thought of as a non-modal logic.
Definition 6 (R) R is obtained by adding (Ax15), the axiom called assertion, to E and deleting the then superfluous (Ax13) and (Ax14).
It is easy to see that the modal reading of A is lost in R since A → A is in fact an instance of the assertion axiom. This is why A&B differentiate between entailment, which they take to be a modal concept, and the non-modal concept of implication in that they talk of E as a (the) logic of entailment, whereas the R is "merely" a logic of relevant implication.

Introducing truth-constants and the explosive logics AE and M
A&B's E was obtained as a modification of Ackermann's logic from Ackermann (1956). Ackermann augmented his logic with a truth-constant, , which was to be read das Absurde, and defined A as ∼A → . A&B then realized that A can in fact be equivalently defined as (A → A) → A, and showed in Anderson and Belnap (1959) that defined this way has the modal features of a S4 modality. and E turn out to be theorem-vise identical, and so E has this feature as well. Thus is not needed in E for the S4 modality to obtain, and so E was originally formulated without truth-constants. In Anderson and Belnap (1975, § 27.1.2), however, they do consider adding a positive variant of , namely t, to both E and R. The nice feature of doing so is that A ↔ (t → A) becomes a theorem, and so being necessarily true and being entailed by t turn out to be equivalent. This is a significant expressive enhancement as E without t has no uniform way of expressing the claim that A is entailed by logic.

Definition 7 (Connective extension)
If L is a logic, then L and L t are the logics obtained by adding to L, respectively, the following sets of axioms and definitions: was added to a logic slightly weaker than E. The resultant logic-E -satisfies the variable sharing property and so A ∧ ∼A → B is not a theorem of it. It was shown, however, that that axiom needs further weakening if one is to add it to R without yielding A ∧ (∼A ∨ B) → B and A ∧∼A → B. A&B noted in fact that if C is any conjunction of axioms of R, then (A∧(∼A∨ B))∧C → B fails in Belnap's test model of relevance (Anderson and Belnap 1975, p. 298). They did not, however, show that the same holds for R t ; in fact, as first noted in Øgaard (2017, p. 211), (A∧∼A)∧t → B, and therefore (using distribution) (A ∧ (∼A ∨ B)) ∧ t → B is in fact validated in Belnap's test model. These two formulas are in fact equivalent to (Ax18) below, which are used in defining the logics AE and M: Definition 8 (AE and M) AE and M are hereby defined as, respectively, E t 5 and R t strengthened by AE is so named since the letter naming it is formed from the letter 'A' for 'Ackermann' and 'E' for 'entailment.' M is so named in honor of Robert Meyer who, as I will get back to later, argued for strengthening R with Boolean negation which turns out to be a slightly stronger logic than M. AE  The truth-constants are all undefinable in all of E, and R. is to be thought of as the disjunction of every formula and is interpreted as the top element in every algebra. In E t and AE, t should be be thought of as the conjunction of every logical truth, whereas in R and M simply as the conjunction of every truth. The reason why R and M's interpretation of t is legitimate is simply that the rule {A} h t → A is derivable for these logics. Thus for R and M one may for any sentence A infer that A is entailed by t from the assumption that A is simply true. Thus "conjunction of every truth" should, given that Γ is the set of premises, be read as meaning {A | Γ h A}-the conjunction of the theory generated from Γ using the Hilbert consequence relation. 7 In fact, A ↔ (t → A) is a theorem of both R t and M, and so A is equivalent to being implied by t in these logics. In contrast, t in E t and AE should rather be interpreted as is not derivable in either E t or AE, but is merely admissible. 8 That this is so follows from Øgaard (2019, thm. 1) which states that the rule {A} h A is admissible in any →-axiomatic extension of E, together with the fact the rule is not derivable in either of E t or AE as the model in Fig. 1 shows, 9 together with, finally, the following lemma: Proof See Routley et al. (1982, p. 409) or Mares and Standefer(2017, p. 702).
That E t and AE make the necessitation rule admissible, but not derivable, and that this is so also for the rule {A} h t → A, tells in favor of interpreting as logical necessity and t as the conjunction of every logical truth. It is only fitting, then, that being necessarily true should coincide with being entailed by logic itself as Lemma 2 shows. 10 The next section further expands upon the modal features of E t and AE.

Modal properties of E t and AE
A&B thought of the conditional of E as itself expressing entailment. Entailment, according to A&B, is a modal concept, and so their theory of entailment was shown to harbor a definable S4 modal operator. In order for the definable to legitimately be a modal operator expressing necessity according to the theory of entailment itself, however, or so I take A&B's view to be, it should be the case that the S4-characteristic axioms should themselves be provable entailment statements (cf. Anderson and Belnap 1975, § § 5.2 & 11). Furthermore, for to express necessity, the rule {A} h A should not be derivable, although it should be admissible (cf. Anderson and Belnap 1975, § 21.2.2).
In addition to there being fallacies of relevance, A&B thought that there were modal fallacies. They regarded a proposition as being necessitive if it was equivalent to a 9 All displayed models in this paper have been generated by John Slaney's computer program MaGIC (Slaney 1995). Such models will be depicted with a displayed ordering and matrices for at least → and ∼. Conjunction and disjunction are to be interpreted as infimum and supremum over the displayed ordering. Rules are regarded to hold in the model if they preserve designated values-the members of the set T -if the premises are all evaluated to designated values, then the conclusion is also evaluated to some designated value. I will also list how to interpret the truth-constants as well as any formula needed to make the model a counter-model for the requisite formula/rule. 10 Note that also A&B read A not only as A being necessarily true, but also as being entailed by logic. With regards to the formula A → A, for instance, they explicitely allow the reading "if A follows from a law of logic, then that fact itself follows from a law of logic" (Anderson and Belnap 1975, p. 118). necessary one, that is A is necessitive if and only if it is equivalent to B for some B. Roughly, their view was that only necessitives could stand in the entailment relation to other necessitives; any entailment statement to the contrary amounts to, according to A&B, a modal fallacy. 11 A&B viewed entailment statements as necessitives, but propositions expressed using only negation, conjunction and disjunction as nonnecessitives. In the formal theory of entailment, then, it should not be the case that any formula A over the {∼, ∧, ∨}-fragment of the language should entail any formula B → C. This is known as the Ackermann property.
Let's collect A&B's criteria for theory choice pertaining to modality into a definition: Definition 9 (Modally nice) A logic with an entailment-operator → is modally nice just in case it -satisfies the Ackermann property relative to →, -has a definable modal operator with the S4-characteristics expressible as →entailments, and -is such as to yield the necessity rule as an admissible, but not derivable rule.
This section shows that E and AE are alike in that both are modally nice. It is also shown how to extend E and AE so as to make them into S5-type modal logics.

Theorem 1
The following are all valid in E t and AE: ( ∧) This is simply (Ax14).
In the same manner as for the ordinary modal logic S4, one can now show that E and AE only have 14 non-equivalent modalities, namely for any formula A, Lemma 2 above showed that A and t → A are equivalent. We now see that the notion of necessity at work in both E t and AE is that of a S4 modality. One might, however, question if this is correct. Surely, if A is logically possible, then logic will deem that it is so by necessity. Could one, therefore, add to either of these logics to get also the S5 principle Translating this to the equivalent formula using t instead of , one gets the formula ∼(t → A) → (t → ∼(t → A)), which can be read "if it's not the case that A is entailed by logic, then logic entails that A is not entailed by logic. Adding (5) to AE does not yield M, nor does it yield R if added to E. As in ordinary modal logic, one could equivalently add the B axiom A → ♦A which has a more natural read to it: if A is true, then logic entails that it is not the case that ∼A is entailed by logic. It is therefore best interpreted as a strong consistency principle. By using the contraposition axiom it is easy to see , is in fact equivalent to adding the modalitytrivializer A → A, which therefore punctures the modal reading of being entailed by t, and therefore the modal character of the logics. R and M, which are obtained by adding full assertion to, respectively, E and AE, are therefore akin to the modally trivial logic called Triv in Hughes and Cresswell (1996).
Definition 10 (The Brouwerian axiom) L5 is hereby defined as the logic L augmented with

Theorem 2 The necessitation rule is not derivable either E5, E t 5 or AE5.
Proof The counter-model in Fig. 1 to the rule {A} h t → A also validates (B) as is easy to verify, and since also A = t → A in that model, the result follows.
At the very end of Ackermann (1956), a model for Ackermann's logic is presented which falsifies any formula A → (B → C) where B and C are arbitrary, but A is built up solely from {∼, ∧, ∨}. Since E is a sublogic of Ackermann's logic, neither it has any theorems on this form. The defining B-axiom is on this form, and so the property does not extend to E5. It does, however extend to AE as the following theorem shows: Theorem 3 AE has the Ackermann property, i.e. it does not have any theorems on the form A → (B → C) for A's over the {∼, ∧, ∨}-fragment of the language.
Proof It is easy to verify that t ∧ f → A holds in Ackermann's model to be found in Ackermann(1956, p. 127). 12 Corollary 1 E and AE are modally nice.

Conservative extension results
It was shown in Øgaard (2019, thm. 5) that both Ackermann's logic as well as E extend classical logic; they both validate all the logical theorems of classical logic over the →-restricted language, but also validate every classically valid rule involving ∼, ∨ and ∧. That property is easily seen to extend to the (Ax18)-logics presented in this paper. Since E t , AE, E t 5 and AE5 are modal logics one may wonder if these logics extend the classical modal logics S4 and S5. This section shows first that M is a conservative extension of R and then that AE(AE5) is a not conservative extension of E(E5). The trade-off with regards to the latter result is that AE(AE5) turns out to interpret S4(S5) on the most natural interpretation, where any formula A of S4(S5) is translated to the AE(AE5)-formula A. 13 Definition 11 (Conservative Extension) If L 1 and L 2 are logics over, respectively, languages L 1 and L 2 such that L 1 ⊆ L 2 , then L 2 conservatively extends L 1 if

Theorem 4 M is a conservative extension of R.
Proof Meyer and Routley showed in (1974) that R is conservatively extended by Boolean negation. Furthermore, R with both Boolean negation and t added-CR t -is a conservative extension of R (Giambrone and Meyer 1989, thm. 7 Mares showed in (2000) that E is not conservatively extended by Boolean negation by showing that the extensional K-sentence (A ⊃ B) ⊃ ( A ⊃ B), for a certain restricted class of formulas A and B, is a theorem of CE, but not of E. His result carries over to AE as the following theorem shows:

Theorem 5 AE is not a conservative extension of E and neither is AE5 a conservative extension of E5.
Proof This follows from the proof given in Øgaard (2020a, thm. 7) of Mares' result that CE is not a conservative extension of E since both AE and AE5 are axiomatic extensions of E for which γ , i.e. {A, ∼A ∨ B} B, is a derivable rule.
How concerned should one be by the fact that AE does not conservatively extend E? One ought to care that an extension is not conservative if one has reasons for thinking that the original logic got everything right with regards to that part of the language. However, if one has reasons for thinking that the original logic is incomplete, then simply proving a non-conservativeness result may not tell against the extension as one may have independent reasons for thinking that the surplus generated are indeed correct principles of logic. I will not go into depth with regards to the reasons for thinking that E is modally incomplete, save to point out that this is by far not a new idea: noting that the extensional K-sentence fails not only for E, but also for NR-R with a S4-modality added- Routley and Meyer (1972, p. 70) suggested (from a suggestion by Belnap) that both these logics should be augmented by the axiom of modal confinement, (A ∨ B) → (♦A ∨ B). 14 AE fails to validate this stronger axiom, and so may as well be argued to be modally incomplete. Note, however, that it does validate the enthymematical version of it, namely Of course, there may be other consequences of adding (Ax18) to E, but I take it, then, that Mares' result does not on its own show that the non-conservativeness of AE over E results in something which is undesirable.
We have seen that both E and AE are S4 modal logics, and since they extend classical logic-theorem-wise in the case of E and inferentially in the case of AEit is a welcomed fact that AE interprets S4 in the most natural way possible, and disappointing that E does not. Although there are translations on which E t in fact interprets S4 exactly, these are non-direct translation. The nice feature of the direct translation is that the theory of entailment and that of modality are connected so that being necessarily true and entailed by logic are equivalent notions: that is that A ↔ (t → A) is a logical truth. 15 AE not only extends classical logic in that every valid rule of classical logic, including the meta-rule reasoning by cases, 16 is valid in AE, but it also interprets S4 in its extensional fragment plus . It validates every S4 axiom expressed with → as well as with ⊃, and makes the necessitation rule admissible yet not derivable, precisely as it indeed should be. That AE is not a conservative extension of E may have other consequences than (A ⊃ B) ⊃ ( A ⊃ B) being a logical theorem of AE. Such other consequences may prove to be undesirable. However, Mares' result in itself does not point to any such. Note is a theorem of any of our logics since all logics in this paper includes (Ax12), (A → ∼A) → ∼A. It therefore follows that ♦A ⊃ ♦A is a theorem of both E t 5 and AE5. Since AE interprets classical modal logic S4 and ♦A ⊃ ♦A is a theorem of AE5, it therefore follows that that AE5 interprets classical modal logic S5 under the natural translation. 15 There are further reasons for insisting on the direct translation. For non-direct translations, what is expressed is then a logical concept as this is expressed in another logic. That one logic can express a logical concept according to some other logic can be an interesting feature, but in general it is the logical concept according to the correct logic-modality according to the theory of entailment in the case of E t -which is the concept that we want to give a theory of. At least A&B thought that S4 gave an incorrect account of entailment, but a correct account of modality where it only to be expressed using E's notion of entailment and not the strict implication of S4 (cf. Anderson and Belnap 1975, § § 2&11). Meyer (1970) showed that E interprets S4 on two different translations. For our purposes, let's focus on Meyer's result pertaining to E t . Meyer uses the fact that S4 can be axiomatized as E t strengthened by A → (B → B), where → is then the strict implication more commonly designated by the fish-hook and S4's A = d f t A. The translations translate ∼, ∧ and ∨ homophonically, while one uses Ackermann's translation τ (A B) = A∧∼B∧t → f, whereas the other uses Meyer's weak enthymematic translation σ (A B) = A ∧ t → f ∨ B. As shown in the "Appendix", τ (A B) and σ (A B) are interderivable in E t , although they are not equivalent and so τ and σ amount to different translations. Ackermann (1958) used τ to show that (extended with a truth constant corresponding to f) interprets at least all of Lewis' logic S2. Meyer's proofs, then, shows that it interprets all of S4 in the sense that h To see that being necessarily true in the -sense of this, and being entailed by logic are not equivalent notion, note that τ p and σ p are equivalent, but that τ p → (t → p) is not a logical truth of E t . As a further example of how different being S4-necessarily true under σ and τ are different from that of , note that neither τ p → p, nor τ ( p → q) → (τ p → τ q) are logical truths of E t either (MaGIC easily provides a counter-models; I leave it as exercises for the reader). I would like to thank one of the referees for pressing this issue. Both Ackermann's τ and Meyer's σ are interesting as it turns out (see the "Appendix" for proofs) that A ∧ t → f ∨ B. 16 That reasoning by cases holds for AE (and M) follows easily from the enthymematical deduction theorem to be proven in Sect. 7.

Variable sharing for logics with truth-constants
The variable sharing property was put forward in Belnap (1960a) as a way to spell out the requirement of relevance between antecedent and consequent in a logically true conditional: Confining our attention to propositional logic, a partial solution becomes almost obvious once we note that in propositional logic, commonality of meaning is carried by identity of propositional variables. Thus, for A to be relevant to B in the required sense, a necessary condition is that A and B have some propositional variable in common. (Belnap 1960a, p. 144) Definition 12 (Variable sharing property) A logic L without truth-constants has the variable sharing property just in case for every formula A and B, ∅ L A → B only if A and B share a propositional variable.
The variable sharing property does, by definition, not apply to logics with truthconstants. Even if one were to change the definition of the property so as not to exclude logics with truth-constant by default, such logics seem to blatantly violate any notion of variable sharing as, for instance, the following formulas are all theorems of even E t : Both t and are quite freely made use of by relevant logicians and so the question arises if the variable sharing property can in any legitimate sense be extended to cover logics with t and . There are two suggestions in the literature for how to address this question. The most common practice is to ascribe the variable sharing property to any logic just in case the property holds for all constant free formulas. This is, for instance, how the variable sharing property is stated in Galatos et al. (2007, p. 253).

Definition 13 (Constant-weak VSP)
A logic L has the constant-weak variable sharing property just in case for every truth-constant free formula A and B, ∅ h L A → B only if A and B share a propositional variable.

Theorem 6 E t , AE, R t and M, all have the constant-weak variable sharing property.
Proof This follows by noting that all the axioms and rules of M, and therefore all the three other logics as well, hold true in  The another approach to the variable sharing property for logics with truth-constants, was presented in Yang (2013). Yang's idea, developed, according to himself, from an idea of Beall and Restall (2005), is that one should not simply disregard the presence of the truth-constants, but rather demand that variable sharing should occur under the intended interpretation of the truth-constants.

Definition 14 (Constant-strong VSP)
A logic L has the constant-strong variable sharing property just in case for every truth-constant free formula A and B, ∅ h L A → B only if either A and B share a propositional variable, or they do so in light of the intended interpretation of t and as, respectively, the conjunction of every logical truth and the disjunction of every sentence.
(a) does not violate this strong variable sharing property since t, being the conjunction of every logical truth, has A → A as one of its conjunctions, and so A ∧ ∼A → B ∨ f shares a propositional variable in light of the interpretation of t. 18 The same type of explanation goes for (b)-(d). Now consider an instance of (Ax18) with A as the consequent-t ∧ f → A. Since t is the conjunction of every logical truth, it will have A → A as one of its conjunctions, and so the antecedent and consequent share a propositional variable Futhermore, just as neither A → nor → A violates the constant-strong variable sharing property, nor does t → A. It therefore seems hard to distinguish these two variants of the variable sharing property. Indeed the following theorem shows that they are equivalent.

Theorem 7 The constant-weak and constant-strong variable sharing properties are coextensive.
Proof Having the constant-strong property obviously entails having the constant-weak one. Assume that L is a logic which has the constant-weak variable sharing property and let A → B be any logical theorem of L. Now if t or are subformulas of A (B), then since every formula p → p is part of the intended reading of both t and , A (B) will contain every propositional variable on the intended reading of the truthconstants, and so will share at least one with B (A). If neither truth-constants occur in A → B then as the logic has the constant-weak variable sharing property it follows that A and B actually share a propositional variable.
So both AE and M have the same variable sharing properties as the paraconsistent siblings E t and R t . This is far from trivial as it is quite easy to extend a logic with axioms for a truth-constant in such a way as to make the logic loose its variable sharing property; one could, for instance, add → (A → A) to E which on its own does not violate the variable sharing property, but which begets the theorem B → (A → A) which evidently does.
Meyer famously wanted to extend R with Boolean negation, ¬, to CR, and argued that the fact that one may do so conservatively, shows that the extension is legitimate (Meyer 1974). CR is simply R strengthened by the two Boolean axioms A ∧¬A → B and A → B ∨ ¬B. CR, however, only has the variable sharing property provided one restricts this to the Boolean-free fragment. As we have seen in this section, no such restriction is needed in the case of either AE, AE5 or M beyond the clauses needed to wiggle room for the truth-constants; wiggling one has to do also in the case of E t , E5 t and R t .
Just as constant-enriched relevant logics such as M satisfy a constant-weak variable sharing property, Boolean relevant logics such as Meyer's CR satisfy a ¬-weak variable sharing property. One might therefore wonder if there is also a corresponding ¬-strong variable sharing property? One could, as mentioned in Restall (1999, fn. 18), argue that there is an implicit ⊥ lurking in the Boolean negation of A; A ∧ ¬A → B might not violate the variable sharing property just as neither A∧(A → ⊥) → B does. This might be possible, but such an interpretation should then be independently justifiable, and ought to differentiate between ¬A and A → ⊥ since these two negations are not equivalent even in CR. The truth-constants, on the other hand, have natural interpretations which are justifiable independent of concerns over variable sharing.

Enthymemes, deduction theorems and rule normality
This section discusses A&B's view of two criteria for theory choice, namely having an enthymematic conditional for which a deduction theorem holds, and having the property of rule normality. These properties are not intended as relevance-properties, but rather as more general adequacy-conditions on a theory of logical consequence. It is shown that AE and M satisfy both these criteria in the same manner as E t and R t do.
The logics E t [γ ] and R t [γ ]-E t and R t with (γ ) added as a primitive rule-however, are not rule normal. It is shown, however, that even though they do not satisfy the enthymematical deduction theorem with regards to the conditional →, one can define a different conditional for which a deduction theorem is provable.
In Øgaard (2019, thm. 7-8) I showed that the logic E has the following two deduction theorems: Axioms here is some finite conjunction of axioms of the logic in question. The first does not hold for either E and R since disjunctive syllogism, i.e. modus ponens for ⊃, is not derivable in these logics, although the theorem does hold if this rule is added. That the latter holds for E and R is well known. Inspecting the proofs in Øgaard (2019) will easily convince the reader that both also apply to AE and M. However, without t, there is no way of replacing Axioms uniformly by a particular formula. Using t, however, we can define the enthymematic conditional →, where A → B = d f A ∧ t → B, for which a uniform deduction theorem holds:

Theorem 8 (t-enthymematic deduction theorem) Let L be any axiomatic extension of E t for which the rule {A} h t → A is at least admissible, then
Proof The proof is given in detail in the "Appendix". A sketch of the proof was to my knowledge first given in Meyer (1970, p. 183).

Fig. 2 Counter-model the to enthymematic deduction theorem for E t [γ ] and R t [γ ]
Corollary 2 The t-enthymematic deduction theorem holds for all of E t , E5 t , R t , as well as their -extension, and AE, AE5 and M.
Notice that the t-enthymematic deduction theorem can't be liberalized to read since the rule {A} h t → A is only assumed to be admissible. Reading the proof carefully, however, it is easily seen that if the rule is derivable, then the theorem can be so liberalized. We therefore have the following: 19

Corollary 3 The liberalized t-enthymematic deduction theorem holds for R t , R t and M.
I noted above that adding (γ ) to E or R suffices for yielding the ⊃-deduction theorem. However, just as the Axioms-variant of the deduction theorem fails for both E or R with (γ ) added as shown in Øgaard (2019, thm. 8

Theorem 9 The t-enthymematic deduction theorem fails for both E t [γ ] and R t [γ ]
Proof Note that both these logics validate the rule {f} h A. The model in Fig. 2 is a model for R t [γ ] in which t is assigned the value 2. The model, however, fails to validate (Ax18)-t ∧ f → A is assigned 0 when A is assigned to 0-and therefore shows that the enthymematic deduction theorem fails for both logics.
In discussing Ackermann's logic , Anderson et al. (1992, § 45.2) note that it can in fact be axiomatized as E[γ ]. 20 With regards to (γ ) , then, they note that the addition of (γ ) as a primitive to E destroys practically every nice property E has.
[…] Most of the metalogical proofs are by induction on the length of formal proofs in E, and, in the absence of A&(A ∨ B) → B, there is apparently no way of getting over the inductive step where (γ ) is used. This fact led to the observation that, if A&(A ∨ B) → B does not belong in a theory of entailment, which it obviously (by this time) does not, then the primitive rule (γ ) does not belong there either. (Anderson et al. 1992, pp. 138f) 19 The following theorem was first proven in  for the first-order version of R t . See Dunn and Restall (2002, p. 20f) for more on deduction theorems in relevant logics and for historical references. 20 is sometimes presented as having the rule A → (B → C), B A → C as a primitive rule. This rule, called (δ) by Ackermann, was restricted to instances where B is a logical theorem. (δ) thus restricted holds also in E. See Øgaard (2019, § 3) for details. To avoid confusion, however, I will stick to 'E[γ ].' It is rather unclear what these "nice" properties of E are. Note first of all that it follows from Meyer and Dunn (1969)

's proof that (γ ) is admissible not only in E and R, but also in E t and R t . Thus for all these logics it is the case that ∅ h L A if and only if ∅ h L[γ ]
A. We shall see in the next section that A&B's notion of entailment viewed as a consequence relation can be modified every so slightly so as to yield the Entailment theorem provable also for E t [γ ] and R t [γ ], as well as their t-free variants. Thus the Entailment theorem is not one of the "nice" properties. Nor is the variable sharing property a "nice" property seeing as it is even noted in Belnap (1960a, fn. 3) that it holds for . It seems, then, that the only "nice" property that E t has, but which E t [γ ] does not, is the enthymematical deduction theorem.
Note, then, that both E t [γ ] and R t [γ ] satisfy an alternative form of the enthymematic deduction theorem. According to Bimbó and Dunn (2018), Maksimova proved in her 1966 Russian article Formal deductions in the calculus of rigorous implication (Maksimova 1966 where P n is the conjunction of every p → p such that the propositional variable p occurs in Γ ∪ {A} and Γ consists only of →-formulas. Meyer defined in Meyer (1970) Maksimova's idea and Meyer's enthymematic conditional, then, we state the following result:

Theorem 10 (t/f-enthymematic deduction theorem) Let L be any axiomatic extension of E t [γ ] for which the rule {A} h t → A is at least admissible, then
The proof is given in the "Appendix".

Corollary 4 (t/f-enthymematic deduction theorem) Let L be either E t or R t , then
is, as noted above, admissible for both E t and R t , and so The result now follows using Theorem 10.
The bibliography of Anderson et al. (1992) lists the mentioned article by Maksimova, although her result is not mentioned in either Anderson and Belnap (1975) or Anderson et al. (1992). They do, however, discuss a conditional quite closely related to →. Note, first of all, that it is not only the material conditional which is regarded as "no kind of conditional"; also the strict conditional of S4, A B = d f (∼A ∨ B), fails to be a proper conditional, according to A&B, since, again, modus ponens fails for it (cf. Anderson and Belnap 1975, p. 260). Interestingly, though, they do accept that if only S4 is formulated with primitive, then its positive fragment, S4 + , harbors a proper conditional. Similarly, they do accept that the intuitionist conditional is a proper conditional. These conditionals fall short of representing entailment since they do validate implicational paradoxes-for instance A (B B) is a logical truth of both intuitionist logic and S4 + (where is, respectively, the intuitionistic and strict conditional). 21 Although shy of being entailment conditionals, these conditionals are regarded by A&B as enthymematical conditionals. Such conditionals can be regarded, according to A&B, as representing if …then __-locutions of natural language. They are not, however, to be read as that A entails that B, which is A&B's preferred reading of the E-formula A → B (cf. Anderson and Belnap 1975, A5), but rather as that A ∧r entails that B, where r is some true statement: the "if …then __" proposition corresponding to any enthymematic argument is true if and only if there is a (suppressed) premiss which is true and which would convert the enthymeme into a valid argument. (Anderson et al. 1992, p. 50) The intuitionist conditional, according to A&B, allows one to "suppress" any such merely true r , whereas S4 allows one to suppress any necessarily true r . I will in the following only focus on so-called strict enthymemes, and thus disregard the intuitionist conditional.
A&B rendered -the strict conditional-in E using propositional quantifiers. Thus they define A B as ∃r ( r ∧ (r ∧ A → B)). A&B note that the fragment of E augmented with propositional quantifiers-E ∀∃ p -which contains formulas using only ∧ and ∨ as well as the defined connective , "exactly coincides with the positive fragment of Lewis's system S4 of strict implication" (Anderson et al. 1992, p. 52). The reason, they claim, that one has to restrict to the positive fragment is that S4 validates the "irrelevant" theorem A ∧ ∼A B: If we tried to explain away this modal curiosity by treating it as a strict enthymeme in E ∀∃ p in the sense given above, it would come to which has a decidedly irrelevant appearance in E ∀∃ p […]. We can, however, find a different strict enthymematic "implication" that does the job of embedding all of S4, including its negation, in E ∀∃ p : we can show that defining A B by catches all and only the theorems of S4 in E ∀∃ p . This result of Meyer […] is not, however, as interesting as the foregoing positive result in relation to our particular project, because this second account of the hook is given in terms of only and "implication" and not an implication: in absolute contrast to our positive enthymematic implications, it would be as much a fallacy to suppose that detachment held for the definiens displayed above as it would be to suppose that detachment held for material "implication". (Anderson et al. 1992, p. 53) The work by Meyer A&B referred to was Meyer (1970). In it, Meyer showed both that A&B's official definition of can be rendered using the Ackermann constant, namely as A → B = d f A ∧ t → B, and that the strict enthymematic "implication" can be rendered using →.
Notice first of all that even though one might agree with A&B that may look like a statement which amounts to a relevant fallacy, looks can be deceiving.
Rendering it using → yields A ∧ ∼A → B which is a logical theorem of AE and AE satisfies, or so this paper tries to show, every relevant property that E t does.
With regards to →, note that A&B's comments amounts to reject that modus ponens holds for it, although I take their comment to imply that they regard → to be a conditional for which modus ponens holds. That is, the argument from A and A → B to B is valid, according to A&B. However, the sense in which it is valid is itself enthymematic: is not. Just after noting that "A ∨ B is no kind of conditional, since modus ponens fails for it, as we have remarked ad nauseam before," A&B go on [t]o console the reader who thinks we have gone completely out of our minds we note that there is a connective, namely the enthymematic implication of § 35, for which both the Official deduction theorem and modus ponens holds. 22 The existence of such an "if …then -," one which we have often used in this book, and indeed one could hardly get along without (think of what it would be like always to state all the premisses for your argument), probably accounts, in part, anyway, for the attractiveness of the view that the Official deduction theorem has something to do with "if …then -." (Anderson and Belnap 1975, p. 259) I take it, then, that A&B do regard having at least one conditional for which an enthymematic deduction theorem holds is of utmost importance. It is, however, important to note that A&B nowhere indicate that having such a conditional is itself to be viewed as a relevance criterion. Rather, I suggest, that it be viewed as an adequacy criterion on the theory of entailment pertaining to expressive strength. In light of Maksimova's result for E t [γ ] and the t-version of it provided here, it seems that E t [γ ] and R t [γ ] do satisfy A&B's requirement of having an enthymematic conditional seeing as → has exactly the same properties in E t [γ ](R t [γ ]) as → has in E t (R t ). It seems, then, that having a conditional for which the enthymematical deduction theorem holds isn't a "nice" property either.
There is, however, one "nice" property that E t (R t ) has, but which E t [γ ](R t [γ ]) lacks, namely rule normality: Definition 15 (Rule normality) A logic L satisfies rule normality just in case for every primitive rule {A 1 , . . . , A n } B of L, ∅ h L A 1 ∧ . . . ∧ A n → B Note, then, that AE and M also satisfy this "nice" property, but that E t [γ ] and R t [γ ] do not. The criterion of rule normality can be found in Belnap (1960b, p. 12). 23 Belnap lists this property as one of in total ten "mandatory" conditions on an adequate theory of entailment. One can, however, only speculate as to Belnap's reason for demanding rule normality as he never gives an argument for why it is mandatory. Note, then, that rule normality is not explicitly stated as a general requirement in either Anderson and Belnap (1975) or Anderson et al. (1992). Rule normality is mentioned in Anderson and Belnap (1975) in connection with the necessitation rule. A&B think that the rule {A} A should in the case of E be admissible for the consequence relation h . Many modal logics are formulated with a primitive admissible rule, something like ∅ h A ⇒ ∅ h A. A&B, however, say that such a "non-normal [rule], in the sense that the corresponding implication A → A is not a theorem, […] [yields a system which] lacks elegance." (Anderson and Belnap 1975, p. 117). They even liken having such a primitive admissibility rule of necessity to having simply A → A as a theorem: Both courses are equally odious, the latter because it destroys the notion of necessity, and the former because, if A → A is neither true nor a theorem, then we ought not to have -in a coherent formal account of the matter -a primitive rule to the effect that A does after all follow from A. (Anderson and Belnap 1975, p. 235) This latter quote, then, seems to indicate that A&B did accept rule normality as a selection criteria. 24 Undoubtedly, however, rule normality does not either belong in the category of relevance-properties, although it may very well be listed as a more general adequacy condition on a theory of entailment seeing as it yields that every primitive rule yields a true entailment. Even if it is deemed a necessary condition for an adequate theory of entailment as A&B seem to think, however, such a theory need not rule the material conditional a conditional non grata seeing as both AE and M are rule normal.
We have in this section seen that the enthymematical deduction theorem holds for AE and M in precisely the same manner for which it holds for E t and R t , namely where the deduction theorem is stated using →, where A → B = d f A ∧ t → B. This, we saw, was not the case for E t [γ ] and R t [γ ]. However, we saw that these logics do have an enthymematical deduction theorem only relative to a different enthymematic conditional, namely the conditional A → B = d f A ∧ t → f ∨ B. We saw that A&B did acknowledge → as a proper conditional, but that they denied that → was a proper conditional on account of it, like the material conditional, didn't satisfy modus ponens.
Note, then, that modus ponens holds for → if and only if it holds for the material conditional. Modus ponens does not hold for the material conditional in E; however, this section has made it clear that ruling the material conditional to be "no kind of conditional" (Anderson and Belnap 1975, p. 259) using either the requirement of an enthymematic deduction theorem, or rule normality, is unfounded. The next section looks into the use-criterion for relevance, that, intuitively, A does not entail B unless any proof of B from A must use A. We will see that neither it can be used to rule the material condition a non-conditional.

The Entailment theorem
We have so far seen that AE and M have the same variable sharing property as E t and R t do. The other relevance property presented by A&B was meant to capture a notion of premise use, that the conclusion ought to follow from the premisses; the thought being roughly that if the conclusion follows without using the premises, then it doesn't really follow from them. This notion of following from is not captured in the Hilbertian notion of logical consequence: even for logics like E it is the case that B → B follows logically from an arbitrary formula A: {A} h E B → B. As mentioned in the introduction, A&B sought to find not only a new entailmentconditional, but one such which could be read as expressing a new notion of logical consequence altogether: the consequence relation called entailment by A&B and which their entailment-conditional → was meant to express. Since, however, the consequence relation is definable for logics which are not thought of as expressing entailment-the conditional of R, for instance, is rather to be thought of as a demoalized version of E's → expressing rather a contingent notion of logical consequence referred to as simply relevant implication-I will rather call the consequence relation relevant. 25 Given any conditional and a consequence relation relating, as the Hilbertian one does, sets of formulas to single formulas, one may define a new consequence relation simply by letting Γ B if and only if there exists a set {A 1 , . . . , A n } ⊆ Γ such that ∅ i≤n A i B. This is, in effect what A&B did in trying to tease out a notion of use of premises. Their notion of a relevant consequence relation is as follows: Definition 16 (The relevant consequence relation) A relevant deduction of a formula A from a set of formulas Γ in the logic L having only modus ponens, (α), and adjunction, (β), as primitive rules, is defined as a Hilbert proof A 1 , . . . , A n of A from Γ such that it is possible to mark the A i 's with #'s according to the following rules: 1. If A i ∈ Γ , then A i is marked. 2. If A i is obtained from A j and A k using modus ponens, then A i is marked if either or both of A j and A k are marked. 3. Adjunction is only used on premises which are either both marked or both unmarked.

If
A i is obtained from A j and A k using adjunction and both of A j and A k are marked, then A i is marked. 5. No other formulas are marked. 6. As a consequence of (1-5), A n is marked.
The existential claim that there is such a proof is written Γ r L A and expressed as "there exists a relevant derivation of A from Γ in the logic L." A&B's so-called Entailment theorem states that This property was regarded by A&B as necessary and sufficient for avoiding what they deemed to be relevant fallacies. I showed in Øgaard (2019, thm. 9) that the property also holds for the explosive logic E . As there pointed out, however, the property holds for virtually any logic with no more primitive rules than modus ponens and adjunction, and so even classical logic has this property. Having the Entailment theorem, therefore, cannot be regarded as a sufficient property if the variable sharing property is, as A&B thought, a necessary property for avoiding the paradoxes of implication.
The proof of the Entailment theorem in Øgaard (2019) is easily seen to hold for AE and M. It does not, however, extend to logics with other primitive rules than adjunction and modus ponens for → for the simple reason that such logics are ruled out by definition. Thus relevant consequence is simply not defined for E t [γ ] and R t [γ ] using A&B's notion of entailment. It is, however, easy to modify the definition of a relevant deduction so as to cover also these two logics: first of all, the rule-restriction must be lifted so as to allow for (γ ). Secondly, we update the #-rules so as to include -(γ ) is only used on unmarked premises -If A i is obtained using (γ ), then A i is unmarked.
This, then, is in effect to limit the application of (γ ) to logical theorems. Since, however, (γ ) is admissible in E t and R t , an easier option is in fact to simply outlaw any application of (γ ). Either way, however, using the same type of proof as in Øgaard (2019, thm. 9) it follows that the Entailment theorem also holds for E t [γ ] and R t [γ ]. All the h -explosive logics E t [γ ], R t [γ ], AE and M, then, satisfy the use-criterion for relevance, namely the Entailment theorem: Øgaard (2019) tentatively suggested that there is nothing more substantial to relevant logics than satisfying the variable sharing property. One of the reasons given for this was that the Entailment theorem as stated by A&B only applies to logics having only modus ponens and adjunction as primitive rules. As it is not evident how it can be modified to cover logics with other rule-sets, demanding that the Entailment theorem should hold, then, seemed to exclude a wide range of logics from consideration too hastily. Note, then, that even if it is upheld as a necessary relevance property, that will not necessarily rule logics with an explosive h -relation irrelevant, not even logics with modus ponens for the material conditional as a primitive rule. 26

The two consequence relations relations of E t , E t [ ] and AE
We have seen that → and the enthymematic conditional → represent different consequence relations. I mentioned in Sect. 7 that in the case of E t , modus ponens holds for → only enthymematically. This, then, translates to the fact that Thus if t-that is the full might of the logical resources entrusted to the logical axioms-might be called upon unrestrictedly, then modus ponens holds for →. If, as is generally the case with r for E t , E t [γ ], R t , R t [γ ], AE and M, however, one can not always conjure up t as a logically unrestricted resource, then modus ponens does not hold for → seeing as B fails to be relevantly derivable from A and A → B.
Relevant logics are often motivated as being able to support inconsistent theories non-trivially. Note, then, that it is the presence of these two consequence relationsh and r -that allow logics like AE to non-trivially support inconsistent theories, yet insist that there is something amiss with inconsistency. Such theories can indeed be closed under r , but cannot without trivializing be closed under h . Note, then, that if a set of formulas is closed under r , and contains every logical truth of AE, then it is also closed under h . Inconsistent r -theories, then, cannot, according to AE, be what is called regular theories, that is they cannot contain all the logical theorem-every A such that ∅ h A. Sometimes it is impertinent to use the Hilbertian consequence relation, as, for instance, when reasoning with counterpossibles; A ∧ ∼A is, according to AE, necessarily false, yet it is not the case that any conditional with A ∧ ∼A as antecedent is vacuously true. Nor is it the case that any old contradiction entail whatever on just any reading of 'entails.' Quite the contrary, in general it is not the case that B is entailed, given the relevant notion of entailment as relevant deducibility, from a contradictory set of premises seeing as it is not always the case that {A, ∼A} r B. Sometimes, however, one ought to, to paraphrase Achilles (cf. Carroll (1895, p. 280)), let Logic take you by the throat, and force you to accept the conclusion. The forcing does not happen by the might of the premises alone-not always at least-rather it is the premises together with the logical resourses available that conjointly force the conclusion. In this sense it is the case, say AE, that {A, ∼A, t} r B, since t is to be interpreted as the combined resources of pure logic. (A ∧ ∼A) ∧ t is also necessarily false, yet any conditional having it as antecedent is vacuously true according to AE. AE can, therefore, also differentiate between counterpossibles and between two different notions of consequence.
Note, then, that AE (and similarly for M) is a quite different logic than its explosive sibling E t [γ ]. The latter logic can non-trivially support inconsistent yet regular theories since it is not the case that {A, ∼A, t} r E t [γ ] B. Using the t/f-enthymematical deduction theorem and the Entailment theorem, however, the only thing that we can infer from such inconsistent theories is that f ∨ B belongs to it: if both A, ∼A and t are members of Γ and this set is closed under r E t [γ ] ,  27 Thus an inconsistent and regular set of formulas will if closed under r E t [γ ] or r E t contain the logical falsehood f, but it can very well be the case that the theory is non-trivial. Lastly, note that this latter fact set E t [γ ] apart from both AEand E t : for the latter two logics it is the case that any regular relevant theory-a set of formulas containing all the axioms and closed under r -will also be closed under h . Not so for regular and relevant E t [γ ]-theories which then need not be closed under its primitive rule (γ ).

Pluralism on the cheap
We have seen how Anderson and Belnap wanted a new theory of entailment, one in which entailment itself was expressible using an object-language conditional. In addition to this, however, they thought that such a theory should be able to express a notion of enthymematic entailment: entailments which are true if only a suppressed true premises is stated explicitly. Whereas the entailment conditional → expresses what A&B thought to be entailment itself, and that the enthymematic conditional only expressed a second-rate version of entailment, both express what can be taken to be consequence relations. At a first glance it seems that A&B only accepted relevant consequence as being a proper consequence relation. The Entailment theorem, however, shows that the relevant consequence relation and the Hilbertian one are interdefinable: even though A&B quite forcefully rejected B → B to be a logical consequence of A, in the sense of not being entailed by A, they quite happily accepted that B → B is enthymematically entailed by A.
A&B write of the Hilbertian notion of consequence in a rather disapproving waythey talk of "Officers" adhering to the "Official" position for which terms like "deduction," "from," "premiss," "proof," "hypothesis," "valid," "demonstration," "consequence," and "argument" have virtually no connection with the same terms as understood outside the Official context-even by the Offi-cer himself, when he takes off his uniform […]. (Anderson and Belnap 1975, p. 258) Seeing, however, as this "Official" notion of consequence shows up as a quite valid, although enthymematically so, notion of logical consequence, one should not conclude that A&B sought to completely replace the Hilbertian notion of consequence with their relevant one. 28 I suggest, rather, that their view is more fruitfully viewed as a pluralistic one: both the relevant and the Hilbert consequence relations apply without restriction, according to A&B, irrespective of subject matter. Adhering to the correctness of both amounts, then, to what Haack (1978, ch. 12) calls global pluralism. Haack ties global pluralism to meaning variance. Hjortland (2013), however, argued that there is one brand of pluralism about logical consequence, namely intra-theoretic pluralism, which is not wedded to meaning variance, at least not to what he calls B-type meaning variance. The basic idea is that B-type meaning variance can occur when different logical systems assign different proof/truth-conditions to a connective and thereby assign different meanings to it. If, however, two consequence relations are definable over the same logical system, then such meaning variance would not occur: "rather than simply the claim that there is more than one admissible consequence relation, intra-theoretic pluralism combines more than one consequence relation in a single logical theory (Hjortland 2013, p. 365). The examples that Hjortland mentions include instances where the same proof system can be used to define more than one consequence relation. This, we have seen, is also the case for the consequence relations h and r for logics such as AE: both are defined over the same proof system, namely over the same set of axioms and rules. 29 The cases that Hjortland mentions, however, requires commitment to the correctness of at least two ways of defining logical consequence over a proof system seeing as he does not require that the consequence relations be expressible via deduction theorems. 30 In our case, however, the pluralism is a free lunch as the commitment to both the Hilbertian consequence relation as well as the relevant one can be economized to just one seeing as the one is expressible in the other. Just as A&B incorporate relevant consequence and its enthymematic sibling to account for valid arguments and "merely" enthymematically valid argument, Hjortland states that Philosophers who think that these systems contain useful consequence relations for modelling different reasoning phenomena can use intra-theoretic pluralism as a way to think about logical theories that combine the consequence relations in a unified theory. 28 Or if they did, one should conclude that they shouldn't have. 29 On the semantical side, Hjortland (2013, fn. 13) mentions global vs. logic semantic consequence in Kripke semantics. Note, then, that the model-theoretic equivalent of h and r are in the case of logics such as E t truth-preservance over the "normal" states-those which validate every logical axiom-whereas the semantic equivalent of r is truth-preservance over every state. The semantic equivalent of h for E t [γ ], however, is truth-preservance over the "base" world seeing as other "normal" states need not treat (γ ) as a truth-preserving rule. For the semantics of E t and E t [γ ], see Routley et al. (1982, appendix 1). 30 One of the examples Hjortland mentions is the case where the consequence relations of the three-valued logics K3 and LP are defined using the same three-sided sequent system. Neither of these logics have a conditional for which a deduction theorem holds-K3 has in fact no logical theorems, whereas Beall et al. (2013) showed that LP has no non-trivial way of defining a conditional for which modus ponens holds.
Viewing A&B's theory of entailment as a pluralistic take on logical consequence yields a more liberal account of their view than their own iconoclastic presentation of it at times seems to allow for. Note, then, that A&B did regard having an enthymematic conditional with a deduction theorem relative to the Hilbertian consequence relation as something "one could hardly get along without" (Anderson and Belnap 1975, p. 259). Should an A&B-inspired relevantist find that h does not correspond to an admissible notion of logical consequence, then not only will A&B's sine qua non criterion of having an enthymematic conditional have to be given up, but the theory of entailment has to be altered so as to make no such enthymematic conditional definable. In the case of E this implies giving up not only the Ackermann constant, but also A&B's favorite way of defining → using propositional quantifiers. Even if such be abnegated, however, it seems that h may quite reasonably be argued to be expressible enthymematically seeing as t can in fact be contextually defined so that (simplifying to the one-premise where t is the long conjunction of every p → p for every propositional variable p occurring in the proof of B from A. 31 Whatever may be the correct account of A&B's views of these matters, however, their selection criteria for an adequate theory of entailment seem to commit them to intra-theoretic pluralism about logical consequence. One may try to resist this by sharpening and reevaluating the selection criteria. I suggest, however, that one rather try to enjoy a free lunch. 32

Summary
This paper has provided a systematic account of the selection criteria Anderson and Belnap appealed to in giving what they argued to be a more adequate theory of entailment. These criteria were categorized into three groups: the modal properties, the relevance properties, and the properties pertaining to expressive strength. This paper has shown that A&B's original relevant logics, E and R, can be extended to become strong and natural explosive logics. There are two ways of doing so: the first is to simply add Ackermann's (γ )-rule-modus ponens for the material conditional, that is disjunctive syllogism-as a primitive rule. This rule is admissible in both E and R, and so the extension is conservative. Anderson and Belnap thought that adding (γ ) as a primitive rule would destroy the "nice" features of E. However, the modal features of E and quite evidently retained. I've also shown that both of the relevance properties-the variable sharing property and the use-criterion formalized as the Entailment theorem-are both retained if (γ ) is added to either E or R. It was shown, however, that the addition does affect the properties related to expressive strength. Adding (γ ) results in the failure of the enthymematical deduction theorem for the defined conditional A ∧ t → B, where However, the expressive criterion of rule normality, that every primitive rule should correspond to a true entailment, fails, seeing as A ∧ (∼A ∨ B) → B cannot hold true in any logic which satisfies the variable sharing property seeing as it would yield the explosion axiom A ∧ ∼A → B. 33 Even though the explosion axiom cannot be a general theorem of a relevant logic, instances of it can be. The other way of extending E and R is to simply add t ∧ f → A, where f = d f ∼t. It was shown that the logics obtained by doing so-called AE and M-retain all of the properties appealed to by Anderson and Belnap in settling on E and R. AE and M, unlike E and R, however, have (γ ) as a derivable rule, and the deduction theorem holds for the material conditional in both logics. The conclusion, then, is that the material conditional cannot be ruled as being "no kind of conditional" using the selection criteria Anderson and Belnap put forth. Not even, to once again use A&B's phrase, if we bend over backward and uphold not only the legitimacy of the selection criteria, but also what these were thought to select, namely E and R.
At last it was suggested that Anderson and Belnap's take on logical consequence ought to be seen as what Hjortland (2013) calls intra-theoretic pluralism: I've argued that Anderson and Belnap in fact end up having to endorse not only the relevant notion of consequence, but also the Hilbertian notion of consequence seeing as the latter is expressible as an enthymematical version of the former.
Funding Open access funding provided by University of Bergen (incl Haukeland University Hospital).
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Appendix: Enthymematic conditionals and deduction theorems
This appendix regards the three enthymematic conditionals →, → and , where and the deduction theorems they support. 33 This, of course, assumes that → is provably transitive. There are non-transitive approaches to relevant logics, although going further into this is beyond the scope of this paper.

Theorem 8 (t-enthymematic deduction theorem) Let L be any axiomatic extension of E t for which the rule C h t → C is at least admissible, then
Proof The right to left direction is trivial since modus ponens holds for → and t is a theorem. The other direction is an induction on the length of proof. To make the presentation a bit friendlier, let A be the formula i≤n A i ∧ t. Assume that B 1 , . . . , B n is the Hilbert proof of B from {A 1 , . . . , A n }. Then if B j is one of the A i 's, A → B j is obviously a logical theorem. If B j is an axiom, then since {C} h t → C is admissible, we get that t → B j is a theorem, and therefore that A → B j is too. Now assume that B j is obtained from some B k and B l using adjunction (the β-rule). We may then assume for inductive hypothesis that both A → B k and A → B l are theorems. Since (A → B k ) ∧ (A → B l ) → (A → B k ∧ B l ) is an instance of (Ax5), we then get that A → B k ∧ B l is a theorem.
Assume lastly that B j is obtained from some B k and B l using modus ponens (the αrule), and let B l therefore be the formula B k → B j . From the inductive hypothesis that both A → B k and A → (B k → B j ) are theorems, one gets A → (B k ∧ (B k → B j )) using (Ax5). Since B k ∧ (B k → B j ) → B j is a logical theorem, we then get A → B j which then ends the proof.
Theorem 10 (t/f-enthymematic deduction theorem) Let L be any axiomatic extension of E t [γ ] for which the rule {C} h t → C is at least admissible, then Proof The right to left direction is as the above proof, only with an added application of (γ ) in order to derive B from f ∨ B and t. The left to right direction is in the base case also similar to the proof above. That leaves only the three primitive rules. Again we let A be the formula i≤n A i ∧ t.
In the case of adjunction the inductive hypothesis yields that both A → f ∨ B k and A → f ∨ B l are logical theorems. Using (Ax5) we then obtain that is a logical theorem (use the distribution axiom (Ax4)), and so A → f ∨ (B k ∧ B l ) follows by transitivity.
In the case of modus ponens the inductive hypothesis yields that both A → f ∨ B k and A → f ∨ (B k → B j ) are theorems, and so, as in the adjunction-case, we get that A → f ∨ (B k ∧ (B k → B j )) is a theorem as well. B k ∧ (B k → B j ) → B j is a logical theorem (use the contraction axiom (Ax7)), and so simple fiddling yields that so is f ∨ (B k ∧ (B k → B j )) → f ∨ B j . Transitivity of →, then, yields A → f ∨ B j .
In the case of (γ ) the inductive hypothesis yields that both A → f ∨ B k and A → f ∨ (∼B k ∨ B j ) are theorems. Using Lemma 3 below, then, yields A → f ∨ B j which ends the proof.