Add Journal to My Library
Journal of Logic and Computation
, Volume 28 (2) – Mar 1, 2018

18 pages

/lp/ou_press/on-the-transitivity-of-consequence-relations-i0KnO0Tzr0

- Publisher
- Oxford University Press
- Copyright
- © The Author, 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com
- ISSN
- 0955-792X
- eISSN
- 1465-363X
- D.O.I.
- 10.1093/logcom/exx039
- Publisher site
- See Article on Publisher Site

Abstract A binary relation $$R$$ on a set $$S$$ is transitive iff for all $$a, b, c \in S$$, if $$aRb$$ and $$bRc$$, then $$aRc$$. This almost never applies to the relations logicians tend to think of as consequence relations; where such relations are relations on a set at all, they are rarely transitive. Yet it is common to hear consequence relations described as ‘transitive’, and to see rules imposed to ensure ‘transitivity’ of these relations. This article attempts to clarify the situation. 1 Introduction After briefly substantiating the claims in the abstract, this article focuses on exploring a number of different properties of consequence relations that have traveled under the name ‘transitivity’, mapping the implications among them. From here forward, I will use ‘transitive’ and ‘transitivity’ very little, and only in their standard relation-theoretic sense: a relation $$R$$ is transitive iff it is a binary relation on a set $$S$$ such that for any $$a, b, c \in S$$, if $$aRb$$ and $$bRc$$, then $$aRc$$. Many familiar consequence relations, however, are not relations on a set at all, but instead relate sets of formulas (collections of premises) to single formulas (conclusions). That is, where $$\mathcal{F}$$ is the set of formulas under consideration, such a relation is a relation between $$\wp(\mathcal{F})$$ and $$\mathcal{F}$$. Following [9, §1.21], I will say these relations work in the ‘$$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ framework’. Such a relation is not the right kind of thing to be transitive. Of course, these relations can, and frequently do, exhibit a number of properties that are reminiscent of transitivity in various ways. This article will explore some of the variety among these properties. I won’t restrict my attention to the $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ framework, though. I will in addition consider consequence relations in the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ framework. In this framework, consequence relations really are binary relations on a single set: the set $$\wp(\mathcal{F})$$. That is, they relate sets of formulas to sets of formulas. So they are at least the right kind of relation to be transitive. Much research into $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations (see e.g. [7, 9, 11, 17, 22, 23]) interprets the members of the set of conclusions as (in some sense) different possibilities. On this interpretation, arguments with fewer conclusions are stronger than those with more, since they narrow down more finely on a result. This is the interpretation I’ll focus on in what follows.1 These relations, too, are almost never transitive. Consider, for example, the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation $$\vdash$$ determined by classical logic, explored and defended in [11], among other places. This relation relates $$\{A \vee B\}$$ to $$\{A, B\}$$, and relates $$\{A, B\}$$ to $$\{A \wedge B\}$$, but does not relate $$\{A \vee B\}$$ to $$\{A \wedge B\}$$; it is thus not transitive. The reason is nothing particularly to do with classical logic; it is instead to do with how sets of formulas are interpreted. As premises, they are meant conjunctively: as all available to be drawn on together in establishing conclusions. As conclusions, they are meant disjunctively: as jointly exhausting the space where the truth must lie, given the premises.2 This difference in interpretation prevents linking valid $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ arguments together in the simple way guaranteed by transitivity; an attempt to apply transitivity to these $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ arguments would result in something like an equivocation. This article only considers $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ and $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations; I won’t consider other options here. (See, again, [9, §1.21].) 2 Linking properties In this section, I lay out the assumptions that will frame the article, and then present a catalogue of five properties that a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relation might exhibit, and twelve properties that a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation might exhibit, all of which, I think, are recognizable as related to what logicians often mean by ‘transitivity’ as applied to these relations. These properties form the basis of the article, which fully maps the implications among arbitrary conjunctions of these properties. Some notational preliminaries: I use capital Roman letters for formulas, and capital Greek letters (that are not also capital Romans) for sets of formulas. $$\mathcal{F}$$ is the set of formulas in the language under consideration, considered to be fixed throughout. When I talk of ‘partitions’ of a set, this should be understood to include partitions with an empty entry; e.g., $${\langle{\emptyset, \Sigma}\rangle}$$is a partition of $$\Sigma$$, on this usage. I abbreviate freely in usual sequent-calculus ways, so, for example, ‘$${{\Gamma, A, \Sigma} \vdash {}}$$’ abbreviates ‘$${{\Gamma \cup \{A\} \cup \Sigma} \vdash {\emptyset}}$$’. Note that this means ‘$$\Gamma \vdash A$$’ should be interpreted differently depending on whether $$\vdash$$ is a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ or $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation. If the former, then ‘$$A$$’ here is no abbreviation; it names the formula $$A$$. If the latter, then ‘$$A$$’ here is an abbreviation, standing for the singleton set $$\{A\}$$. 2.1 Assumptions I assume in places that the language $$\mathcal{F}$$ contains infinitely many formulas; its cardinality does not otherwise matter. I make no assumptions about the nature or structure of formulas; $$\mathcal{F}$$ can be any infinite set. Consequence relations are often defined as relations that are ‘reflexive, monotonic, and transitive’. The final condition, of course, is the subject of this article, so I am certainly not assuming it. I will, however, assume throughout the article that all consequence relations are monotonic. For $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations $$\vdash$$, this means that whenever $$\Gamma \vdash A$$, then $$\Gamma, \Gamma' \vdash A$$; for $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations $$\vdash$$, this means that whenever $$\Gamma \vdash \Delta$$, then $${{\Gamma, \Gamma'} \vdash {\Delta, \Delta'}}$$.3 This assumption matters a great deal; the situation is very different if this assumption is not imposed, and many of the results to follow would not hold without it. A $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relation $$\vdash$$ is compact iff whenever $$\Gamma \vdash A$$, then there is a finite $${\Gamma_\text{fin}} \subseteq \Gamma$$ such that $${\Gamma_\text{fin}} \vdash A$$; a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relation $$\vdash$$ is compact iff whenever $${{\Gamma} \vdash {\Delta}}$$, then there are finite $${\Gamma_\text{fin}} \subseteq \Gamma$$ and $${\Delta_\text{fin}} \subseteq \Delta$$ such that $${{{\Gamma_\text{fin}}} \vdash {{\Delta_\text{fin}}}}$$. In what follows, I will not require compactness in general, but I will keep track of compactness, and show what the effects of requiring compactness are. (This is the reason for requiring $$\mathcal{F}$$ to be infinite; if it could be finite, there might be no non-compact consequence relations on it.) Finally, reflexivity. ‘Reflexive’ here is like ‘transitive’; it does not have, in its usual application to $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ or $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations, its usual relation-theoretic sense. In the usual sense, a relation $$R$$ on a set $$S$$ is reflexive iff for all $$x \in S$$, $$xRx$$. For $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations, this cannot apply; these are not relations on a set. What is usually meant by ‘reflexivity’ in its applications to $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations is either (forgoing abbreviations for the moment): $$\{A\} \vdash A$$ for all $$A$$, or else $$\Gamma \cup \{A\} \vdash A$$ for all $$A$$ and $$\Gamma$$. Given monotonicity, these are equivalent to each other. For $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations, on the other hand, reflexivity in this sense can apply, but almost never does. It would require that for every set $$\Gamma$$ of formulas, $$\Gamma \vdash \Gamma$$; but at the very least, the empty set does not entail itself in any familiar setting. There are two usual things one might mean by ‘reflexivity’ here: that $${{\Gamma} \vdash {\Gamma}}$$ for all singleton$$\Gamma$$, or all nonempty$$\Gamma$$. Given monotonicity, these too are equivalent to each other. I will not assume reflexivity in what follows, although this turns out not to matter; all the results of the article remain unchanged with such an assumption in place. (To see this, note that all the consequence relations used as counterexamples are reflexive (in the usual senses for consequence relations, not the usual relation-theoretic sense), and that no proof of any claim depends on reflexivity (in any sense).) That, then, is all the preliminaries. 2.2 Properties of $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations The five properties of $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations that generate the present investigation are listed in Table 1. Each is a property that a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relation may or may not exhibit. Each of these is a closure property: they are all of the form ‘if these things stand in the relation, then those things must also stand in the relation’. They should be understood as universally quantified; for example, $$\vdash$$ has the property $${\small{\text{S}}}_{\small{\text{SF}}}$$ iff whenever $${C \vdash A}$$ and $${A \vdash D}$$, then $${C \vdash D}$$, for all choices of $$C, A,$$ and $$D$$. The properties of $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations that will be considered here are those in Table 1 and arbitrary conjunctions formed from these. Table 1. Linking properties for $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations If and then $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$B \vdash A$$ $$A\vdash C$$ $$B\vdash C$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ $$A\vdash C$$ $$\Gamma\vdash C$$ $$\downarrow_{\small{\text{SF}}}$$ $$\quad \vdash A$$ $$A, \Gamma\vdash C$$ $$\Gamma\vdash C$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ $$A,\Gamma\vdash C$$ $$\Gamma\vdash C$$ $${\small{\text{C}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash C$$ $$\Gamma\vdash C$$ If and then $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$B \vdash A$$ $$A\vdash C$$ $$B\vdash C$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ $$A\vdash C$$ $$\Gamma\vdash C$$ $$\downarrow_{\small{\text{SF}}}$$ $$\quad \vdash A$$ $$A, \Gamma\vdash C$$ $$\Gamma\vdash C$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ $$A,\Gamma\vdash C$$ $$\Gamma\vdash C$$ $${\small{\text{C}}}_{\small{\text{SF}}}$$ $$\Gamma\vdash A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash C$$ $$\Gamma\vdash C$$ Each allows valid arguments to be linked in a specific way; in the antecedent of these properties, the formula $$A$$ and/or the set $$\Sigma$$ of formulas figures among the conclusions of the left conjunct and the premises of the right conjunct, but does not appear in the consequent at all. I will call these properties ‘linking’ properties. The abbreviations for the properties are intended to be (at least somewhat) mnemonic without taking up too much space. (I pronounce them ‘simple’, ‘kinda simple’, ‘suppression’, ‘finite’, and ‘complete’, respectively, but I will stick entirely to the labels given in Table 1 in what follows.) I will discuss this selection in Section 3. 2.3 Properties of $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations Table 2 presents and names twelve properties that a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation may or may not exhibit. Each of the properties is again a closure property: ‘if these things stand in the relation, then those things must also stand in the relation.’ These too should be understood as universally quantified; for example, $$\vdash$$ has the property $${\small{\text{KS}}}$$ iff whenever $${\Gamma \vdash A}$$ and $${A \vdash \Delta}$$, then $${{\Gamma} \vdash {\Delta}}$$, for all choices of $$\Gamma, \Delta,$$ and $$A$$. The properties of $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations that will be considered here are those in Table 2 and arbitrary conjunctions formed from these. Table 2. Linking properties for $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations If and then $${\small{\text{S}}}$$ $$B \vdash A$$ $$\quad A\vdash C$$ $$B\vdash C$$ $${\small{\text{KS}}}$$ $$\Gamma\vdash A$$ $$ \quad A\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $$/\downarrow$$ $$\quad \vdash A$$ $$A, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $$\downarrow{/}$$ $$\Gamma\vdash \Delta, A$$ $$\quad A\vdash \quad$$ $$\Gamma\vdash \Delta$$ $$/{\small{\text{F}}}$$ $$\Gamma\vdash A$$ $$A,\Gamma\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{F}}}/$$ $$\Gamma\vdash \Delta,A$$ $$\quad A\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{FG}}}$$ $$\Gamma\vdash \Delta,A$$ $$A,\Gamma\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $$/{\small{\text{C}}}$$ $$\Gamma\vdash A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{C}}}/$$ $$\Gamma\vdash \Delta, \Sigma$$ $$\quad A\vdash \Delta$$ for all $$A \in \Sigma$$ $$\Gamma\vdash \Delta$$ $${/\small{\text{C}}}^+$$ $$\Gamma\vdash \Delta,A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{C}}}^+/$$ $$\Gamma\vdash \Delta, \Sigma$$ $$A,\Gamma\vdash \Delta$$ for all $$A \in \Sigma$$ $$\Gamma\vdash \Delta$$ $${\small{\text{CG}}}$$ $${{\Sigma^+, \Gamma} \vdash {\Delta, \Sigma^-}}$$ for all partitions $${\langle{\Sigma^+, \Sigma^-}\rangle}$$ of $$\Sigma$$ $$\Gamma\vdash \Delta$$ If and then $${\small{\text{S}}}$$ $$B \vdash A$$ $$\quad A\vdash C$$ $$B\vdash C$$ $${\small{\text{KS}}}$$ $$\Gamma\vdash A$$ $$ \quad A\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $$/\downarrow$$ $$\quad \vdash A$$ $$A, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $$\downarrow{/}$$ $$\Gamma\vdash \Delta, A$$ $$\quad A\vdash \quad$$ $$\Gamma\vdash \Delta$$ $$/{\small{\text{F}}}$$ $$\Gamma\vdash A$$ $$A,\Gamma\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{F}}}/$$ $$\Gamma\vdash \Delta,A$$ $$\quad A\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{FG}}}$$ $$\Gamma\vdash \Delta,A$$ $$A,\Gamma\vdash\Delta$$ $$\Gamma\vdash \Delta$$ $$/{\small{\text{C}}}$$ $$\Gamma\vdash A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{C}}}/$$ $$\Gamma\vdash \Delta, \Sigma$$ $$\quad A\vdash \Delta$$ for all $$A \in \Sigma$$ $$\Gamma\vdash \Delta$$ $${/\small{\text{C}}}^+$$ $$\Gamma\vdash \Delta,A$$ for all $$A \in \Sigma$$ $$\Sigma, \Gamma\vdash \Delta$$ $$\Gamma\vdash \Delta$$ $${\small{\text{C}}}^+/$$ $$\Gamma\vdash \Delta, \Sigma$$ $$A,\Gamma\vdash \Delta$$ for all $$A \in \Sigma$$ $$\Gamma\vdash \Delta$$ $${\small{\text{CG}}}$$ $${{\Sigma^+, \Gamma} \vdash {\Delta, \Sigma^-}}$$ for all partitions $${\langle{\Sigma^+, \Sigma^-}\rangle}$$ of $$\Sigma$$ $$\Gamma\vdash \Delta$$ As with the $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties, each of these allows valid arguments to be linked in a specific way; in the antecedent of these properties, the formula $$A$$ and/or the set $$\Sigma$$ of formulas figures among the conclusions of the left conjunct and the premises of the right conjunct, but does not appear in the consequent at all. ($${\small{\text{CG}}}$$ is the only exception to this, as its antecedent does not have left and right conjuncts.) Two of these properties—$${\small{\text{S}}}$$ and $${\small{\text{KS}}}$$—are special cases of transitivity. The others, however, are not. The abbreviations for the properties are intended to be (at least somewhat) mnemonic without taking up too much space. The properties on this list that have received the most attention are $${\small{\text{S}}}$$ for ‘simple’, $${\small{\text{FG}}}$$ for ‘finite generalized’, and $${\small{\text{CG}}}$$ for ‘complete generalized’.4 A number of the properties in Table 2 are lopsided, focussing in on either the premise or conclusion side of the relation in question. The abbreviations for these properties include a ‘/’; where the property focusses on the premise side, a letter appears before ‘/’, and where it focusses on the conclusion side, a letter appears after ‘/’. The ‘$${\small{\text{F}}}$$’ and ‘$${\small{\text{C}}}$$’ are again for ‘finite’ and ‘complete’. $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations bring possibilities for symmetry that are absent with $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations. Each property in Table 2 has a dual also in the table. Properties $$P$$ and $$P'$$ are duals, in the sense relevant here, iff: for a consequence relation $$\vdash$$ to have $$P$$ is for its converse $$\dashv$$ to have $$P'$$. The properties $${\small{\text{S}}}$$, $${\small{\text{KS}}}$$, $${\small{\text{FG}}}$$ and $${\small{\text{CG}}}$$ are all self-dual. For the remaining properties, the names indicate duality; for example, $${\small{\text{/F}}}$$ and $${\small{\text{F/}}}$$ are duals. Also, monotonicity and compactness are both self-dual; a relation $$\vdash$$ meets each of them iff its converse $$\dashv$$ does. Noting these symmetries will allow for some of the following proofs about $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations to get away with only half the work they would otherwise take. For example, once we see that $${\small{\text{FG}}}$$ implies $${\small{\text{/F}}}$$, we can immediately conclude that it implies $${\small{\text{F/}}}$$ as well; and once we see that $${\small{\text{/C}}}^+$$ does not imply $${\small{\text{C}}}^+/$$, we can immediately conclude that $${\small{\text{C}}}^+/$$ does not imply $${\small{\text{/C}}}^+$$ either. I will use this style of reasoning frequently in what follows. 2.4 Counterparts Following [22, Ch. 5], say that a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relation $$\vdash$$ and a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation $$\vdash'$$ are counterparts iff they agree on single-conclusion arguments: $$\Gamma \vdash A$$ iff $$\Gamma \vdash' A$$, for every $$\Gamma$$ and $$A$$. (Note that every $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relation has many $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ counterparts, while each $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relation has a unique $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ counterpart.) When a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relation $$\vdash$$ and a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relation $$\vdash'$$ are counterparts, there are some implications that connect Tables 2 and 1. Extend the notion of counterparts to properties in these tables as follows: $${\small{\text{S}}}$$ and $${\small{\text{S}}}_{\small{\text{SF}}}$$ are counterparts. $${\small{\text{KS}}}$$ and $${\small{\text{KS}}}_{\small{\text{SF}}}$$ are counterparts. $${/}\downarrow$$ and $$\downarrow_{\small{\text{SF}}}$$ are counterparts. $${\small{\text{/F}}}$$ and $${\small{\text{F}}}_{\small{\text{SF}}}$$ are counterparts. $${\small{\text{/C}}}$$ and $${\small{\text{C}}}_{\small{\text{SF}}}$$ are counterparts. No other properties are counterparts. So every property in Table 1 has a counterpart in Table 2, but not vice versa. Fact 1 A $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relation $$\vdash$$ has a property in Table 1 iff it has a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ counterpart that has the counterpart of that property. Proof. RTL is immediate: each instance of the $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ property in question corresponds directly to an instance of the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ property in question. LTR: Let $$\vdash'_{min}$$ be the minimal $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ counterpart of $$\vdash$$, defined as follows: $$\Gamma \vdash'_{\min} \Delta$$ iff there is a $$C \in \Delta$$ with $$\Gamma \vdash C$$. Let $$P$$ be the $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ property in question, and let $$P'$$ be its $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ counterpart. Then let $$\vdash'$$ be the closure of $$\vdash'_{min}$$ under $$P'$$. $$\vdash'$$ clearly has $$P'$$; it remains to show that it is a counterpart of $$\vdash$$. Suppose it is not. Then there are $$\Gamma, A$$ with $$\Gamma \vdash' A$$ and $$\Gamma \not\vdash A$$. This must be because there is some chain of applications of property $$P'$$ to arguments validated by $$\vdash'_{min}$$ that eventually yields $$\Gamma \vdash' A$$. If all the arguments in this chain have a singleton set as their conclusion, then a corresponding chain could be run with property $$P$$ for $$\vdash$$, and we would have $$\Gamma \vdash A$$. So at least one argument in this chain has a conclusion that is not a singleton. But each of the five properties that $$P'$$ could be preserves the property of having a non-singleton conclusion (by inspection), so the chain itself must end in an argument whose conclusion is not a singleton. Contradiction. ■ 3 Previous work Each of the properties considered in Tables 1 and 2 has been considered elsewhere, except possibly for $${\small{\text{KS}}}_{\small{\text{SF}}}$$, which I include to have a counterpart to $${\small{\text{KS}}}$$. Indeed, every property I know of that is traveled under the name ‘transitivity’, and is applicable to $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ or $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations, is either in these tables already or else equivalent (given present assumptions) either to one that is or to a conjunction of ones that are.5 This section provides an overview and some brief discussion. 3.1 The cut rule In the present setting, $${\small{\text{F}}}_{\small{\text{SF}}}$$ is equivalent to: if $$\Gamma \vdash A$$ and $$A, \Gamma' \vdash C$$, then $$\Gamma, \Gamma' \vdash C$$. Similarly, $${\small{\text{FG}}}$$ is equivalent to the following property: if $$\Gamma \vdash \Delta, A$$ and $$A, \Gamma' \vdash \Delta$$, then $$\Gamma, \Gamma' \vdash \Delta, \Delta'$$. These properties, in turn, are closely connected to [7]’s rules of cut in the sequent calculi LJ and LK, respectively. (Just like ‘transitivity’, ‘cut’ means many different things in different contexts. Most of them, however, are related to Gentzen’s use of ‘cut’.) Cut looms large in many proof-theoretic investigations; $${\small{\text{F}}}_{\small{\text{SF}}}$$ and $${\small{\text{FG}}}$$, then, have real proof-theoretic import. But they also, at times, have philosophical import. For example, [11, 12] understand $${\small{\text{FG}}}$$ (as a condition on a particular $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation) as encoding the following constraint on certain conversational norms: if a certain combination of assertions and denials is within the norms, then for any formula $$A$$, either adding an assertion of $$A$$ to that combination remains within the norms, or else adding a denial of $$A$$ to that combination remains within the norms. [11, 12] endorse this constraint; [13, 14] dispute it. [24] considers related issues in a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ framework, and so deals with $${\small{\text{F}}}_{\small{\text{SF}}}$$. Other sequent-calculus-like proof systems relate to different properties. For example, the rule called the ‘Elimination Rule’ in [1, p. 387], ‘Display Cut’ in [2, p. 203], and just (a ‘form’ of) ‘Cut’ in [10, p. 125] is directly connected to $${\small{\text{KS}}}$$ in the same way that more traditional forms of cut are connected to $${\small{\text{F}}}_{\small{\text{SF}}}$$ and $${\small{\text{FG}}}$$. 3.2 Suppression $$\downarrow_{\small{\text{SF}}}$$, $${/}\downarrow$$, and $$\downarrow{/}$$ are properties of suppression, in the sense of [16, p. 71], which refers to $${/}\downarrow$$ as ‘Positive Suppression’ and $$\downarrow{/}$$ as ‘Negative Suppression’ (and calls $$\downarrow_{\small{\text{SF}}}$$ a ‘ridiculous classical property’). See also [16, §2.10] for an in-depth discussion of these properties, including relations to syllogistic and enthymematic argumentation. The authors put forward the ‘Anti-Suppression Principle’ on p. 146: ‘for every statement $$p$$ there is some statement $$q$$ such that the consequences of $$q$$ are a proper subset of the joint consequences of $$p$$ and $$q$$.’ The counterparts $$\downarrow_{\small{\text{SF}}}$$ and $${/}\downarrow$$, in different frameworks, each say that any theorem is an exception to this principle. 3.3 Bivaluations One way to present a consequence relation on a language $$\mathcal{F}$$ is via bivaluations: binary partitions $${\langle{T, F}\rangle}$$ of $$\mathcal{F}$$. By specifying a set $$\mathfrak{M}$$ of such partitions, one specifies a consequence relation $$\vdash_\mathfrak{M}$$ in the following ways: for a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence, $$\Gamma \vdash_\mathfrak{M} C$$ iff there is no $${\langle{T, F}\rangle} \in \mathfrak{M}$$ such that $$\Gamma \subseteq T$$ and $$C \in F$$; for a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence, $$\Gamma \vdash_\mathfrak{M} \Delta$$ iff there is no $${\langle{T, F}\rangle} \in \mathfrak{M}$$ such that $$\Gamma \subseteq T$$ and $$\Delta \subseteq F$$. (Informally, you might think: the argument is valid iff there is no model on which all the premises are true and the conclusion/all the conclusions false.) This way of thinking is stressed in [9, 22], but even where it is not stressed it is often applicable. For example, any way of presenting a consequence relation using models with designated values in the usual way fits this mould directly: we can understand each model as partitioning the language into those formulas that receive a designated value and those that do not. Consequence relations arrived at in this way have certain structural properties: they are reflexive (in the senses outlined in Section 2.1), monotonic, and have the property $${\small{\text{C}}}_{\small{\text{SF}}}$$ or $${\small{\text{CG}}}$$, depending on framework. (For proofs, see [22, pp. 16, 30].) As we will shortly see, $${\small{\text{C}}}_{\small{\text{SF}}}$$ implies all the other properties in Table 1, and $${\small{\text{CG}}}$$ implies all the other properties in Table 2. This means that bivaluations will not prove useful in what follows; they obscure the relations between the linking properties under consideration, by forcing them all to hold.6 Many monotonic $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ and $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations encountered in the wild can be presented in terms of bivaluations, and so exhibit either $${\small{\text{C}}}_{\small{\text{SF}}}$$ or $${\small{\text{CG}}}$$ and thus all the linking properties to be considered here. (Note, however, that [17, p. 83] complains that $${\small{\text{CG}}}$$ is overstrong, claiming that it requires ‘much more than the transitivity of consequence’. In context, Rumfitt is concerned to attack the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ framework entirely; elsewhere he defends a principle he calls ‘Cut’ that is equivalent (given monotonicity) to $${\small{\text{C}}}_{\small{\text{SF}}}$$ [18, p. 42].) It is only in cases where these properties fail that the distinctions explored here are revealed. 3.4 Quantum logic [6, p. 44] and [4] both consider forms of quantum logic in the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ framework, and attribute to it the conjunction of $${\small{\text{F/}}}$$ and $${\small{\text{/F}}}$$, which I will call $${\small{\text{F}}}/{\small{\text{F}}}$$. In quantum logic, distribution of conjunction over disjunction fails; as it happens, there are important connections between distribution and $${\small{\text{FG}}}$$.7 In these authors’ settings, quantum logic does not obey $${\small{\text{FG}}}$$, which they take to be a default expression of transitivity; $${\small{\text{F}}}/{\small{\text{F}}}$$ is substituted to ‘reflect the transitivity of implication’ [4, p. 247]. In both cases, the authors restrict their attention to compact relations, for which the conjunction of $${\small{\text{C/}}}$$ and $${\small{\text{/C}}}$$, which I will call $${\small{\text{C}}}/{\small{\text{C}}}$$, is equivalent to $${\small{\text{F}}}/{\small{\text{F}}}$$.8 (More on compactness presently.) Neither source discusses $${\small{\text{F/}}}$$ or $${\small{\text{/F}}}$$ on their own. 3.5 Neo-classical logic The ‘neo-classical’ logic explored in [25, 26], among other places, is another consequence relation that exhibits some of these properties but not others. Weir presents both $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ and $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ versions of neo-classical logic; as [26, p. 100] points out, these obey $${\small{\text{S}}}_{\small{\text{SF}}}$$ and $${\small{\text{S}}}$$, respectively. In fact they also obey $${\small{\text{KS}}}_{\small{\text{SF}}}$$ and $${\small{\text{KS}}}$$; as we will see, these are stronger. They also obey suppression properties: $$\downarrow_{\small{\text{SF}}}$$ for the $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relation and both $$\downarrow{/}$$ and $${/}\downarrow$$ for the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ one. However, neither exhibits any of the other properties in its associated table. [26, fn. 3] claims that $${\small{\text{S}}}$$ ‘should be incorporated in any genuine notion of logical consequence’, but does not elaborate; presumably Weir would say the same of $${\small{\text{S}}}_{\small{\text{SF}}}$$ for $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations. 3.6 Cut$$_3$$ There is also the property called ‘Cut$$_3$$’ in [22, p. 32]. A consequence relation $$\vdash$$ has Cut$$_3$$ iff whenever $${\Gamma \vdash \Delta, A}$$ for all $$A \in \Sigma_1$$, and $${B, \Gamma \vdash \Delta}$$ for all $$B \in \Sigma_2$$, and $${\Sigma_1, \Gamma \vdash \Delta, \Sigma_2}$$, then $${{\Gamma} \vdash {\Delta}}$$. But as is immediately shown there, Cut$$_3$$ is equivalent to the conjunction of $${\small{\text{C}}}^+/$$ and $$/{\small{\text{C}}}^+$$; I will later call this conjunction $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$.9 [21, p. 37], oddly, calls this property (there defined directly as the conjunction of $${\small{\text{C}}}^+/$$ and $$/{\small{\text{C}}}^+$$) ‘Cut’, and takes it to be of some import. In particular, Segerberg points to $${\small{\text{FG}}}$$, claims that it is not sufficient when infinite sets of premises and conclusions are considered, and then offers this property as the appropriate replacement, instead of (what one might have expected) $${\small{\text{CG}}}$$.10 He also points out that $${\small{\text{S}}}$$, which he calls ‘transitivity’, is a ‘very special case’ of this property (p. 38). I know of no other sources that have attended to this property. 4 Implications This section presents a range of implications that hold among the properties in Tables 1 and 2, and conjunctions formed from these properties. 4.1 Special cases Some implications from one property to another happen in the easiest possible way: when one property covers only certain special cases of another. These implications can be verified directly by inspection, and depend on no special assumptions. For $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties, this gives: $${\small{\text{KS}}}_{\small{\text{SF}}}$$ implies $${\small{\text{S}}}_{\small{\text{SF}}}$$. $${\small{\text{C}}}_{\small{\text{SF}}}$$ implies $${\small{\text{F}}}_{\small{\text{SF}}}$$. For $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties, this gives: $${\small{\text{KS}}}$$ implies $${\small{\text{S}}}$$. $${\small{\text{/C}}}$$ implies $${\small{\text{/F}}}$$. $${\small{\text{C/}}}$$ implies $${\small{\text{F/}}}$$. $${\small{\text{/C}}}^+$$ implies $${\small{\text{FG}}}$$. $${\small{\text{C}}}^+/$$ implies $${\small{\text{FG}}}$$. 4.2 Monotonicity Other implications are not so direct; these require some appeal to monotonicity. The needed appeals to monotonicity, however, are quite formulaic: when one property’s antecedent follows by monotonicity from another property’s antecedent, and they have the same consequent, then the first property implies the second. This gives more implications. For $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties, this gives: $${\small{\text{F}}}_{\small{\text{SF}}}$$ implies $${\small{\text{KS}}}_{\small{\text{SF}}}$$. $${\small{\text{F}}}_{\small{\text{SF}}}$$ implies $$\downarrow_{\small{\text{SF}}}$$. For $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties, this gives: $${\small{\text{/F}}}$$ implies $${\small{\text{KS}}}$$. $${\small{\text{F/}}}$$ implies $${\small{\text{KS}}}$$. $${\small{\text{/F}}}$$ implies $${/}\downarrow$$. $${\small{\text{F/}}}$$ implies $$\downarrow{/}$$. $${\small{\text{FG}}}$$ implies $${\small{\text{/F}}}$$. $${\small{\text{FG}}}$$ implies $${\small{\text{F/}}}$$. $${\small{\text{/C}}}^+$$ implies $${\small{\text{/C}}}$$. $${\small{\text{C}}}^+/$$ implies $${\small{\text{C/}}}$$. $${\small{\text{CG}}}$$ implies $$/{\small{\text{C}}}^+$$. $${\small{\text{CG}}}$$ implies $${\small{\text{C}}}^+/$$. 4.3 Compactness The above-listed implications hold no matter what (within the assumptions that frame this article). For compact relations, there are more implications to take account of among the properties in play; this section records these. Fact 2 If ($$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$) $$\vdash$$ is compact and has $${\small{\text{FG}}}$$, then it has $${\small{\text{CG}}}$$. Proof. See [22, p. 37] for proof. (Their ‘cut for formulae’ is exactly $${\small{\text{FG}}}$$, and their ‘cut for sets’ is exactly $${\small{\text{CG}}}$$.) ■ Fact 3 If ($$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$) $$\vdash$$ is compact and has $${\small{\text{/F}}}$$, then it has $${\small{\text{/C}}}$$. Proof. Suppose $$\vdash$$ is compact and has $${\small{\text{/F}}}$$, that $${\Gamma \vdash A}$$ for all $$A \in \Sigma$$, and that $${\Sigma, \Gamma \vdash \Delta}$$. Since $$\vdash$$ is compact, this gives $${\Sigma_\text{fin}, {\Gamma_\text{fin}} \vdash {\Delta_\text{fin}}}$$ for some finite $$\Sigma_\text{fin} \subseteq \Sigma$$, $${\Gamma_\text{fin}} \subseteq \Gamma$$, and $${\Delta_\text{fin}} \subseteq \Delta$$. By monotonicity, $${\Sigma_\text{fin}, \Gamma \vdash \Delta}$$. Since $$\Sigma_\text{fin} \subseteq \Sigma$$, we have $${\Gamma \vdash A}$$ for all $$A \in \Sigma_\text{fin}$$. Now, where $$n$$ is the cardinality of $$\Sigma_\text{fin}$$, let $$\Sigma_\text{fin} = \{\sigma_0, \ldots, \sigma_{n-1}\}$$, and for $$m \leq n$$, let $$\Sigma_\text{fin}^m = \{\sigma_m, \ldots, \sigma_{n - 1}\}$$. Thus $$\Sigma_\text{fin}^0 = \Sigma_\text{fin}$$ and $$\Sigma_\text{fin}^n = \emptyset$$. I claim that for any $$i$$ from 0 to $$n$$ (inclusive), $${\Sigma_\text{fin}^i, \Gamma \vdash \Delta}$$; when $$i = n$$, this is $${{\Gamma} \vdash {\Delta}}$$, and the proposition follows. This can be shown by induction. The case where $$i = 0$$ is already shown. So suppose the claim is true for $$i < n$$; then $${\Sigma_i, \Gamma \vdash \Delta}$$, which is to say $${\sigma_i, \Sigma_{i+1}, \Gamma \vdash \Delta}$$. By assumption, $${\Gamma \vdash \sigma_i}$$; monotonicity gives $${\Sigma_{i+1}, \Gamma \vdash \sigma_i}$$. Now, applying $${\small{\text{/F}}}$$, $${\Sigma_{i+1}, \Gamma \vdash \Delta}$$. ■ Fact 4 If ($$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$) $$\vdash$$ is compact and has $${\small{\text{F}}}_{\small{\text{SF}}}$$, then it has $${\small{\text{C}}}_{\small{\text{SF}}}$$. Proof. Follow the proof of Fact 3, mutatis mutandis. ■ Fact 5 If ($$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$) $$\vdash$$ is compact and has $${\small{\text{F/}}}$$, then it has $${\small{\text{C/}}}$$. Proof. From Fact 3, by duality. ■ 4.4 A semilattice of properties Recall that the goal is to consider not just the properties in Tables 1 and 2, but arbitrary conjunctions of these. Implication among properties forms a semilattice order, with conjunction as the meet.11 That is, implication is transitive, and the conjunction of two properties is their greatest lower bound wrt the implication order. (In this article, I identify properties that imply each other.) So we can combine the above implications to generate new ones, in the following ways, with $$P, Q, R$$ any properties (including conjunctions): If $$P$$ implies $$Q$$ and $$Q$$ implies $$R$$, then $$P$$ implies $$R$$. The conjunction of $$P$$ with $$Q$$ implies $$P$$, and it also implies $$Q$$. If $$P$$ implies $$Q$$ and it also implies $$R$$, then $$P$$ implies the conjunction of $$Q$$ with $$R$$. 4.5 Taking stock By forming arbitrary conjunctions of the properties in Table 1, we have $$2^5 = 32$$ distinct ways to specify a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ property; and by working with Table 2, we have $$2^{12} = 4096$$ distinct ways to specify a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ property. However, by identifying properties when they imply each other, we can shrink this list considerably. The implications recorded above are already enough to get us down to 8 $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties and 34 $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties, or with the assumption of compactness 7 $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties and 18 $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties. For each framework, these properties include the empty conjunction of properties, which is trivially exhibited by any consequence relation. I will call this property of $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations $$\top_{\small{\text{SF}}}$$, and of $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ relations simply $$\top$$. All the new properties to consider are given in Tables 3 and 4. Table 3. Additional $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ linking properties formed by conjunction $$\top_{\small{\text{SF}}}$$ The empty conjunction. $${\small{\text{S}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ and $$\downarrow_{\small{\text{SF}}}$$. $${\small{\text{KS}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ and $$\downarrow_{\small{\text{SF}}}$$. $$\top_{\small{\text{SF}}}$$ The empty conjunction. $${\small{\text{S}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ and $$\downarrow_{\small{\text{SF}}}$$. $${\small{\text{KS}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ and $$\downarrow_{\small{\text{SF}}}$$. Table 4. Additional $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ linking properties formed by conjunction $$\top$$ The empty conjunction. $$/{\small{\text{S}}}/\downarrow$$ $${\small{\text{S}}}$$ and $$/\downarrow$$. $$\downarrow/{\small{\text{S}}}/\downarrow$$ $${\small{\text{S}}}$$ and $$\downarrow/\downarrow$$. $$/{\small{\text{KS}}}/\downarrow$$ $${\small{\text{KS}}}$$ and $$/\downarrow$$. $${\small{\text{F}}}/\downarrow$$ $${\small{\text{F}}}/$$ and $$/\downarrow$$. $${\small{\text{C}}}/\downarrow$$ $${\small{\text{C/}}}$$ and $$/\downarrow$$. $${\small{\text{F}}}/{\small{\text{F}}}$$ $${\small{\text{F}}}/$$ and $$/{\small{\text{F}}}$$. $${\small{\text{F}}}/{\small{\text{C}}}$$ $${\small{\text{F}}}/$$ and $$/{\small{\text{C}}}$$. $$/{\small{\text{FG}}}/{\small{\text{C}}}$$ $$/{\small{\text{C}}}$$ and $${\small{\text{FG}}}$$. $$/{\small{\text{C}}}/{\small{\text{FG}}}/{\small{\text{C}}}$$ $${\small{\text{C}}}/{\small{\text{C}}}$$ and $${\small{\text{FG}}}$$. $${\small{\text{C}}}/{\small{\text{C}}}^+$$ $${\small{\text{C/}}}$$ and $${/\small{\text{C}}}^+$$. $$\downarrow/\downarrow$$ $$/\downarrow$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{S}}}/$$ $${\small{\text{S}}}$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{KS}}}/\downarrow$$ $${\small{\text{KS}}}$$ and $$\downarrow/\downarrow$$. $$\downarrow/{\small{\text{KS}}}/$$ $${\small{\text{KS}}}$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{F}}}$$ $$\downarrow{/}$$ and $$/{\small{\text{F}}}$$. $$\downarrow/{\small{\text{C}}}$$ $$\downarrow{/}$$ and $$/{\small{\text{C}}}$$. $${\small{\text{C}}}/{\small{\text{C}}}$$ $${\small{\text{C/}}}$$ and $$/{\small{\text{C}}}$$. $${\small{\text{C}}}/{\small{\text{F}}}$$ $${\small{\text{C/}}}$$ and $$/{\small{\text{F}}}$$. $${\small{\text{C}}}/{\small{\text{FG}}}/$$ $${\small{\text{C/}}}$$ and $${\small{\text{FG}}}$$. $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ $${\small{\text{C}}}^+/$$ and $${/\small{\text{C}}}^+$$. $${\small{\text{C}}}^+/{\small{\text{C}}}$$ $${\small{\text{C}}}^+/$$ and $$/{\small{\text{C}}}$$. $$\top$$ The empty conjunction. $$/{\small{\text{S}}}/\downarrow$$ $${\small{\text{S}}}$$ and $$/\downarrow$$. $$\downarrow/{\small{\text{S}}}/\downarrow$$ $${\small{\text{S}}}$$ and $$\downarrow/\downarrow$$. $$/{\small{\text{KS}}}/\downarrow$$ $${\small{\text{KS}}}$$ and $$/\downarrow$$. $${\small{\text{F}}}/\downarrow$$ $${\small{\text{F}}}/$$ and $$/\downarrow$$. $${\small{\text{C}}}/\downarrow$$ $${\small{\text{C/}}}$$ and $$/\downarrow$$. $${\small{\text{F}}}/{\small{\text{F}}}$$ $${\small{\text{F}}}/$$ and $$/{\small{\text{F}}}$$. $${\small{\text{F}}}/{\small{\text{C}}}$$ $${\small{\text{F}}}/$$ and $$/{\small{\text{C}}}$$. $$/{\small{\text{FG}}}/{\small{\text{C}}}$$ $$/{\small{\text{C}}}$$ and $${\small{\text{FG}}}$$. $$/{\small{\text{C}}}/{\small{\text{FG}}}/{\small{\text{C}}}$$ $${\small{\text{C}}}/{\small{\text{C}}}$$ and $${\small{\text{FG}}}$$. $${\small{\text{C}}}/{\small{\text{C}}}^+$$ $${\small{\text{C/}}}$$ and $${/\small{\text{C}}}^+$$. $$\downarrow/\downarrow$$ $$/\downarrow$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{S}}}/$$ $${\small{\text{S}}}$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{KS}}}/\downarrow$$ $${\small{\text{KS}}}$$ and $$\downarrow/\downarrow$$. $$\downarrow/{\small{\text{KS}}}/$$ $${\small{\text{KS}}}$$ and $$\downarrow{/}$$. $$\downarrow/{\small{\text{F}}}$$ $$\downarrow{/}$$ and $$/{\small{\text{F}}}$$. $$\downarrow/{\small{\text{C}}}$$ $$\downarrow{/}$$ and $$/{\small{\text{C}}}$$. $${\small{\text{C}}}/{\small{\text{C}}}$$ $${\small{\text{C/}}}$$ and $$/{\small{\text{C}}}$$. $${\small{\text{C}}}/{\small{\text{F}}}$$ $${\small{\text{C/}}}$$ and $$/{\small{\text{F}}}$$. $${\small{\text{C}}}/{\small{\text{FG}}}/$$ $${\small{\text{C/}}}$$ and $${\small{\text{FG}}}$$. $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ $${\small{\text{C}}}^+/$$ and $${/\small{\text{C}}}^+$$. $${\small{\text{C}}}^+/{\small{\text{C}}}$$ $${\small{\text{C}}}^+/$$ and $$/{\small{\text{C}}}$$. The implications among these properties are recorded in Figures 1 and 2. In these figures, each arrow is an implication already recorded; the double-thickness arrows are implications that we have seen become equivalences in the presence of compactness. (For now, you can ignore the numbers and letters that label the arrows; they’ll be meaningful later.) Figure 1. View largeDownload slide Implications for $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties. Figure 1. View largeDownload slide Implications for $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties. Figure 2. View largeDownload slide Implications for $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties. Figure 2. View largeDownload slide Implications for $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties. 5 Non-implications So far, only implications have been recorded. So while we know there are at most 8 distinct $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ properties and 34 distinct $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ properties in play here, and at most 7 or 18 respectively if compactness is assumed, it’s still possible, for all I’ve said so far, that there are fewer. In fact, however, there are not; the implications so far recorded exhaust the implications among these properties. This section shows that the remaining potential implications do not hold. In each case, I will show this by counterexample. 5.1 Presenting consequence relations I will present the consequence relations that serve as counterexamples using a very simple kind of proof system. I work with sequents; a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ sequent is a pair $${\langle{\Gamma, C}\rangle}$$, and a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ sequent is a pair $${\langle{\Gamma, \Delta}\rangle}$$. I will write such pairs with the sequent separator $$\triangleright$$, so $${{\Gamma} \triangleright {C}}$$ or $${{\Gamma} \triangleright {\Delta}}$$. A sequent-based proof system involves two components: some set of initial sequents, which are simply given as valid, and some rules that allow new validities to be generated from old. The proof systems I will draw on here are all quite simple. For each of them, I will specify a set $$\mathfrak{P}$$ of sequents; the initial sequents of the system are then all those sequents in $$\mathfrak{P}$$, together with all sequents of the form $${{A} \triangleright {A}}$$, for any $$A \in \mathcal{F}$$. There is only a single rule in any of these systems: the rule of infinitary weakening. In $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ systems, this allows us to derive $${{\Gamma, \Gamma'} \triangleright {C}}$$ from $${{\Gamma} \triangleright {C}}$$, for any $$\Gamma, \Gamma', C$$; and in $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ systems, this allows us to derive $${{\Gamma, \Gamma'} \triangleright {\Delta, \Delta'}}$$ from $${{\Gamma} \triangleright {\Delta}}$$, for any $$\Gamma, \Gamma', \Delta, \Delta'$$. So for any set $$\mathfrak{P}$$ of $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ sequents, we have a $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relation $$\vdash_\mathfrak{P}$$ determined as follows: $$\Gamma \vdash_\mathfrak{P} C$$ iff either 1) $$C \in \Gamma$$, or 2) there is some $${{\Gamma'} \triangleright {C}} \in \mathfrak{P}$$ such that $$\Gamma' \subseteq \Gamma$$. And for any set $$\mathfrak{P}$$ of $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ sequents, we have a $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation $$\vdash_\mathfrak{P}$$ determined as follows: $$\Gamma \vdash_\mathfrak{P} \Delta$$ iff either 1) $$\Gamma \cap \Delta \neq \emptyset$$, or 2) there is some $${{\Gamma'} \triangleright {\Delta'}} \in \mathfrak{P}$$ such that $$\Gamma' \subseteq \Gamma$$ and $$\Delta' \subseteq \Delta$$. This approach works at the right level of generality for present purposes: a consequence relation (in either framework) is $$\vdash_\mathfrak{P}$$ for some $$\mathfrak{P}$$ iff it is monotonic and reflexive. (For the relevant senses of reflexivity, recall the discussion in Section 2.1.) It also gives a tractable way to explore compactness: note that $$\vdash_\mathfrak{P}$$ is compact iff every infinite sequent in $$\mathfrak{P}$$ has a finite subsequent in $$\mathfrak{P}$$. (Again, this works in either framework). 5.2 A menagerie Let $$p, q, r, s$$ be four distinct formulas, and let $$\Theta \subseteq \mathcal{F}$$ be infinite. Then Table 5 presents five $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations, $$1$$–$$5$$, and Table 6 presents eight $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations, $$a$$–$$h$$.12 For each relation, these tables note two properties: one that the consequence relation has and one that it lacks. These two properties are chosen so that the implications already recorded suffice to settle the situation as regards all the other properties under consideration in the appropriate framework: each other property is either implied by the property the relation has, or else implies the property the relation lacks. (I find this easiest to see by referring to Figure 1 or 2, as appropriate.) Table 5. Five $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ consequence relations $$\quad{\mathfrak{P}}$$ Has: Lacks: 1 $$\{{{p} \triangleright {q}};\;\; {q \triangleright r}\}$$ $$\downarrow_{\small{\text{SF}}}$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ 2 $$\{{\phantom{p} \triangleright p};\;\; {p, q \triangleright r}\}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$\downarrow_{\small{\text{SF}}}$$ 3 $$\{{p, q \triangleright r};\;\; {r \triangleright s}\}$$ $${\small{\text{S}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ 4 $$\{{{p} \triangleright {q}};\;\; {q, r \triangleright s}\}$$ $${\small{\text{KS}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{F}}}_{\small{\text{SF}}}$$ 5 $$\{{\Gamma \triangleright A} : \Gamma \text{ is infinite or } A \text{ is not } p\}$$ $${\small{\text{F}}}_{\small{\text{SF}}}$$ $${\small{\text{C}}}_{\small{\text{SF}}}$$ $$\quad{\mathfrak{P}}$$ Has: Lacks: 1 $$\{{{p} \triangleright {q}};\;\; {q \triangleright r}\}$$ $$\downarrow_{\small{\text{SF}}}$$ $${\small{\text{S}}}_{\small{\text{SF}}}$$ 2 $$\{{\phantom{p} \triangleright p};\;\; {p, q \triangleright r}\}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$\downarrow_{\small{\text{SF}}}$$ 3 $$\{{p, q \triangleright r};\;\; {r \triangleright s}\}$$ $${\small{\text{S}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{KS}}}_{\small{\text{SF}}}$$ 4 $$\{{{p} \triangleright {q}};\;\; {q, r \triangleright s}\}$$ $${\small{\text{KS}}}\downarrow_{\small{\text{SF}}}$$ $${\small{\text{F}}}_{\small{\text{SF}}}$$ 5 $$\{{\Gamma \triangleright A} : \Gamma \text{ is infinite or } A \text{ is not } p\}$$ $${\small{\text{F}}}_{\small{\text{SF}}}$$ $${\small{\text{C}}}_{\small{\text{SF}}}$$ Table 6. Eight $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations $$\quad{\mathfrak{P}}$$ Has: Lacks: $$a$$$$\{{{p} \triangleright {q}};\;\; {q \triangleright r}\}$$ $$\downarrow/\downarrow$$ $${\small{\text{S}}}$$ $$b$$$$\{{\Gamma \triangleright \Delta} : \max(|\Gamma|, |\Delta|) > 2 \text{ and } p \in \Gamma \cup \Delta\}$$ $$\downarrow/{\small{\text{S}}}/\downarrow$$ $${\small{\text{KS}}}$$ $$c$$$$\{{p \triangleright q, r};\;\; {r \triangleright \phantom{q}}\}$$ $$/{\small{\text{C}}}$$ $$\downarrow{/}$$ $$d$$$$\{{s \triangleright p, q, r};\;\; {p \triangleright q, r}\}$$ $$\downarrow/{\small{\text{C}}}$$ $${\small{\text{F}}}/$$ $$e$$$$\{{q \triangleright r, p};\;\; {p, q \triangleright r}\}$$ $${\small{\text{C}}}/{\small{\text{C}}}$$ $${\small{\text{FG}}}$$ $$f$$$$\{{\Gamma \triangleright \Delta} : \Delta \text{ is infinite or } \Gamma \cap \Theta \neq \emptyset\}$$ $${/\small{\text{C}}}^+$$ $${\small{\text{C}}}/$$ $$g$$$$\{{\Gamma \triangleright \Delta} : \Delta \text{ is infinite or } |\Gamma| \geq 2\}$$ $${\small{\text{C}}}/{\small{\text{C}}}^+$$ $${\small{\text{C}}}^+/$$ $$h$$$$\{{\Gamma \triangleright \Delta} : \Gamma \cup \Delta \text{ is infinite}\}$$ $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ $${\small{\text{CG}}}$$ $$\quad{\mathfrak{P}}$$ Has: Lacks: $$a$$$$\{{{p} \triangleright {q}};\;\; {q \triangleright r}\}$$ $$\downarrow/\downarrow$$ $${\small{\text{S}}}$$ $$b$$$$\{{\Gamma \triangleright \Delta} : \max(|\Gamma|, |\Delta|) > 2 \text{ and } p \in \Gamma \cup \Delta\}$$ $$\downarrow/{\small{\text{S}}}/\downarrow$$ $${\small{\text{KS}}}$$ $$c$$$$\{{p \triangleright q, r};\;\; {r \triangleright \phantom{q}}\}$$ $$/{\small{\text{C}}}$$ $$\downarrow{/}$$ $$d$$$$\{{s \triangleright p, q, r};\;\; {p \triangleright q, r}\}$$ $$\downarrow/{\small{\text{C}}}$$ $${\small{\text{F}}}/$$ $$e$$$$\{{q \triangleright r, p};\;\; {p, q \triangleright r}\}$$ $${\small{\text{C}}}/{\small{\text{C}}}$$ $${\small{\text{FG}}}$$ $$f$$$$\{{\Gamma \triangleright \Delta} : \Delta \text{ is infinite or } \Gamma \cap \Theta \neq \emptyset\}$$ $${/\small{\text{C}}}^+$$ $${\small{\text{C}}}/$$ $$g$$$$\{{\Gamma \triangleright \Delta} : \Delta \text{ is infinite or } |\Gamma| \geq 2\}$$ $${\small{\text{C}}}/{\small{\text{C}}}^+$$ $${\small{\text{C}}}^+/$$ $$h$$$$\{{\Gamma \triangleright \Delta} : \Gamma \cup \Delta \text{ is infinite}\}$$ $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ $${\small{\text{CG}}}$$ For each of these consequence relations, Table 7 gives a counterexample to the property that it is listed in Table 5 or 6 as lacking; these are easy to check. It is more work to show that each of these relations has the property it is listed as having; proofs of these claims are relegated to the Appendix. Table 7. Counterexamples to properties lacked 1 lacks $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$\quad p \vdash q$$ $$\quad q \vdash r$$ $$\quad p \not \vdash r$$ 2 lacks $$\downarrow_{\small{\text{SF}}}$$ $$\qquad\vdash p$$ $$p, q \vdash r$$ $$\quad q \not\vdash r$$ 3 lacks $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$p, q \vdash r$$ $$\quad r \vdash s$$ $$p, q \not\vdash s$$ 4 lacks $${\small{\text{F}}}_{\small{\text{SF}}}$$ $$\quad p \vdash q$$ $$q, r \vdash s$$ $$p, r \not\vdash s$$ 5 lacks $${\small{\text{C}}}_{\small{\text{SF}}}$$ $$\qquad \vdash A\text{ for all } A \in \mathcal{F}\setminus\{p\}$$ $$\mathcal{F}\setminus\{p\}\vdash p$$ $$\qquad \not\vdash p$$ $$a$$ lacks $${\small{\text{S}}}$$ $$\quad p \vdash q$$ $$\quad q \vdash r$$ $$\quad p \not\vdash r$$ $$b$$ lacks $${\small{\text{KS}}}$$ $$q, r \vdash p$$ $$\quad p \vdash s, t$$ $$q, r \not\vdash s, t$$ $$c$$ lacks $$\downarrow{/}$$ $$\quad p \vdash q, r$$ $$\quad r \vdash$$ $$\quad p \not\vdash q$$ $$d$$ lacks $${\small{\text{F}}}/$$ $$\quad s \vdash p, q, r$$ $$\quad p \vdash q, r$$ $$\quad s \not\vdash q, r$$ $$e$$ lacks $${\small{\text{FG}}}$$ $$\quad q \vdash r, p$$ $$p, q \vdash r\quad $$ $$\quad q \not\vdash r$$ $$f$$ lacks $${\small{\text{C}}}/$$ $$\quad \quad \vdash \Theta$$ $$\quad A \vdash \quad$$ for all $$A \in \Theta$$ $$\quad \quad \not\vdash$$ $$g$$ lacks $${\small{\text{C}}}^+/$$ $$\quad p \vdash \mathcal{F} \setminus \{p\}$$ $$p, A \vdash \quad$$ for all $$A \in \mathcal{F} \setminus \{p\}$$ $$\quad p \not\vdash$$ $$h$$ lacks $${\small{\text{CG}}}$$ $$\mathcal{F}^+$$$$\mathcal{F}^-$$ for every partition $${\langle{\mathcal{F}^+, \mathcal{F}^-}\rangle}$$ of $$\mathcal{F}$$ $$\quad \quad \not\vdash$$ 1 lacks $${\small{\text{S}}}_{\small{\text{SF}}}$$ $$\quad p \vdash q$$ $$\quad q \vdash r$$ $$\quad p \not \vdash r$$ 2 lacks $$\downarrow_{\small{\text{SF}}}$$ $$\qquad\vdash p$$ $$p, q \vdash r$$ $$\quad q \not\vdash r$$ 3 lacks $${\small{\text{KS}}}_{\small{\text{SF}}}$$ $$p, q \vdash r$$ $$\quad r \vdash s$$ $$p, q \not\vdash s$$ 4 lacks $${\small{\text{F}}}_{\small{\text{SF}}}$$ $$\quad p \vdash q$$ $$q, r \vdash s$$ $$p, r \not\vdash s$$ 5 lacks $${\small{\text{C}}}_{\small{\text{SF}}}$$ $$\qquad \vdash A\text{ for all } A \in \mathcal{F}\setminus\{p\}$$ $$\mathcal{F}\setminus\{p\}\vdash p$$ $$\qquad \not\vdash p$$ $$a$$ lacks $${\small{\text{S}}}$$ $$\quad p \vdash q$$ $$\quad q \vdash r$$ $$\quad p \not\vdash r$$ $$b$$ lacks $${\small{\text{KS}}}$$ $$q, r \vdash p$$ $$\quad p \vdash s, t$$ $$q, r \not\vdash s, t$$ $$c$$ lacks $$\downarrow{/}$$ $$\quad p \vdash q, r$$ $$\quad r \vdash$$ $$\quad p \not\vdash q$$ $$d$$ lacks $${\small{\text{F}}}/$$ $$\quad s \vdash p, q, r$$ $$\quad p \vdash q, r$$ $$\quad s \not\vdash q, r$$ $$e$$ lacks $${\small{\text{FG}}}$$ $$\quad q \vdash r, p$$ $$p, q \vdash r\quad $$ $$\quad q \not\vdash r$$ $$f$$ lacks $${\small{\text{C}}}/$$ $$\quad \quad \vdash \Theta$$ $$\quad A \vdash \quad$$ for all $$A \in \Theta$$ $$\quad \quad \not\vdash$$ $$g$$ lacks $${\small{\text{C}}}^+/$$ $$\quad p \vdash \mathcal{F} \setminus \{p\}$$ $$p, A \vdash \quad$$ for all $$A \in \mathcal{F} \setminus \{p\}$$ $$\quad p \not\vdash$$ $$h$$ lacks $${\small{\text{CG}}}$$ $$\mathcal{F}^+$$$$\mathcal{F}^-$$ for every partition $${\langle{\mathcal{F}^+, \mathcal{F}^-}\rangle}$$ of $$\mathcal{F}$$ $$\quad \quad \not\vdash$$ 5.3 Full characterization Let us take stock. Each of Figures 1 and 2 records implications between properties remarked in Section 4. Where those implications were shown to become equivalences in the presence of compactness, that too is recorded. Now, each of those implications has been shown to be one-way, by direct counterexample. None of them collapses to an equivalence without compactness. Moreover, where equivalence in the presence of compactness was not already shown, the counterexample given is in fact compact. That is, relations 1–4 and $$a$$–$$e$$ are all compact, and every single-thickness line in Figures 1 and 2 is labelled with one of these.13 So, with the assumption of compactness added, no implication collapses to an equivalence except for those already noted in Section 4. Now, suppose there were some implication between some of the properties in one of these figures that was not already recorded in the figure; say property $$P$$ implies property $$Q$$. Because of how the figures were constructed, the conjunction of $$P$$ with $$Q$$ appears in the figure, and the implication from this conjunction to $$Q$$ is recorded. But if $$P$$ implies $$Q$$, then this implication is really an equivalence. That is, because these properties are closed under conjunction, and because all implications from conjunctions to their conjuncts are indicated, showing that no indicated implication collapses to equivalence suffices to show that there are no implications beyond those indicated. Figures 1 and 2 thus suffice to completely characterize the implications and non-implications among arbitrary conjunctions of properties drawn from Tables 1 and 2, both with and without the assumption of compactness. 6 Conclusion ‘Transitivity’, as applied to consequence relations, can conceal more than it reveals. When someone says a consequence relation is ‘transitive’, then, it is worth finding out just what is meant. It is almost never the case that they mean that it is transitive, in the usual relation-theoretic sense. But then what do they mean? This article has explored some possible answers, for both $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ and $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations. It’s a safe bet that nobody means $$\top_{\small{\text{SF}}}$$ or $$\top$$ by ‘transitivity’, but the remaining properties in question are all possible ways to fill in the idea. When we call consequence relations ‘transitive’, then, it behooves us to make clear exactly what we are saying; there is no single thing we must obviously mean. Acknowledgements For helpful discussion and comments, thanks to the Melbourne Logic Group (especially Rohan French and Lloyd Humberstone), audiences at the University of Groningen (GroLog) and the Australasian Association for Logic 2015 meeting, three anonymous referees for LORI, and two additional anonymous referees for this journal. Thanks as well to Damir Dzhafarov, whose Reverse Mathematics Zoo (rmzoo.uconn.edu) made it considerably easier to organize what had to be proved. (I wish I had known about it sooner!) This research was partially supported by the grant ‘Non-Transitive Logics’, number FFI2013-46451-P, from the Ministerio de Economía y Competitividad, Government of Spain. Appendix A Proofs of claims in Section 5.2 Here, I prove that each of the consequence relations 1–5 and $$a$$–$$h$$ has the property it is claimed to have in Table 5 or 6. These proofs are largely tedious rather than exciting; this section is accordingly probably best treated as reference material rather than browsed.14 1 has $$\downarrow_{\small{\text{SF}}}$$ Proof. No argument with an empty set of premises is valid, so there is no opportunity for a counterexample. ■ 2 has $${\small{\text{KS}}}_{\small{\text{SF}}}$$ Proof. Suppose $$\Gamma\, {\vdash_{{2}}} A$$ and $$A \,{\vdash_{{2}}} C$$. Since $$A \,{\vdash_{{2}}} C$$, it must be that either $$A$$ and $$C$$ are the same sentence or $$C$$ is $$p$$. In the first case, $$\Gamma \,{\vdash_{{2}}} C$$ by assumption; in the second, by monotonicity from $$\,{\vdash_{{2}}} p$$. ■ 3 has $${\small{\text{S}}}\downarrow_{\small{\text{SF}}}$$ Proof. $$\downarrow_{\small{\text{SF}}}$$ is immediate, since no argument with an empty set of premises is valid. For $${\small{\text{S}}}_{\small{\text{SF}}}$$, suppose $$B \,{\vdash_{{3}}} A$$ and $$A \,{\vdash_{{3}}} C$$. There are three ways this can happen: $$B$$ is $$r$$ and $$A$$ is $$s$$. In this case, $$C$$ must be $$s$$, so $$B \,{\vdash_{{3}}} C$$. $$A$$ is $$r$$ and $$C$$ is $$s$$. In this case, $$B$$ must be $$r$$, so $$B \,{\vdash_{{3}}} C$$. Otherwise, $$B$$ must be $$A$$ and $$A$$ must be $$C$$. So $$B \,{\vdash_{{3}}} C$$. ■ 4 has $${\small{\text{KS}}}\downarrow_{\small{\text{SF}}}$$ Proof. Again, $$\downarrow_{\small{\text{SF}}}$$ is immediate, since no argument with an empty set of premises is valid. For $${\small{\text{KS}}}_{\small{\text{SF}}}$$, suppose $$\Gamma \,{\vdash_{{4}}} A$$ and $$A \,{\vdash_{{4}}} C$$. If $$A$$ is $$C$$, then $$\Gamma \,{\vdash_{{4}}} C$$ and we’re done. So suppose $$A$$ is not $$C$$; then it must be that $$A$$ is $$p$$ and $$C$$ is $$q$$. But then $$\Gamma \,{\vdash_{{4}}} p$$, and so $$p \in \Gamma$$. Since $$p \,{\vdash_{{4}}} q$$, this gives $$\Gamma \,{\vdash_{{4}}} C$$ by monotonicity. ■ 5 has $${\small{\text{F}}}_{\small{\text{SF}}}$$ Proof. ([22, p. 18] states but does not prove this result.) Suppose $$\Gamma \,{\vdash_{{5}}} A$$ and $$A, \Gamma \,{\vdash_{{5}}} C$$. If $$\Gamma$$ is infinite, $$\Gamma \,{\vdash_{{5}}} C$$ and we’re done; so suppose $$\Gamma$$ is finite. If $$C$$ is not $$p$$, then $$\Gamma \,{\vdash_{{5}}} C$$ and we’re done; so suppose $$C$$ is $$p$$. Finally, if $$p \in \Gamma$$, then $$\Gamma \,{\vdash_{{5}}} C$$ (since $$C$$ is $$p$$) and we’re done; so suppose $$p \not \in \Gamma$$. These suppositions leave us with $$A, \Gamma \,{\vdash_{{5}}} p$$ with $$\Gamma$$ finite and $$p \not \in \Gamma$$; so it must be that $$A$$ is $$p$$. But then $$\Gamma \,{\vdash_{{5}}} p$$ by assumption, and since $$C$$ is $$p$$, this gives $$\Gamma \,{\vdash_{{5}}} C$$. ■ $$a$$ has $$\downarrow/\downarrow$$ Proof. No argument with an empty set of premises or an empty set of conclusions is valid, so there is no opportunity for a counterexample to either $${/}\downarrow$$ or $$\downarrow{/}$$. ■ $$b$$ has $$\downarrow/{\small{\text{S}}}/\downarrow$$ Proof. For $$\downarrow/\downarrow$$: no argument with an empty set of premises and a singleton set of conclusions is valid; nor is any argument with a singleton set of premises and an empty set of conclusions. For $${\small{\text{S}}}$$: suppose $$B \,{\vdash_{{b}}} A$$ and $$A \,{\vdash_{{b}}} C$$. Then it must be that $$B$$ is $$A$$ and that $$A$$ is $$C$$. So $$B \,{\vdash_{{b}}} C$$. ■ $$c$$ has $${\small{\text{/C}}}$$ Proof. Suppose that $$\Gamma \,{\vdash_{{c}}} A$$ for all $$A \in \Sigma$$ and that $$\Sigma, \Gamma \,{\vdash_{{c}}} C$$. If $$r \in \Gamma$$, then $$\Gamma \,{\vdash_{{c}}} C$$ and we’re done, so suppose $$r \not\in \Gamma$$. Then it must be that $$A \in \Gamma$$ for all $$A \in \Sigma$$; that is, that $$\Sigma \subseteq \Gamma$$. But then $$\Sigma \cup \Gamma = \Gamma$$, and so since $$\Sigma, \Gamma \,{\vdash_{{c}}} C$$ we have $$\Gamma \,{\vdash_{{c}}} C$$. ■ $$d$$ has $$\downarrow/{\small{\text{C}}}$$ Proof. $$\downarrow{/}$$ is immediate, since no argument with an empty set of conclusions is valid. For $${\small{\text{/C}}}$$, suppose that $$\Gamma \,{\vdash_{{d}}} A$$ for all $$A \in \Sigma$$ and that $$\Sigma, \Gamma \,{\vdash_{{d}}} C$$. Then it must be that $$A \in \Gamma$$ for all $$A \in \Sigma$$; that is, that $$\Sigma \subseteq \Gamma$$. But then $$\Sigma \cup \Gamma = \Gamma$$, and so since $$\Sigma, \Gamma \,{\vdash_{{d}}} C$$ we have $$\Gamma \,{\vdash_{{d}}} C$$. ■ $$e$$ has $${\small{\text{C}}}/{\small{\text{C}}}$$ Proof. $${\small{\text{/C}}}$$ first. Suppose there are $$\Gamma, \Delta, \Sigma$$ such that $$\Gamma \,{\vdash_{{e}}} A$$ for every $$A \in \Sigma$$ and $$\Sigma, \Gamma \,{\vdash_{{e}}} \Delta$$. If $$\Sigma \subseteq \Gamma$$ then $$\Gamma \,{\vdash_{{e}}} \Delta$$ and we’re done; so take any $$B \in \Sigma$$ such that $$B \not\in \Gamma$$. Since $$\Gamma \,{\vdash_{{e}}} B$$ and $$B \not \in \Gamma$$, it must be that $$p, q \in \Gamma$$ and $$B$$ is $$r$$. That is, $$\Sigma \cup \Gamma = \{r\} \cup \Gamma$$. Thus, since $$\Sigma, \Gamma \,{\vdash_{{e}}} \Delta$$, it must be that either $$\Gamma \cap \Delta$$ is non-empty or $$r \in \Delta$$; but either way $$\Gamma \,{\vdash_{{e}}} \Delta$$. For $${\small{\text{C/}}}$$, the argument is dual, reversing the roles of $$q$$ and $$r$$. ■ $$f$$ has $$/{\small{\text{C}}}^+$$ Proof. Suppose $$\Gamma \,{\vdash_{{f}}} \Delta, A$$ for each $$A \in \Sigma$$, and that $$\Sigma, \Gamma \,{\vdash_{{f}}} \Delta$$. For each $$A \in \Sigma$$ we can have $$\Gamma \,{\vdash_{{f}}} \Delta, A$$ in only four ways: (1) $$A \in \Gamma$$, (2) $$\Gamma \cap \Delta \neq \emptyset$$, (3) $$\Gamma \cap \Theta \neq \emptyset$$, or (4) $$\Delta$$ is infinite. In cases 2–4, $$\Gamma \,{\vdash_{{f}}} \Delta$$ directly. All that remains is the case where $$A \in \Gamma$$ for every $$A \in \Sigma$$; that is, where $$\Sigma \subseteq \Gamma$$. But we have $$\Sigma, \Gamma \,{\vdash_{{f}}} \Delta$$, and so in this case too $$\Gamma \,{\vdash_{{f}}} \Delta$$. ■ $$g$$ has $${\small{\text{C}}}/{\small{\text{C}}}^+$$ Proof. First, $${\small{\text{C/}}}$$: if $$A \,{\vdash_{{g}}} \Delta$$ for each $$A \in \Sigma$$, then either $$\Delta$$ is infinite, in which case $$\Gamma \,{\vdash_{{g}}} \Delta$$ directly, or else $$\Sigma \subseteq \Delta$$; the only valid arguments with finitely many conclusions and a single premise are those where the premise is among the conclusions. But if $$\Sigma \subseteq \Delta$$, then if $$\Gamma \,{\vdash_{{g}}} \Delta, \Sigma$$, this is already $$\Gamma \,{\vdash_{{g}}} \Delta$$. Second, $$/{\small{\text{C}}}^+$$: suppose that $$\Gamma \,{\vdash_{{g}}} \Delta, A$$ for all $$A \in \Sigma$$ and $$\Sigma, \Gamma \,{\vdash_{{g}}} \Delta$$. If $$\Delta$$ is infinite, then $$\Gamma \,{\vdash_{{g}}} \Delta$$ and we’re done; so suppose $$\Delta$$ is finite. It must be, then, that $$\Sigma \cup \Gamma$$ has at least two members. If $$\Gamma$$ itself has at least two members, then $$\Gamma \,{\vdash_{{g}}} \Delta$$ and we’re done, so suppose it does not. There must be at least one formula, then, in $$\Sigma$$ but not in $$\Gamma$$; call it $$B$$. By assumption, $$\Gamma \,{\vdash_{{g}}} \Delta, B$$. But since $$\Gamma$$ does not have at least two members and $$\Delta$$ is not infinite, this means that $$\Gamma \cap (\Delta \cup \{B\})$$ is non-empty; and since $$B \not \in \Gamma$$, it must be that $$\Gamma \cap \Delta$$ is non-empty. So $$\Gamma \,{\vdash_{{g}}} \Delta$$. ■ $$h$$ has $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ Proof. ([22, p. 33] states but does not prove this result.) For $$/{\small{\text{C}}}^+$$: suppose $$\Gamma\,{\vdash_{h}} \Delta, A$$ for all $$A \in \Sigma$$, and that $$\Sigma, \Gamma \,{\vdash_{h}} \Delta$$, to show $$\Gamma \,{\vdash_{h}} \Delta$$. For each $$A \in \Sigma$$, we can have $$\Gamma \vdash \Delta, A$$ in only three ways: (1) $$A \in \Gamma$$, (2) $$\Gamma \cap \Delta \neq \emptyset$$, or (3) $$\Gamma \cup \Delta \cup \{A\}$$ is infinite. In case 3, $$\Gamma \cup \Delta$$ is also infinite, and so $$\Gamma \vdash_h \Delta$$. In case 2, $$\Gamma \vdash_h \Delta$$ as well. So we need only consider the case where $$A \in \Gamma$$ for each $$A \in \Sigma$$; that is, where $$\Sigma \subseteq \Gamma$$. But we have $$\Sigma, \Gamma \vdash_h \Delta$$; and so in this case too $$\Gamma \vdash_h \Delta$$. $$\vdash_h$$ is self-dual and has $$/{\small{\text{C}}}^+$$, so it has $${\small{\text{C}}}^+/$$ as well; thus, it has $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$. ■ Footnotes 1There is another way to approach $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relations; the members of the set of conclusions can be seen as (in some sense) all following. (See for example [3].) On this interpretation, arguments with more conclusions are stronger, since they show that more follows from the premises. This is one area of logic where ‘transitivity’ as applied to consequence relations typically means transitivity. The situation for these relations, then, is clear; they are transitive, when they are, in the ordinary sense. As such, they are not my focus here, and I will not consider this kind of $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ consequence relation further. 2This is not to say, of course, that combining premises depends on some prior notion of conjunction, or that combining conclusions depends on some prior notion of disjunction. 3Unlike ‘transitive’ (and, it will emerge presently, ‘reflexive’), ‘monotonic’ here does have its usual relation-theoretic sense, wrt the order $$\subseteq$$ on sets of formulas. (And, for $$\text{S}{\small{\text{ET}}}-\text{F}{\small{\text{MLA}}}$$ relations, the discrete order on formulas; that is, the order that relates each formula only to itself.) 4I take the terms ‘simple’ and ‘generalized’ from [26]. Weir’s ‘simple transitivity’ is my $${\small{\text{S}}}$$; his ‘generalized transitivity’ is my $${\small{\text{FG}}}$$. (He does not consider $${\small{\text{CG}}}$$.) 5A property in the area is raised, however, as a form of modus ponens (of all things!) in [20], which operates in the $$\text{S}{\small{\text{ET}}}-\text{S}{\small{\text{ET}}}$$ framework: if $$\vdash A$$ and $$A \vdash B$$, then $$\vdash B$$. (Thanks to an anonymous referee for bringing this to my attention.) This is a special case of both $${/}\downarrow$$ and $${\small{\text{KS}}}$$, and is properly weaker than each; the consequence relation later to be called $$c'$$ exhibits this property but not $${/}\downarrow$$, while the consequence relations later to be called $$a$$ and $$b$$ exhibit this property but not $${\small{\text{KS}}}$$. For these relations, see §5. (It is also a special case of both $${\small{\text{/F}}}$$ and $${\small{\text{/C}}}$$, but we will see in Section 4 that each of these implies both $${/}\downarrow$$ and $${\small{\text{KS}}}$$, so the property must be properly weaker than these as well.) I would not discuss this property or its relatives further here; properties that the theorems of a consequence relation are closed under are interesting, but must wait for another day. 6However, related techniques from [8, 15] can avoid imposing $${\small{\text{C}}}_{\small{\text{SF}}}$$ and $${\small{\text{CG}}}$$, as well as every other linking property in these tables. 7In particular, the quasi-inequation $$x \wedge y \leq z \;\&\; x \leq y \vee z \Rightarrow x \leq z$$, which is closely related to $${\small{\text{FG}}}$$, holds in a lattice iff the lattice is distributive. This fact is reported by [19, p. 417], who calls it ‘well-known’. I have not been able to find a proof in the literature (but see [9, p. 10], Exercise 0.13.7(i), which asks for such a proof), but it is straightforward. 8In fact, Dummett (but not Cutland & Gibbins) only considers finite sequents. Note as well that the discussion in [6] in support of $${\small{\text{F}}}/{\small{\text{F}}}$$, if cogent, in fact supports the full strength of $${\small{\text{C}}}/{\small{\text{C}}}$$, even for non-compact relations. 9[22, p. 30ff.] considers $${\small{\text{FG}}}$$, $${\small{\text{C}}}^+/$$, $$/{\small{\text{C}}}^+$$, Cut$$_3$$, and $${\small{\text{CG}}}$$; the implications and nonimplications among these properties shown there sit among what is shown in the present article. 10As an anonymous referee points out, $${\small{\text{CG}}}$$ is not mentioned in [21]; nor is [22] cited there. 11For semilattices (and lattices), see [5]. 12[22] gives the relations here called 5 (p. 18) and $$h$$ (p. 31), for the same purposes: to show that $${\small{\text{F}}}_{\small{\text{SF}}}$$ and $${\small{\text{C}}}_{\small{\text{SF}}}$$, and $${\small{\text{C}}}^+/{\small{\text{C}}}^+$$ and $${\small{\text{CG}}}$$, are distinct. See their Theorems 1.3 (p. 18) and 2.7 (p. 32). They also give a relation (p. 32) similar to the converse of the one here called $$g$$, to show that $${\small{\text{/C}}}^+$$ and $${\small{\text{C}}}^+/$$ are distinct; but they do not consider $${\small{\text{/C}}}$$ or $${\small{\text{C/}}}$$, and their relation does not have $${\small{\text{C}}}^+/{\small{\text{C}}}$$, as the converse of $$g$$ does. 13For all of these but $$b$$, compactness is immediate: $$\mathfrak{P}$$ only includes finite sequents. For $$b$$, it is quick to see that every infinite sequent in $$\mathfrak{P}$$ has a finite subsequent in $$\mathfrak{P}$$. 14But who am I to tell you what to do with the article? References [1] Belnap. N. D. Display logic. Journal of Philosophical Logic , 11, 375– 417, 1982. [2] Bimbó. K. Proof Theory: Sequent Calculi and Related Formalisms . CRC Press, 2015. [3] Blok W. J. and Pigozzi. D. Algebraizable Logics . American Mathematical Society, 1989. [4] Cutland N. J. and Gibbins. P. F. A regular sequent calculus for quantum logic in which $$\wedge$$ and $$\vee$$ are dual. Logique et Analyse , 25, 221– 248, 1982. [5] Davey B. A. and Priestley. H. A. Introduction to Lattices and Order . Cambridge University Press, 2002. Google Scholar CrossRef Search ADS [6] Dummett. M. The Logical Basis of Metaphysics . Duckworth, 1991. [7] Gentzen. G. Investigations into logical deduction. In The Collected Papers of Gerhard Gentzen , Szabo M. E. ed., pp. 68– 131. North-Holland Publishing Company, 1969. [8] Humberstone. L. Heterogeneous logic. Erkenntnis , 29, 395– 435, 1988. Google Scholar CrossRef Search ADS [9] Humberstone. L. The Connectives . MIT Press, Cambridge, 2012. [10] Restall. G. An Introduction to Substructural Logics . Routledge, 2000. Google Scholar CrossRef Search ADS [11] Restall. G. Multiple conclusions. In Logic, Methodology, and Philosophy of Science: Proceedings of the Twelfth International Congress , Hájek P. Valdés-Villanueva L. and Westerståhl D. eds, pp. 189– 205. Kings’ College Publications, 2005. [12] Restall. G. Truth values and proof theory. Studia Logica , 92, 241– 264, 2009. Google Scholar CrossRef Search ADS [13] Ripley. D. Paradoxes and failures of cut. Australasian Journal of Philosophy , 91, 139– 164, 2013. Google Scholar CrossRef Search ADS [14] Ripley. D. Anything goes. Topoi , 34, 25– 36, 2015. Google Scholar CrossRef Search ADS [15] Ripley. D. Blurring: an approach to conflation. Notre Dame Journal of Formal Logic , 2017. Forthcoming. [16] Routley R. Meyer R. K. Plumwood V. and Brady. R. T. Relevant Logics and their Rivals 1 . Ridgeview, Atascadero, 1982. [17] Rumfitt. I. Knowledge by deduction. Grazer Philosophische Studien , 77, 61– 84, 2008. Google Scholar CrossRef Search ADS [18] Rumfitt. I. The Boundary Stones of Thought . Oxford University Press, 2015. Google Scholar CrossRef Search ADS [19] Scott. D. Completeness and axiomatizability in many-valued logic. In Proceedings of the Tarski Symposium , Henkin L. editor, pp. 411– 436. American Mathematical Society, 1974. [20] Scott. D. Rules and derived rules. In Logical Theory and Semantic Analysis , Stenlund S. ed., pp. 147– 161. D. Reidel, 1974. Google Scholar CrossRef Search ADS [21] Segerberg. K. Classical Propositional Operators: An Exercise in the Foundations of Logic . Clarendon Press, 1982. [22] Shoesmith D. J. and Smiley. T. J. Multiple-conclusion Logic . Cambridge University Press, 1978. Google Scholar CrossRef Search ADS [23] Steinberger. F. Why conclusions should remain single. Journal of Philosophical Logic , 40, 333– 355, 2011. Google Scholar CrossRef Search ADS [24] Thomas. M. A Kripke-style semantics for paradox-tolerant, nontransitive intuitionistic logic. 2015. To appear. [25] Weir. A. Naive truth and sophisticated logic. In Deflationism and Paradox , Beall Jc. and Armour-Garb B. eds, pp. 218– 249. Oxford University Press, 2005. [26] Weir. A. A robust non-transitive logic. Topoi , 34, 99– 107, 2015. Google Scholar CrossRef Search ADS © The Author, 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/about_us/legal/notices) For permissions, please e-mail: journals. permissions@oup.com

Journal of Logic and Computation – Oxford University Press

**Published: ** Mar 1, 2018

Loading...

personal research library

It’s your single place to instantly

**discover** and **read** the research

that matters to you.

Enjoy **affordable access** to

over 12 million articles from more than

**10,000 peer-reviewed journals**.

All for just $49/month

Read as many articles as you need. **Full articles** with original layout, charts and figures. Read **online**, from anywhere.

Keep up with your field with **Personalized Recommendations** and **Follow Journals** to get automatic updates.

It’s easy to organize your research with our built-in **tools**.

Read from thousands of the leading scholarly journals from *SpringerNature*, *Elsevier*, *Wiley-Blackwell*, *Oxford University Press* and more.

All the latest content is available, no embargo periods.

## “Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”

Daniel C.

## “Whoa! It’s like Spotify but for academic articles.”

@Phil_Robichaud

## “I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”

@deepthiw

## “My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”

@JoseServera

## DeepDyve Freelancer | ## DeepDyve Pro | |

Price | FREE | $49/month $360/year |

Save searches from Google Scholar, PubMed | ||

Create lists to organize your research | ||

Export lists, citations | ||

Read DeepDyve articles | Abstract access only | Unlimited access to over 18 million full-text articles |

Print | 20 pages/month | |

PDF Discount | 20% off | |

Read and print from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, **log in** first, or **sign up** for a DeepDyve account if you don’t already have one.