Truthmaker Semantics for Relevant Logic Mark Jago Forthcoming in Journal of Philosophical Logic Abstract: I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specic states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. Keywords: Truthmaking / truthmaker semantics / relevant logic / relevance / conditionality contraposition / non-classical logic / semantics 1 Introduction This paper develops and defends a truthmaker semantics for relevant logic. Relevant logics developed rst by way of proof theory (Church 1951; Moh 1950; Orlov 1928), followed by various formal semantics (Dunn 1966; Fine 1974; Routley and Meyer 1972a;b; 1973; Urquhart 1972a;b), leaving open the issue of a suitable philosophical interpretation. Various attempts followed (e.g. Mares 1996; 2004; Restall 1995). (Restall (2004) gives a good history of relevant logics.) My approach, by contrast, is to begin with a philosophical idea and develop it in various directions, so as to build a technically adequate relevant semantics. The philosophical idea is based on truthmaking. We have states of affairs and a method of combining them together, and sentences are true or false in virtue of those states. This simple picture naturally harbours a persuasive notion of conditionality, which is neither classical or intuitionistic but relevant. So the question arises, can a truthmaker semantics be developed for a whole system of relevant logic? I argue that it can. I focus on the most well-known relevant logic, R (set out in appendix A). My strategy is to argue, on philosophical grounds, for a number of principles governing truthmaker semantics and to show that, taken together, these give a sound and complete formal semantics for R. My approach rst adopts a notion of conditionality (§3), to which I then add conjunction (§4), disjunction (§5), and negation (§6). I then discuss how to accommodate the stronger principles of contraposition (§7) and excluded middle (§8). The technical appendices set out R (appendix A), the formal semantics and its key properties (appendix B), and proofs of soundness and completeness (appendix C). Throughout, I shall focus on developing the truthmaker approach 1 and discussing the philosophical issues it raises, rather than discussing alternative semantics or their philosophical interpretations. By way of further motivating the approach, I begin (§2) with a puzzle, relating relevance, conditionality, and validity. I then argue (§3) that the truthmaker approach provides a very elegant solution. 2 The Problem of Relevance Relevant logics seek to avoid 'fallacies of relevance', or 'paradoxes' of the material or strict conditional, such as: (1) A → (B → B) (2) A → (B ∨¬B) (3) (A∧¬A)→ B These are not valid in relevant logics. But B → B is valid in all relevant logics, and B ∨¬B is valid in strong ones. So to avoid (1) and (2), the semantics requires points of evaluation where B → B and B ∨¬B fail to obtain. Yet if these can fail to obtain, what entitles a relevant logician to call them valid? So a rst problem for a relevant semantics is this: Problem 1: How can A → A (and A∨¬A) fail to obtain and yet still be valid? Taken as a purely technical problem, a solution is easy to nd. We can distinguish normal from non-normal points, allow A → A and A∨¬A to fail at non-normal points only, and dene validity as whatever obtains at all normal points in all models. But the problem I have in mind is philosophical, concerning our concept of validity, and not merely a technical one: Problem 2: How can a semantics which solves problem 1 be philosophically justied? If a semantic point of evaluation is good for counterexampling an inference or a conditional, why is it not good for counterexampling a claim to validity? It seems we must simply stipulate that some points are to count for purposes of validity and some are not. That doesn't answer our question; it merely stipulates that it's not to be asked. The solution I offer is in terms of truthmakers, the entities in virtue of which truths are true. 2 3 The Conditional Truths are true in virtue of certain situations or states of affairs obtaining. (I'll speak of states.) To say that a truth is true in virtue of a specic state is not merely to say that the state guarantees that truth. On the intended sense, 'Socrates drank hemlock' is true in virtue of the specic state that Socrates drank Hemlock but not in virtue of the entire state of classical Athens, even though that big state clearly sufces for that truth. A truthmaker for a truth should be just enough – neither too much nor too little – to make the truth true (Rodriguez-Pereyra 2006). Fine (2017a;b;c) calls this exact truthmaking, whereby a truthmaker 'must be relevant as a whole to the truth of the statement' (Fine 2017a, 628). It is this exact notion of truthmaking which will be operative throughout. We might then understand the implication from A to B, in broad outline, as follows. Beginning with some state, suppose we were to add to it any truthmaker for A. Would we then arrive at a state in virtue of which B is true? If so, then the original state counts as a truthmaker for the conditional A → B. This is just the beginnings of an analysis of the conditional. We will need to understand what 'adding' states amounts to. But note already an important feature of the approach: enlarging a state in virtue of which A is true need not result in a state in virtue of which A remains true. We can expand the specic state in which Socrates drinks hemlock to encompass the state of Athens, which (as noted above) is not a truthmaker for 'Socrates drank hemlock'. So, on our analysis, the state Athens is not a truthmaker for: (4) If Socrates drinks hemlock then Socrates drinks hemlock Likewise, the states that I am currently typing and that wombats waddle are not truthmakers for (4). Very few states are. Note how these states are perfectly normal, with no special metaphysical or logical quirks. We thus have a very natural explanation of how instances of A → A may fail at a state. We get this because our evaluative relation between state and sentence holds when that sentence is true in virtue of (and not merely relative to) that state. What then of validity? A valid sentence is one that is true whatever, irrespective of which states of affairs obtain. Given any states of affairs, or none, a valid sentence will be true. Its truth depends on nothing in particular; its demand on reality is nothing at all. It is not that valid sentences lack truthmakers. 'I am typing or not typing' is true because I'm typing; and, on our analysis, that Socrates drank hemlock is a truthmaker for (4). The point is that (4) would be true even if Socrates hadn't drank hemlock. Its truth demands nothing of the world. It is useful to have a way of evaluating sentences with respect to nothing (with apologies to Lewis Carroll). Just as the empty set is a collection with no members, the null state is a state that is, or represents, nothing at all. If we accept this notion – as an abstraction, or what Forrest (2002, 79) call as 'ctitious item', or some 3 other way – then we have a very intuitive truthmaking analysis of validity as being made true by the null state. This criterion immediately pays dividends. Adding a truthmaker for A to the null state results in none other than that same truthmaker for A. So, on our analysis, the null state is guaranteed to make A → A true. A → A is therefore valid, even though we have states available which do not make A → A true: exactly the desired result. (I'll return to the validity of A∨¬A in §8.) None of this would get us very far if we could not pin down some reasonable notion of 'putting states together'. Luckily, we may appeal to ideas that have become standard in truthmaker semantics. At its core, this is just the idea sketched above on which sentences are evaluated relative to states, with the evaluation relation, '⊩', understood in terms of the sentence's being true in virtue of that state. Truthmaker semantics comes with a built-in notion of 'putting two states together'. All states in the domain are ordered by a partial order (reexive, transitive, and anti-symmetric) ⊑, with a minimal element ◽ (the null state), such that any two states s, u have a least upper bound, s ⊔ u in the domain. This ordering ⊑ is typically interpreted as the parthood relation, with 's ⊑ u' read as: s is a part of u. Under this interpretation, 's ⊔ u' denotes the mereological sum (or fusion, or composition) of s and u. So we can interpret talk of 'adding state u to state s' as resulting in the state s ⊔ u. Truthmaker semantics is a natural framework within which to locate a semantics for relevant logics, for at least three reasons. First, invoking the 'true in virtue of' locution requires that truthmakers be relevant to what they make true. Not every state makes 'a is either red or not red' true. That a is red does, but that b is blue does not. The notion of relevance here is left at the intuitive level, just as it is in relevance logic; but still, there does seem to be a conuence of motivation. Second, as just noted, truthmaker semantics pins down a suitable notion of 'putting two states together' which (as we shall see below) gives rise to a suitable conditional. And third, as we just saw, it provides an intuitive notion of validity (via the null state, a stock character of truthmaker semantics) on which A → A is valid. With these minimal resources, we can begin setting out the semantics for the conditional (with the other connectives to appear through §§4–6). A truthmaker s for A → B is a state which, whenever combined with a truthmaker for A, results in a truthmaker for B: (→) s ⊩ A → B iff, for all states u such that u ⊩ A, s ⊔ u ⊩ B. Urquhart (1972a; 1972b) gives a technically identical clause, but without the truthmaking interpretation (he speaks of 'pieces of information'). Not only is (→) very natural within truthmaker semantics, it also gives exactly the results we're after. As Urquhart shows, to obtain the conditional of R we require ⊔ to be idempotent (s ⊔ s = s), commutative (s ⊔ u = u ⊔ s), and associative ((s ⊔ t) ⊔ u = s ⊔ (t ⊔ u)). These are mathematically guaranteed in truthmaker 4 semantics by our denition of ⊔ in terms of the partial order ⊑ and they are philosophically justied on our interpretation of ⊑ as parthood. (By contrast, there's no guarantee that 'pieces of information' will behave like this. Order and repetition may be essential to some instructions, for example.) So adding (→) to the semantics results in a conditional which behaves just like the relevant conditional (at least, when no other connectives are around). Now let's see what happens when we consider more connectives, beginning with conjunction. 4 Conjunction Adding conjunction to our account is straightforward from a purely logical point of view, but it raises philosophical questions of interpretation. Classically and intuitionistically, conjunction is that connective which licences the inference from a pair of sentences to their combination and back again, and which allows us to move between premises and conditional antecedents. In relevant logics, these roles split into two. Extensional conjunction, written '∧', is governed by the axioms A ∧ B → A, A ∧ B → B and the adjunction rule: from A,B, infer A∧ B. But it does not allow us to transform conjoined premises into conditional antecedents. If it did, we could move from A∧B ⊢ A (valid in any relevant logic) to B ⊢ A → A (which is one of those irrelevant inferences which relevant logics seek to avoid). Intensional conjunction, '○', by contrast, preserves the inferential connection between premises and conditional antecedents, known as residuation: A ○ B ⊢R C iff A ⊢R B → C The trade-off is that A ○ B does not imply either conjunct on its own. So neither ∧ nor ○ preserve all features of 'and' to which classical and intuitionistic logic have accustomed us. Given that A∧B → A is valid, the clause for ∧ has to be the usual-looking one: (∧) s ⊩ A∧ B iff s ⊩ A and s ⊩ B. The clause for ○ likewise is already xed. If adding a B-state to an A-state always results in a C-state then, residuation tells us, any A ○B-state is a C state. Since this holds for any C, the A ○ B-states must be the sum of an A-state with a B-state: (○) s ⊩ A ○ B iff there are states s, u such that s = t ⊔ u, t ⊩ A, and u ⊩ B. (The permutation axiom of R implies A ○ B ⊢R B ○ A, which concurs with our symmetrical treatment of summation.) Given these clauses, we have a sound and complete semantics for the → /∧ /○ fragment of R (appendix C). 5 How should we understand ○ and ∧, as dened in relevant logic, given that neither preserves all the inferential features a competent user expects of 'and'? In discussing the issue, Mares (2009) offers an explanation of the two conjunctions in terms of situations carrying information. A situation s carries the information that A∧ B when it carries the information that A and the information that B. By contrast, s carries the information that A ○ B by carrying the information that there are other states, s1 and s2 'in the same world', which carry the information that A and that B, respectively (2009, 9). But this understanding is problematic, if we understand 'carries the information that A' to be factive. For if s carries the information that some other existent state carries the information that A, then s carries the information that A, and so A ○ B collapses into A∧ B. More generally, relevant logicians assume that the inferential patterns we intuitively associate with 'and' split in relevant logic between ∧ and ○. On that view, we are wrong to treat 'and' as a unied concept governed by these inferential patterns. There must be two 'and'-concepts in common usage, a fact hidden to introspection and conceptual reection but uncovered relatively recently by relevant logicians. That is deeply implausible. Truthmaker semantics, I suggest, can offer a better explanation. Truthmaker semantics is committed to reading '○', rather than '∧', as English 'and'. For truthmaker semantics makes use of the exact, 'in virtue of' concept of truthmaking (§3), on which 'A and B' is true in virtue of the state consisting of a truthmaker A plus a truthmaker for B (Rodriguez-Pereyra 2006). This clause, rst suggested by van Fraassen (1969), is characteristic of exact semantics; and it is precisely the clause for (○). In giving an exact semantics, therefore, we are committed to aligning the connective dened by (○) with the concept we express in English using 'and'. How can I insist that '○' be read as 'and', when 'A and B' clearly implies 'A' whilst 'A ○ B' does not? Let me explain. Truthmaker semantics discerns an exact and an inexact notion of truthmaking, where an inexact truthmaker for A is any state which has an exact truthmaker for A as a part. These give rise to exact and inexact notions of inference. Both can be seen as good forms of reasoning, each on their own terms. The former preserves specic grounds for truth, and hence relevance; the latter preserves just the existence of a ground for truth, which need not maintain relevance. Of course conjunctions entail their conjuncts, in the truth-preservation sense. And indeed, on the inexact sense, A ○ B entails A. On this explanation, it is the concept of good reasoning that splits, not the concept of conjunction. So ○ is maintained as the univocal concept of conjunction, with different inferential behaviours depending on which notion of reasoning (exact or inexact) is in play. Can't a parallel argument by run in favour of treating ∧ as the univocal notion of conjunction? No. The argument takes standard truthmaker semantics as its starting point, on which the treatment of 'and' is clear: it is that connective which 6 satises the semantic clause (○) in the exact setting. The explanation is available only if we adopt the philosophical perspective on which ○ (as we notate it here) is genuine 'and'. What then of ∧? Its exact semantics suggests an 'overlapping content' interpretation: 'A ∧ B' says that A and B have a truthmaker in common. That state is an exact truthmaker for A∧ B, just as (∧) says. We may be interested in whether some mental statement A has a physical realiser, for example. This will be the case if A and the disjunction P of all physical statements have a common truthmaker (reference omitted), that is, if A∧ P (as understood here) is true. Note that a state may inexactly truthmake both A and B without their having an exact truthmaker in common. As a result, we cannot reason inexactly from A,B to A ∧ B. Unlike ○, ∧ does not coincide with classical conjunction within inexact reasoning. 5 Disjunction When we turn to disjunction, the semantic picture becomes more complex. Interpreting disjunction in the usual extensional way: (∨E) s ⊩ A∨ B iff s ⊩ A or s ⊩ B results in a logic strictly stronger than R+, the negation-free fragment of R (Urquhart 1972a; see Fine 1976 for further results). There are independent reasons to be wary of (∨E) within an exact semantics. The state of my having a (binary) sibling makes it true that I have either a sister or a brother, but it doesn't make it true that I have a brother and it doesn't make it true that I have a sister. We should not identify the former 'disjunctive' state of affairs with either of the more determinate 'disjunct' ones, for they have different identity and persistence conditions. They involve different properties and, were my brother to change his gender to female, the sibling state would remain but the brother state would not. I suggest that states may stand to one another in a non-causal relation of determination or renement. That I have a brother determines that I have a sibling. That the box is scarlet determines that the box is red. In each case, the former renes the latter, making it more precise. The notion I have in mind is related to the traditional determinate-determinable classication (Prior 1949; Wilson 2017). But (as I intend the notion and unlike on the traditional one) distinct determinates need not exclude one another: I may have both a sister and a brother, with each state individually determining that I have a sibling. I'll use 'determines' and 'is determined by' in this sense throughout, writing 's ≺ u' for 's determines u' and (as will be more common) using '⪯' for the non-strict analogue, a partial order on states. We need not worry whether there exist absolutely determinate states, for certain states are determinate enough for our purposes: those (relative to a xed language) which make true a disjunct of each disjunction they make true. These 7 are the prime states (which may or may not be atoms of ⪯). We will work with a set P of prime states and write s ⪯P u when s is a prime determinate of u. With this in mind, an analysis of disjunction presents itself. The state that I have a (binary) sibling makes it true that I have either a brother or a sister because any prime determinate of it is a truthmaker either for 'I have a brother' or for 'I have a sister'. Similarly, the state of affairs that the box is red makes true the disjunction 'the box is scarlet or crimson or . . . ' because, however we make it determinate enough, we get a truthmaker for 'the box is scarlet' or for 'the box is crimson' or . . . . So our clause for disjunction is as follows: (∨) s ⊩ A∨ B iff, for all u ⪯P s, u ⊩ A or u ⊩ B. Our partial orders ⊑ and ⪯ should interact in various ways. Since that a is scarlet determines that a is red, we should also say that a is scarlet and b is square determines that a is red and b is square. Generalising: (C2) If s ⪯ u then, for any t, s ⊔ t ⪯ u ⊔ t. Given this principle, that the box is scarlet and I have a brother determines both that the box is red and I have a sibling (t ⊔ u) and that the box is scarlet and I have a sibling (t′ ⊔ u), in which a part of the latter determines the corresponding part of the former. Our second principle generalises this relationship for prime determinates: (C3) If s ⪯P t ⊔ u, then there is a t′ ⪯P t such that s ⪯P t′ ⊔ u. Given the examples, these principles seem well justied. The resulting semantics is sound and complete for the positive fragment R+ (appendix C). Taking stock: truthmaker semantics, augmented with the notion of determination and a natural notion of conditionality, results in an intuitive, natural, and philosophically justied semantics for R+. Now we turn to negation, where the going will be harder. 6 Negation and False Conditionals Truthmaker semantics comes with a built-in approach to negation, through the concept of falsitymaking. States make propositions false, just as they make other propositions true. The state that I'm sitting makes it false that I'm standing up, false that no one is sitting, and false that I'm an immaterial entity. A truthmaker for a negated proposition ¬A is then whatever would make A false; and similarly, a falsitymaker for ¬A is whatever would make A true. We then require falsitymaking clauses for the other connectives, in parallel to their truthmaking clauses. Given the De Morgan equivalences, the truthmaking cases for ∧ and ∨ must follow the truthmaking clauses for ∨ and ∧, respectively; and given residuation, a falsitymaker 8 for A ○ B must be any state which, when combined with a truthmaker for one conjunct, results in a falsemaker for the other. (The clauses are listed in full in appendix B, denition 2.) The one piece still missing is an account of how the conditional is made false. A falsitymaker for a conditional A → B should (in some sense) be a counterexample to it. But we cannot take this to mean a state whose sum with a truthmaker for A is not thereby a truthmaker for B. For then, s would make false any conditional it does not make true, so that any state would make (A → B)∨¬(A → B) true and hence the irrelevant C → ((A → B)∨¬(A → B)) would be valid. An alternative is to consider a further way of combining states, ⊔, under which the combination of a conditional falsitymaker and an antecedent truthmaker will fail to make the consequent true. But this approach, whilst technically adequate, is unappealing in the present setting. The appeal of (→) is that it uses the intuitive and philosophically well-understood part-whole relation. Nothing similar can be said for (⊔). A better approach is to consider compatibility relations that hold between states (Berto and Restall 2018; Restall 1999). Intuitively, states s and u are compatible when what one makes true the other does not make false and vice versa. But for the purposes of our semantics, we want to take compatibility as a primitive concept and constrain the truthmaking and falsitymaking relations accordingly. Since compatibility is intuitively well understood, it seems reasonable to take it as a primitive (just as many theories of modality take the possibility of a world as a primitive notion). To obtain a full semantics for R, we will need to make sense of one state s's being maximally compatible with another, u, such that if one doesn't truthmake A, the other makes it false. Such states form an exhaustive pair. I'll discuss below whether this assumption is reasonable. For now, let's see where it gets us. First, note that both compatibility and exhaustiveness are symmetrical but non-reexive. A state will not be compatible with itself when it makes some A both true and false; and it will form an exhaustive pair with itself just in case it itself makes each A either true or false. Following Routley (1984), let's say that each state in an exhaustive pair is the mate of the other. We may think of matehood as a function from states to states, such that s's mate's mate is s itself. Writing sM for the s's mate, the conceptual picture we have is that: s ⊩ A iff sM ê A s ê A iff sM ⊮ A sMM = s We arrived at this picture by considering the concepts of compatibility and exhaustiveness. However, these shall play no ofcial role in the formal semantics. Rather, we shall assume a primitive matehood function, dened so that sMM = s and constraining valuations so that the biconditionals above hold for primitive sentences. (We then show that the biconditionals hold for arbitrary sentences, via the crossover lemma B.4.) Armed with the notion of a mate, we can now return to the issue of falsitymaking for conditionals. As a rst approximation, we take a state to be a 9 falsitymaker for a conditional when its mate is a counterexample: (5) s ê A → B iff ∃u ⊩ A ∶ sM ⊔ u ⊮ B An issue we must address is the interplay of matehood and non-prime states. A non-prime state s makes true some disjunction A ∨ B, but neither A nor B. If it had a mate sM, it would make both A and B and hence A ∨ B false. But then sM cannot be s's mate, since it makes false something s makes true. So we must restrict the concept of matehood to prime states. This is no problem, for the truthmaking and falsitymaking behaviour of non-prime states is fully captured by their prime determinates. A non-prime state s truthmakes (and falsitymakes) whatever all its prime determinates truthmake (and falsitymake): (Heredity) s ⊩ A iff u ⊩ A for all u ⪯P s; and s ê A iff u ê A for all u ⪯P s. (See lemma B.2, appendix B.) So absent a mate for non-prime s, we can work with the mates of s's prime determinates. In particular, we can take non-prime s to be a falsitymaker for a conditional A → B when all its prime determinates satisfy (5): (→F) s ê A → B iff ∀t ⪯P s ∃u ⊩ A ∶ tM ⊔ u ⊮ B When s is a prime state, this implies (5) (corollary B.3b) and so we may adopt (→F) in general, whether s is prime or not. We could now revisit our analysis of the other connectives, using matehood to give each a falsitymaking clause. In fact, we could avoid a falsitymaking clause altogether and give a clause for negated sentences directly in terms of matehood (corollary B.5), as is standard in relevant semantics (where the Routley star is used in place of matehood). This however leads to a denition of negation in terms of incompatibility, which risks conceptual circularity. (Berto and Restall (2018) argue otherwise). It is preferable within truthmaker semantics to analyse negation in terms of falsitymaking, with matehood acting as a restriction on (and not a denition of) truthmaker-falsitymaker pairs. This approach assumes all prime states have a mate. Is that assumption reasonable? Not if we align states with Armstrong's states of affairs, with each characterised in terms of a particular having a property, or some particulars standing in some relation (Armstrong 1997). The state of affairs that Anna is wistful involves Anna herself and the property of being wistful, but there is no Armstrong-style state which makes false all that this does not make true: that Bec is creative, that Cath is rich, and so on. For semantic purposes, we should not tie the notion of a state to a particular metaphysical view. To make sense of a sensible notion of entailment, we need enough freedom to provide a suitable stock of counter-models. This requires a valuation function (xing truthmaking and falsitymaking for atomic sentences) which is relatively unconstrained, restricted only by the structural requirements imposed by determination and matehood (conditions (C5) and (C6) in appendix B). Given this approach, the existence of mates is unproblematic. 10 7 Contraposition How should matehood interact with summation and determination? The interaction will affect how negation behaves within a conditional, as in the case of conditionals which contrapose and support reductio (both of which are valid in R): (Contraposition) (A → B)→ (¬B → ¬A) (Reductio) (A → ¬A)→ ¬A These axioms imply corresponding rules, preserving validity from antecedent to consequent. It is hard to deny that a conditional should obey the contraposition rule. And indeed, it holds in the truthmaker semantics with mates, without any conditions relating matehood to summation or determination (corollary B.11, appendix B). The fact that we get (rule) contraposition for free is a further indication that truthmaker models are a natural home for the conditional. We cannot infer from the contraposition rule to the axiom, however. The axiom is stronger: it requires every state which makes A → B true to also make ¬B → ¬A true. (The rule requires this only of the null state.) This won't be the case in general, as the following model shows (with lines indicating parthood): ◽ us t ¬q q p Here, u truthmakes p → q, since the only p-state is s and their sum t (= s ⊔ u) truthmakes q. But u doesn't truthmake ¬q → ¬p, since it falsemakes q and yet, summed with itself (u ⊔ u = u), it doesn't falsemake p. (That valid rules do not always translate into valid conditionals is a quirk of relevant logic, but not just of relevant logic. Necessitation (from A's validity to ◻A's) is valid in normal modal logics, but A → ◻A is certainly not.) Validating contraposition requires interaction between matehood, summation, and determination so that, if s and u are prime and s determines u's sum with some other state t, then uM determines sM 's sum with t: (C4) If s ⪯ t ⊔ u then uM ⪯ t ⊔ sM 11 If we accept (C4), then the resulting truthmaker semantics is sound and complete for R (appendix C). I don't know of any direct argument, in terms of our intuitive understanding of the truthmaker semantics, which will justify (C4). But there is a kind of bootstrapping argument. First, we note how well summation of states interprets the relevant conditional, as argued in §3. This justies viewing summation itself as an operation which delivers consequent-truthmakers through the combination of conditional-truthmakers with antecedent-truthmakers. That is, summation behaves as an ontological correlate of modus ponens. Second, where modus ponens goes, so goes modus tollens. An ontic modus tollens will say that a truthmaker for a conditional combined with a consequent-counterexample results in an antecedent-counterexample (or a determinate of one). Now recall (from §6) that we analyse conditional counterexamples via matehood. Putting these parts together: combining a conditional-truthmaker with the mate of some consequentstate yields the mate of some antecedent-state (or one which determines it). That's just what (C4) says. Now, this argument clearly doesn't show that the truthmaker semantics is committed to (C4). It is intended to show that (C4) is a reasonable principle to adopt, by highlighting that there is a justied way of conceptualising summation which supports (C4). I don't know of any philosophical interpretation of a relevant semantics which mandates contraposition. A contrapositionsupporting semantic feature may be added to the familiar interpretations, but it is not forced by them. The approach suggested here seems to do at least as well. 8 Excluded Middle Our nal task in giving a semantics for R is to secure the validity of excluded middle, A∨¬A. On the face of it, this is a challenging principle for a truthmaker semantics. For in general, a state need make neither A nor ¬A true. And if an arbitrary state need not pronounce on whether A, then it hardly seems that the null state ◽, which we use to record validity, will do any better. To guarantee that A ∨ ¬A is made true by the null state, we may adopt the following principle: (6) If s ⪯P ◽ then s ⪯ sM This delivers excluded middle as follows. Suppose s is an arbitrary prime state which determines the null state, s ⪯P ◽. (Note that we do not assume that the null state must be fully determinate.) Then for any A, we can show that either s ⊩ A or s ⊩ ¬A. For if s ⊮ A then sM ⊩ ¬A, s ⪯ sM (by (6)) and so s ⊩ ¬A (by heredity). So we have either s ⊩ A or s ⊩ ¬A for any prime determinate of ◽ and so, by our analysis of disjunction, ◽ ⊩ A∨¬A. 12 How might we argue for (6)? It turns out that, given our acceptance of the contraposition principle (C4), we can establish (6) on purely logical grounds. First, we establish (7) For any s ∈ P, s ⪯ s ⊔ sM as follows (for s ∈ P): sM ⪯ sM (reexivity of ⪯) ⇔ sM ⪯ sM ⊔ sM (idempotence of ⊔) ⇔ sMM ⪯ sM ⊔ sMM (C4) ⇔ s ⪯ s ⊔ sM (commutativity of ⊔, sMM = s) from which we derive (6): s ⪯ ◽ ⇒ s ⊔ sM ⪯ ◽ ⊔ sM (C2) ⇔ s ⊔ sM ⪯ sM (◽ ⊔ u = u) ⇔ s ⪯ sM (7, transitivity of ⪯) As a result, we guarantee the validity of excluded middle on accepting the contraposition principle (C4). We might nd additional motivation for this approach, independently of (C4), as follows. The null state is relevant to each A, if only in that it truthmakes the trivial implication from A to itself (which many states do not). Any determinate of the null state must therefore remain relevant to each A. But if a state relevant to some A is to count as determinate enough (as we characterise the prime states), then it should settle A one way or another. If so, then any prime determinate of the null state must settle each A one way or another, which (as the above reasoning shows) will guarantee the validity of excluded middle. 9 Other Logics Logics other than R may be obtained by tweaking various features of the semantics, but these will not always be philosophically acceptable. I'll briey outline some of the options. The relevant logic E may be axiomatised like R but with restricted assertion, ((A → A) → B) → B, in place of permutation. The semantics must drop the assumption that ⊔ commutes (s ⊔ u = u ⊔ s). Restricted assertion is valid so long as the null state is a right identity, s ⊔ ◽ = s. A complete truthmaker semantics for E requires a more radical amendment than merely dropping commutativity, however. We must reformulate the conditions on ⊔ using renement in place of identity. Thus idempotence becomes s ⪯ s ⊔ s, right identity s ⪯ s ⊔ ◽, and so on. 13 The intuitive reason is that A is equivalent to (A → A)→ A in R, where it encodes 'A is true', but not in E, where it encodes 'A is necessary'. Without this equivalence, our attempts to demonstrate identities s = t ⊔ u in the completeness proof are frustrated. With conditions on ⊔ formulated in terms of inequalities s ⪯ t ⊔ u, we can give semantics for a range of weaker logics, including ticket entailment T, using the conditions given in Fine (1974). However, none of these moves will be underpinned by our philosophical understanding of ⊔ in terms of parthood, which demands both commutativity and the identity formulation of the conditions. Genuine truthmaker semantics results in a logic whose implicational fragment is at least as strong as R→. Stronger logics are available, at the expense of relevance. RM adds to R the mingle axiom, A → (A → A). The truthmaker semantics for RM is given by closed models, where a model is closed when s ⊔ u ⊩ A whenever s ⊩ A and u ⊩ A, and s ⊔ u ê A whenever s ê A and u ê A. (Within a closed model, sets of states correspond to what Fine (2017a) calls closed propositions.) Philosophically, closure seems highly reasonable: combining two truthmakers for a claim results in a state which both guarantees and is clearly relevant to that claim's truth. However, we cannot guarantee closure in a model merely by imposing it on the valuation functions (for the falsemaking clause for → depends on what a related state does not make true, over which the imposition of closure to less complex sentences has no say.) We might also consider a semantics dened in terms of inexact, rather than exact, truthmaking. (Recall that an inexact truthmaker for A is one which has an exact truthmaker for A as a part.) If we re-dene validity in terms of inexact truthmaking at the null state of all models, or all states of all models, we get the same set of valid sentences as previously. For the null state has no parts but itself and so it inexactly truthmakes whatever it exactly truthmakes. Alternatively, we might consider an entailment A ⊧ B to hold just in case any state in any model inexactly truthmakes B when it inexactly truthmakes A. On this approach, ○ behaves as extensional conjunction, made true wherever its conjuncts are. Taking ○ as conjunction and ignoring ∧, A ⊧ B just in case A tautologically entails B in Anderson and Belnap's (1962) sense, as van Fraassen (1969) shows. Taking A → B to be valid when A tautologically entails B results in rst degree entailment, FDE (Anderson and Belnap 1963). Finally, we might consider a conditional ⇒, dened so that s ⊩ A⇒ B iff, for all u ⊩ A and some t ⊑ s⊔ u, t ⊩ B. (When this is so, s⊔ u inexactly makes B true.) Then positive paradox A → (B → A) will be valid, since the sum of an A-state and B-state will inexactly make A true. The resulting conditional is then at least as strong as intuitionistic implication. In the presence of negation, we have classical logic (again with ○ as conjunction). If we ignore ¬ and introduce a constant , we can give an intuitionistic semantics in the style of Fine (2014), by taking  to be 14 inexactly made true by states which inexactly make true every primitive. (We can then dene an intuitionistically acceptable negation ∼A as A → .) 10 Conclusion Truthmaker semantics provides philosophically well-motivated home for relevance logic (for R at least). Adding a very natural notion of conditionality to standard truthmaker semantics gives a ready-made semantics for R→ (§3). For the ¬-free fragment R+, we need to add the notion of determination, which is justied on philosophical grounds (§5). When we add negation, we need to add the notion of matehood to relate truthmakers and falsitymakers (§6). Achieving a fully contraposing conditional, and hence a full semantics for R, requires interaction between parthood, determination, and matehood. This is plausible, but not mandatory, from the perspective of truthmaker semantics (§7). We saw how the intuitive analysis of validity in terms of being made true by the null state can account for the validity of excluded middle (§8). The semantics may be adapted for weaker relevant logics (§9) but, philosophically, R+ is as weak as the truthmaker approach should go. Technical Appendix A The Logic R R→ is the implicational fragment of R, axiomatised by: (Identity) A → A (Prexing) (A → B)→ ((C → A)→ (C → B)) (Contraction) (A → (A → B))→ (A → B) (Permutation) (A → (B → C))→ (B → (A → C)) with modus ponens, A,A → B/B as the only rule. For ∧ and ∨, we add: (∧-introduction) ((A → B)∧ (A → C))→ (A → B ∧C) (∧-elimination) A∧ B → A A∧ B → B (∨-introduction) A → A∨ B B → A∨ B (∨-elimination) ((A → C)∧ (B → C))→ (A∨ B → C) (Distribution) (A∧ (B ∨C))→ ((A∧ B)∨ (A∧C)) plus adjunction, A,B/A∧ B, as a rule. This gives the positive fragment, R+. For negation, we add: 15 (Contraposition) (A → B)→ (¬B → ¬A) (Reductio) (A → ¬A)→ ¬A (Double negation) ¬¬A → A The resulting logic is R. A ○ B can be dened in R as ¬(A → ¬B). In R+, we may treat it is a primitive and add an axiom: A ○ B → C ↔ (A → (B → C)). B Semantics We now dene formal models, based on the philosophical principles for which I argued through §§3–7. To keep proofs brief, I will treat ○ and ∨ as dened connectives, with A∨ B =df ¬(¬A∧¬B) and A ○ B =df ¬(A → ¬B). Denition 1 (Models). Models are tuples ⟨S,P, ◽,⊑,⪯,M,V+,V−⟩, where S and P ⊆ S are sets of states; ⊑ and ⪯ are partial orders on S; M is an operation on P; and V+ and V− are functions from S to sets of primitive sentence letters. Models must satisfy the following conditions (where 's ⪯P u' abbreviates 's ∈ P and s ⪯ u'): (C1) ⊑ is a partial order with a minimal element ◽ such that any pair s, u ∈ S has a ⊑-least upper bound, s ⊔ u ∈ S. (C2) ⪯ is a partial order which distributes over ⊔: if s ⪯ u then ∀t ∶ s ⊔ t ⪯ u ⊔ t. (C3) If s ⪯P t ⊔ u, then there is a t′ ⪯P t such that s ⪯P t′ ⊔ u. (C4) If s ⪯P t ⊔ u and u ∈ P then uM ⪯ t ⊔ sM . (C5) p ∈ V+s iff ∀u ⪯P s: p ∈ V+u; and p ∈ V−s iff ∀u ⪯P s: p ∈ V+u. (C6) For all s ∈ P: sMM = s; p ∈ V+s iff p ∉ V−sM ; and p ∈ V−s iff p ∉ V+sM . Denition 2 (Truthmaking and falsitymaking relations). s ⊩ p iff p ∈ V+s s ê p iff p ∈ V−s s ⊩ ¬A iff s ê A s ê ¬A iff s ⊩ A s ⊩ A∧ B iff s ⊩ A & s ⊩ B s ê A∧ B iff ∀u ⪯P s ∶ u ê A or u ê B s ⊩ A → B iff ∀u ⊩ A ∶ s ⊔ u ⊩ B s ê A → B iff ∀t ⪯P s ∃u ⊩ A ∶ tM ⊔ u ⊮ B These models synthesise ideas from Fine (1974) and Routley (1984), and many of the subsequent proofs borrow from theirs. (Given the interrelation of these moving parts, we cannot assume that their results hold without proof.) The formal treatment of ⪯ using (C2)–(C5) derives from Fine, whereas the formal treatment of negation and mates is due to Routley. Fine analyses negation via ⪯, whereas here 16 it is analysed directly in terms of falsitymaking. The philosophical interpretation here differs both from Fine's and Routley's. Neither author mentions truthmakers in those works and Fine (1974) understands ⪯ in terms of extension of a theory, rather than determinacy of states. Lemma B.1 (Disjunction). Disjunction has the following (derived) clauses: s ⊩ A∨ B iff ∀u ⪯P s ∶ u ⊩ A or u ⊩ B s ê A∨ B iff s ê A & s ê B Proof: s ⊩ A ∨ B iff s ⊩ ¬(¬A ∧ ¬B) iff s ê ¬A ∧ ¬B iff ∀u ⪯P s: u ê ¬A or u ê ¬B iff ∀u ⪯P s: u ⊩ A or u ⊩ B. s ê A∨B iff s ê ¬(¬A∧¬B) iff s ⊩ ¬A∧¬B iff s ⊩ ¬A & s ⊩ ¬A iff s ê A & s ê A. ∎ Lemma B.2 (Heredity). (a) s ⊩ A iff for all u ⪯P s ∶ u ⊩ A (b) s ê A iff for all u ⪯P s ∶ u ê A Proof: By double induction on A. The base cases follow immediately from (C5), so suppose both (a) and (b) hold for all B less complex than A and consider these cases. • A ∶= ¬B. For (a): s ⊩ ¬B iff s ê B iff ∀u ⪯P s ∶ u ê B (by IH) iff ∀u ⪯P s ∶ u ⊩ ¬B. For (b): s ê ¬B iff s ⊩ B iff ∀u ⪯P s ∶ u ⊩ B (by IH) iff ∀u ⪯P s ∶ u ê ¬B. • A ∶= B ∧C. For (a): s ⊩ B ∧C iff s ⊩ B and s ⊩ C iff ∀u ⪯P s: u ⊩ B and u ⊩ C (by IH) iff ∀u ⪯P s ∶ u ⊩ B ∧C. For (b): s ê B ∧C iff ∀u ⪯P s ∶ u ê B or u ê C iff ∀u ⪯P s∀t ⪯P u: t ê B or t ê C (if by transitivity of ⪯; only if by IH) iff ∀u ⪯P s ∶ u ê B ∧C. • A ∶= B → C. For (a) left-to-right: assume s ⊩ B → C, t ⊩ B, and u ⪯P s. Then s ⊔ t ⊩ C and u ⊔ t ⪯ s ⊔ t (by C2). Now assume v ⪯P u ⊔ t. Then v ⪯P s ⊔ t (by transitivity of ⪯), so v ⊩ C (by IH only if ). Since v was arbitrary, we infer ∀v ⪯ u ⊔ t ∶ C, hence u ⊔ t ⊩ C (by IH if ), and so u ⊩ B → C. Right-to-left is by contraposition. Assume s ⊮ B → C. So for some t ⊩ B, s ⊔ t ⊮ C. By hypothesis, there is some v ⪯P s ⊔ t such that v ⊮ C. By (C3), there is some u ⪯P s such that v ⪯ u ⊔ t. By hypothesis, u ⊔ t ⊮ C and so u ⊮ B → C. For (b), left-to-right: assume s ê B → C, u ⪯P s, and v ⪯P u. Then v ⪯P s, hence ∃t ⊩ B ∶ vM ⊔ t ⊮ C for any v ⪯P u, hence u ê B → C for any u ⪯P s. Right-to-left: assume ∀u ⪯P s ∶ u ê B → C. Then since u ⪯P u, by denition ∃t ⊩ B ∶ uM ⊔ t ⊮ C for any u ⪯P s and so s ê B → C. ∎ Corollary B.3. (a) If s ⊩ A and s ⪯ u then u ⊩ A; and if s ê A and s ⪯ u then u ê A. 17 (b) If s ∈ P, then the ∧ê, ∨⊩, and →ê clauses simplify to: s ê A∧ B iff s ê A or u ê B s ⊩ A∨ B iff s ⊩ A or s ⊩ B s ê A → B iff ∃u ⊩ A ∶ sM ⊔ u ⊮ B (c) s ⊩ A implies s ⊩ A∨ B Proof: For (a), assume s ⊩ A, u ⪯ s, and t ⪯P u. By transitivity of ⪯, t ⪯P s. So by lemma B.2, t ⊩ A for any t ⪯P u, and hence u ⊩ A. The ê case is similar. For (b), the left-to-right directions follow by the reexivity of ⪯ (given s ∈ P) and the right-to-left directions follow directly from lemma B.2. For (c), s ⊩ A iff ∀u ⪯P A (B.2) only if ∀u ⪯P A∨ B (b) iff s ⊩ A∨ B (B.2). ∎ Lemma B.4 (Crossover). For all prime states s: (a) s ⊩ A iff sM ê A (b) s ê A iff sM ⊮ A Proof: By double induction on A. Assume s is prime throughout. The base cases follow immediately from (C6), so suppose both (a) and (b) hold for all B less complex than A and consider these cases. • A ∶= ¬B. For (a): s ⊩ ¬B iff s ê B iff sM ⊮ A (by IH) iff sM ê ¬A. (b) is similar. • A ∶= B ∧C. For (a): s ⊩ B ∧C iff s ⊩ B and s ⊩ C iff sM ê B and sM ê C (by IH) iff sM ê B ∧C (B.3(b)). For (b): s ê B ∧C iff s ê B or s ê C iff sM ⊮ B or sM ⊮ C (by IH) iff sM ⊮ B ∧C. • A ∶= B → C. For (a): s ⊩ B → C iff ∀u ⊩ B ∶ s ⊔ u ⊩ C iff ¬∃u ⊩ B ∶ sMM ⊔ u ⊮ C (given sMM = u) iff sM ê B → C (B.3b, given s ∈ P). For (b): s ê B → C iff ∃u ⊩ A ∶ sM ⊔ u ⊮ B (B.3b) iff sM ⊮ B → C. ∎ Corollary B.5 (Star). For any s ∈ P: s ⊩ ¬A iff sM ⊮ A and s ê ¬A iff sM ê A. Corollary B.6 (Negation). (a) s ⊩ ¬A iff ∀u ⪯P s ∶ uM ⊮ A (b) s ê ¬A iff ∀u ⪯P s ∶ uM ê A Corollary B.7 (Equivalent Models). Let ⊪ be the relation dened recursively by the ⊩-clauses for p, A ∧ B, and A → B, and B.6(a) for ¬A. Then for any model M: s ⊪ A iff s ⊩ A. 18 Proof: B.5 is immediate from denition 1 and crossover (B.4). B.6 follows from B.5 and heredity (B.2). B.7 follows from B.6. ∎ B.5 shows that, for prime states at least, matehood can do the work of the Routley star. B.6 shows that we can effectively do away with the falsitymaking relation altogether and work only with truthmaking (as reected in B.7). This fact will simplify the completeness proof. We can now derive the expected clauses for intensional conjunction from its denition A ○ B =df ¬(A → ¬B): Lemma B.8 (Intensional conjunction). Intensional conjunction has the following (derived) clauses: s ⊩ A ○ B iff ∃tu ∶ t ⊩ A, u ⊩ B & s ⪯ t ⊔ u s ê A ○ B iff ∀u ⊩ A ∶ s ⊔ u ê B Proof: For the truthmaking clause, left-to-right: suppose s ⊩ ¬(A → ¬B) and let s+ ⪯P s. Then by denition, s+M ⊔ t ⊮ ¬B for some t ⊩ A. By lemma B.2, u ⊮ ¬B for some u ⪯P s+M ⊔ t, hence by B.5, uM ⊩ B and by (C4), s+ ⪯P t ⊔ uM. This holds for all s+ ⪯P s and so s ⪯ t ⊔ uM, t ⊩ A, and u ⊩ B. Right-to-left: suppose t ⊩ A, u ⊩ B, and s ⪯ t ⊔ u and assume s+ ⪯P s. By (C3), s+ ⪯ t ⊔ u+ for some u+ ⪯P u and so, by (C4), u+M ⪯P s+M ⊔ t. By B.2, u+ ⊩ B, so by B.5, u+M ⊮ ¬B and so by B.2, s+M ⊔ t ⊮ ¬B. Since s+ is prime, by denition s ê A → ¬B and so s ⊩ ¬(A → ¬B). For the falsitymaking clause: s ê ¬(A → ¬B) iff s ⊩ A → ¬B iff ∀u ⊩ A ∶ s ⊔ u ⊩ ¬B iff ∀u ⊩ A ∶ s ⊔ u ê B. ∎ As expected, a truthmaker for both conjuncts truthmakes their intensional conjunction, and any determinate of a falsemaker for the intensional conjunction is a falsemaker for at least one of its disjuncts: Corollary B.9. (i) If s ⊩ A and s ⊩ B then s ⊩ A ○ B; and (ii) if s ê A ○ B then, for any u ⪯P s, either u ê A or u ê B. Proof: For (i): since s ⪯ s ⊔ s, s ⊩ A & s ⊩ B implies s ⊩ A ○ B. For (ii): suppose s ê A ○ B and u ⪯P s but u ê A (to show u ê B). Then by B.2, u ⊩ A ○ B, by B.4, uM ⊩ A, and so by B.8, u ⊔ uM ê B. Since uM ⪯P uM ⊔ uM, (C4) implies uMM ⪯P uMM ⊔ uM , hence u ⪯P u ⊔ uM and, by B.2, u ê B. ∎ As is usual in models for relevant logics, we dene validity in terms of truth(making) at a designated state (◽) in all models. Since our models feature both truthmaking and falsitymaking relations, we might dene entailment in terms of preservation of truthmakers (from premises to conclusion), or in terms of falsitymaker preservation (from conclusion to premises), or both. As it happens, it doesn't matter which denition we adopt. Denition 3 (Validity). A is true on M, M ⊩ A, iff ◽ ⊩ A in M. A is valid, ⊧ A, iff true on all models. A set Γ is true on M when all its members are. 19 Denition 4 (Entailment). Γ entails A on M, Γ ⊧M A, iff for all states s in M, s ⊩ A if s ⊩ Γ. Γ 2-entails A on M, Γ ⊧2M A, iff for all states s in M: (i) s ⊩ Γ only if s ⊩ A and (ii) s ê A only if s ê Γ. Entailment (and 2-entailment) simpliciter is entailment (2-entailment) on all models. Lemma B.10 (Entailment). (a) M ⊧ A → B iff A ⊧M B (b) A ⊧2M B iff A ⊧M B Proof: For (a): M ⊧ A → B iff in M, ◽ ⊩ A → B iff for all s ⊩ A in M: s ⊔◽ ⊩ B iff for all s in M: s ⊩ A only if s ⊩ B (since s ⊔ ◽ = s) iff A ⊧M B. For (b), left-to-right is trivial. For right-to-left, assume A ⊧M B. Then s ê B iff ∀u ⪯P s: u ê B (lemma B.2) iff uM ⊮ B (lemma B.4) iff uM ⊮ A (since A ⊧M B) iff u ê A (B.4) iff u ê A (B.2), and so A ⊧2M B. ∎ Note the following corollary, which holds even in the absence of (C4): Corollary B.11 (Rule Contraposition). ⊧ A → B iff ⊧ ¬B → ¬A. Proof: For any model M: ⊧M A → B iff A ⊧M B iff A ⊧2M iff ∀s: (s ê B only if s ê A) iff ∀s: (s ⊩ ¬B only if s ⊩ ¬A) iff ¬B ⊧M ¬A iff ⊧M ¬B → ¬A. ∎ C Soundness and Completeness Theorem C.1 (Soundness). If A ∈ R then ⊧ A Proof: We need to show that each axiom of R is valid and that both modus ponens and adjunction preserve validity. For modus ponens, if ◽ ⊩ A → B then s ⊩ A implies ◽ ⊔ s = s ⊩ B, hence if ◽ ⊩ A then ◽ ⊩ B. For adjunction, if ◽ ⊩ A and ◽ ⊩ B then ◽ ⊩ A∧ B. For the axioms: each is of the form A → B. So, given lemma B.10, we need show only that, for any state s in any model, if s ⊩ A then s ⊩ B. Identity, ∧-elimination, and double negation are trivial, and ∨-introduction is immediate from corollary B.3(c). The remaining cases are as follows: Prexing: Suppose s ⊩ A → B and assume t ⊩ C → A and u ⊩ C. We show (s ⊔ t) ⊔ u ⊩ B. By denition, we have t ⊔ u ⊩ A and so (t ⊔ u) ⊔ s ⊩ B. Since (t ⊔ u)⊔ s = s ⊔ (t ⊔ u), the result follows. Contraction: Suppose s ⊩ A → (A → B) and assume u ⊩ A, to show s ⊔ u ⊩ B. Then (s ⊔ u)⊔ u ⊩ B and, since (s ⊔ u)⊔ u = s ⊔ (u ⊔ u) = s ⊔ u, the result follows. Permutation: Suppose s ⊩ A → (B → C) and assume t ⊩ B and y ⊩ A, to show (s ⊔ t) ⊔ u ⊩ C. Then s ⊔ u ⊩ B → C, so (s ⊔ u) ⊔ t ⊩ C. Since (s ⊔ u)⊔ t = (s ⊔ t)⊔ u, the result follows. 20 ∧-introduction: Suppose s ⊩ (A → B)∧ (A → C) and assume u ⊩ A, to show s ⊔ u ⊩ B ∧C. Then s ⊩ (A → B) and s ⊩ (A → C), hence s ⊔ u ⊩ B and s ⊔ u ⊩ C, and so s ⊔ u ⊩ B ∧C. ∨-elimination: Assume s ⊩ (A → C)∧ (B → C) and u ⊩ A∨ B. Then s ⊩ A → C, s ⊩ B → C. Now consider any t ⪯P s ⊔ u. By (C3), there is some v ⪯P u such that t ⪯P s ⊔ v. So v ⊩ A ∨ B, hence v ⊩ A or v ⊩ B and, either way, s ⊔ v ⊩ C. Then by lemma B.2, t ⊩ C, for all t ⪯P s ⊔ u, and hence s ⊔ u ⊩ C. Distribution: Assume s ⊩ A ∧ (B ∨C), so that s ⊩ A and s ⊩ B ∨C. Assume u ∈ P and u ⪯ s. Then u ⊩ B or u ⊩ C; and, given lemma B.2, u ⊩ A. So either u ⊩ A∧ B or u ⊩ A∧C, and so s ⊩ (A∧ B)∧ (A∧C). Contraposition: Assume s ⊩ A → ¬B but s ⊮ B → ¬A. Then ∃u ⊩ B ∶ s ⊔ u ⊮ ¬A. Then ∃t ⪯P s ⊔ u st t ⊮ ¬A, so tM ⊩ A. So s ⊔ tM ⊩ ¬B. By (C3), there is a v ⪯P u such that t ⪯P s ⊔ v, so by (C4), vM ⪯P s ⊔ tM, so vM ⊩ ¬B, so v ⊮ B, so u ⊮ B. Contradiction. Reductio: Assume s ⊩ A → ¬A but s ⊮ ¬A. Then sM ⊩ A, so s ⊔ sM ⊩ ¬A. We also have sM ⪯ sM ⊔ sM (reexivity and idempotence of ⊔), hence s ⪯ s ⊔ sM (by C4 and sMM = s), and so (by B.2) s ⊩ ¬A: contradiction. ∎ Denition 5 (Deduction and Theories). Γ ⊢R A just in case there is a nite sequence of sentences A1, . . . ,An where A = An and each Ai≤n is either in Γ, or the conjunction of some previous Aj,Ak (i.e. j, k < i), or for some Ak<i, we have Ak → Ai ∈ R. A theory T is any set of sentences closed under deduction: if A ∈ T and Γ ⊢R A then A ∈ T . A theory is prime iff either A ∈ T or B ∈ T whenever A∨ B ∈ T . TR and PR are the sets of all theories and all prime theories, respectively. This denition of deduction is not the classical one, for we must ensure that theorems are not automatically derivable from any premises. We do not have B ⊢R A → A, for example, even though A → A is valid. Lemma C.2 (Prime theories). Assume that Γ is closed under disjunction and T is a theory which does not intersect Γ. Then there is a prime theory T+ ⊇ T which does not intersect Γ. Proof: A standard syntactic result for theories in R; see, e.g., Fine 1974. ∎ Denition 6 (Canonical model). The canonical modelMR is a tuple ⟨TR,PR,R,⊑R,⊇,MR,V+R ,V − R ⟩ where TR, PR, and R are as above and: • S ⊔R U = {B ∣ ∃A ∈ U ∶ A → B ∈ S}; set S ⊑R U iff S ⊔R U = U 21 • For S ∈ PR, SMR = {A ∣ ¬A ∉ S} • V+R S = {p ∣ p ∈ S} • V−R S = {p ∣ ¬p ∈ S} The canonical model deviates from our philosophical characterisation in that (i) MR here is none other than the standard canonical model Routley star and (ii) we model determination using the converse of set inclusion. Nevertheless, the approach meets the the formal requirements on a model and greatly simplies the completeness proof. Lemma C.3 (Theory heredity). A ∈ S iff, for all prime U ⊇ S, A ∈ S. Proof: Left-to-right is trivial. For right-to-left, assume A ∉ S, and let Γ = {B ∣ B ⊣⊢R A}. Then Γ is disjunction-closed (since A ⊣⊢R A∨ A) and Γ ∩ S = ∅. So by lemma C.2, there is a prime U ⊇ S such that Γ∩U = ∅, hence A ∉ U. Contraposing, if A ∈ U for all U ⊇ S then A ∈ S. ∎ Lemma C.4. MR is a model. Proof: We need to demonstrate that each of (C1)–(C6) hold ofMR: (C1) We must show that (i) ⊑R is a partial order on TR; (ii) R is its minimal element; and (iii) S ⊔R U ∈ TR for every S,U ∈ R. (i): A standard proof (e.g. Dunn and Restall 2002) shows that the permutation, prexing, and contraction axioms guarantee that ⊔R is commutative, associative, and idempotent. It is then a standard result of order theory that dening S ⊑R U iff S ⊔R U = U results in a partial order. (ii): If A ∈ S then, since A → A ∈ R, we have A ∈ R ⊔R S. If A ∈ R ⊔R S then B → A ∈ R for some B ∈ S. Then B ⊢R A (denition 5) and so, since S is a theory (denition 5), A ∈ S. So R ⊔R S = S and hence R ⊑R S for every state S. (iii): This requires that each S ⊔R U is a theory (by denition 5's lights), which is a standard syntactic result (e.g. Fine 1974). (C2) Clearly ⊇ is a partial order; we show it distributes over ⊔R. Suppose S ⊇ U and A ∈ U ⊔ T . Then for some B ∈ U, B → A ∈ T and B ∈ S, hence A ∈ S ⊔ T . So S ⊔ T ⊇ U ⊔ T . (C3) Suppose S ⊇ T ⊔U and S is prime, and let Γ = {A ∣ ∃B ∉ S ∶ A → B ∈ U}. To show Γ is closed under disjunction, suppose A1,A2 ∈ Γ. Then there are B1,B2 ∉ S such that A1 → B1,A2 → B2 ∈ U. Since A1 → B1,A2 → B2 ⊢R A1 ∨ A2 → B1 ∨ B2 and U is ⊢R-closed, we have A1 ∨ A2 → B1 ∨ B2 ∈ U. Since S is prime, B1 ∨ B2 ∉ S, hence A1 ∨ A2 ∈ Γ. Moreover, Γ does not intersect T . For if there were any A ∈ Γ ∩ T then, by denition, there would be some B ∉ S such that A → B ∈ U, hence B ∈ S: contradiction. So, by lemma C.2, there is a prime theory T+ ⊇ T which also does not intersect Γ. Now suppose B ∈ T+ ⊔U. Then there is an A ∈ T+ such that A → B ∈ U, hence B ∈ S (else Γ and T+ would intersect) and so T+ ⊔U ⊆ S. 22 (C4) Suppose S,U ∈ P, S ⊇ T ⊔U and A ∈ T ⊔ SM. Then for some B ∈ SM, B → A ∈ T and hence, given contraposition, ¬A → ¬B ∈ T . B ∈ SM implies ¬B ∉ S, hence ¬B ∉ T ⊔U. Then ¬A ∉ U (else we get ¬B ∈ S), hence A ∈ UM, and so UM ⊇ T ⊔ SM . (C5) Trivial, given lemma C.3. (C6) We show that, for all s ∈ P: (i) SMM = S; (ii) p ∈ V+s iff p ∉ V−sM; and (iii) p ∈ V−s iff p ∉ V+sM. We use the fact that A ⊣⊢R ¬¬A and so, since S is a theory, ¬¬A ∈ S iff A ∈ S. For (i): A ∈ SMRMR iff ¬A ∉ SMR iff ¬¬A ∈ S iff A ∈ S. For (ii): p ∈ V+R S iff p ∈ S iff ¬¬p ∈ S iff ¬p ∉ S MR iff p ∈ V−R S MR . For (iii): p ∈ V−R S iff ¬p ∈ S iff p ∉ S MR iff p ∉ V+R S MR . ∎ Lemma C.5 (Truth). For any state S inMR: S ⊩ A iff A ∈ S. Proof: By induction on A. The base case is given by the denition of V+R ; so assume the result holds for all B less complex than A and consider these cases: • A ∶= ¬B. S ⊩ ¬B iff U ⊩ ¬B for all prime U ⊇ S (lemma B.2) iff UMR ⊮ B for all prime U ⊇ S (corollary B.5) iff B ∉ UM for all prime U ⊇ S (by hypothesis) iff ¬B ∈ U for all prime U ⊇ S (denition of MR) iff ¬B ∈ S (lemma C.2). • A ∶= B ∧C. S ⊩ B ∧C iff S ⊩ B and S ⊩ C iff B ∈ S and C ∈ S (by hypothesis) iff B ∧C ∈ S (since B,C ⊢R B ∧C). • A ∶= B → C. S ⊩ B → C iff ∀U ⊩ B ∶ S ⊔R U ⊩ C iff ∀U ∋ B ∶ C ∈ S ⊔R U (by hypothesis) iff B → C ∈ S (by denition of ⊔R). ∎ Theorem C.6 (Completeness). If ⊧ A then A ∈ R. Proof: By contraposition. Assume A ∉ R. Then by lemma C.5, R ⊮ A inMR. and, by lemma C.4, ⊭ A. ∎ Denition 7 (Closed models). A model is closed when, for any of its states s, u: s ⊔ u ⊩ A if s ⊩ A and u ⊩ A. A is valid on the class of closed models, ⊧C A, when ◽ ⊩ A in every closed model. Theorem C.7. RM is sound and complete on the class of closed models: A ∈ RM iff ⊧C A. Proof: For soundness: suppose s, u ⊩ A in a closed model M. By closure, s ⊔ u ⊩ A, hence s ⊩ A → A and so ◽ ⊩ A → (A → A). For completeness, we show that the canonical model formed from RM in place of R is closed. Suppose S andU are RM-theories, each containing A. Since A → (A → A) is a theorem, A → A ∈ S. By construction, S ⊔RM U = {B ∣ ∃A ∈ U ∶ A → B ∈ S} and so A ∈ S ⊔RM U. ∎ 23 References Anderson, A. and Belnap, N. (1962). Tautological entailments, Philosophical Studies 13(1): 9–24. Anderson, A. and Belnap, N. (1963). First degree entailments, Mathematische Annalen 149(4): 302–319. Armstrong, D. (1997). A World of States of Affairs, Cambridge University Press, Cambridge. Berto, F. and Restall, G. (2018). Negation on the australian plan, Journal of Philosophical Logic . Church, A. (1951). The weak positive implication calculus, Journal of Symbolic Logic 16: 238. Dunn, J. (1966). The Algebra of Intentional Logics, PhD thesis, University of Pittsburgh. Dunn, J. and Restall, G. (2002). Relevance logic, in D. Gabbay and F. Guenthner (eds), Handbook of Philosophical Logic, second edn, Vol. 6, Kluwer Academic, Dordrecht, pp. 1–136. Fine, K. (1974). Models for entailment, Journal of Philosophical Logic 3(4): 347–372. Fine, K. (1976). Completeness for the semilattice semantics with disjunction and conjunction (abstract), Journal of Symbolic Logic 41(2): 560–560. Fine, K. (2014). Truth-maker semantics for intuitionistic logic, Journal of Philosophical Logic 43(2–3): 549–577. Fine, K. (2017a). A theory of truth-conditional content I: Conjunction, disjunction and negation, Journal of Philosophical Logic 46(6): 625–674. Fine, K. (2017b). A theory of truth-conditional content II: Subject-matter, common content, remainder and ground, Journal of Philosophical Logic 46(6): 675–702. Fine, K. (2017c). Truthmaker semantics, in B. Hale, C. Wright and A. Miller (eds), A Companion to the Philosophy of Language, Blackwell, pp. 556–577. Forrest, P. (2002). Nonclassical mereology and its application to sets, Notre Dame Journal of Formal Logic 43(2): 79–94. Mares, E. (2004). Relevant Logic: A Philosophical Interpretation, Cambridge University Press, Cambridge. Mares, E. (2009). Relevance and conjunction, Journal of Logic and Computation p. doi:10.1093/logcom/exp068. Mares, E. D. (1996). Relevant logic and the theory of information, Synthese 109(3): 345– 360. Moh, S.-K. (1950). The deduction theorems and two new logical systems, Methodos 2: 56–75. 24 Orlov, I. E. (1928). The calculus of compatibility of propositions, Matematicheskii Sbornik 35: 263–286. Prior, A. N. (1949). Determinables, determinates and determinants, Mind 58(229): 1–20. Restall, G. (1995). Information ow and relevant logics, in J. Seligman and D. Westerståhl (eds), Logic, language and computation: The 1994 Moraga Proceedings, CSLI Press, pp. 463–477. Restall, G. (1999). Negation in relevant logics: How I stopped worrying and learned to love the routley star, in D. Gabbay and H. Wansing (eds), What is Negation?, Vol. 13 of Applied Logic Series, Kluwer, pp. 53–76. Restall, G. (2004). Relevant and substructural logics, Handbook of the History of Logic: Logic and the modalities in the twentieth century, North-Holland, pp. 289–398. Rodriguez-Pereyra, G. (2006). Truthmaking, entailment, and the conjunction thesis, Mind 115(460): 957–982. Routley, R. (1984). The american plan completed: Alternative classical-style semantics, without stars, for relevant and paraconsistent logics, Studia Logica 43(1): 131–158. Routley, R. and Meyer, R. (1972a). The semantics of entailment II, Journal of Philosophical Logic 1: 53–73. Routley, R. and Meyer, R. (1972b). The semantics of entailment III, Journal of philosophical logic 1: 192–208. Routley, R. and Meyer, R. (1973). The semantics of entailment I, in H. Leblanc (ed.), Truth, Syntax, and Semantics, North-Holland, Amsterdam, pp. 194–243. Urquhart, A. (1972a). Semantics for relevant logics, Journal of Symbolic Logic 37(1): 159– 169. Urquhart, A. (1972b). The Semantics of Entailment, PhD thesis, University of Pittsburgh. van Fraassen, B. (1969). Facts and tautological entailments, Journal of Philosophy 66(15): 477–487. Wilson, J. (2017). Determinables and determinates, in E. Zalta (ed.), The Stanford Encyclopedia of Philosophy, https://plato.stanford.edu/entries/determinatedeterminables/.