OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 7. Composition as General Identity A aron J . C otnoir What is the relationship between a whole and its parts taken together? David Lewis famously claimed, 'They are it. It is them' (1991, 83). In almost the next breath, however, he retracts his claim and 'rests content with mere analogy' (1991, 84, fn. 12). Why did Lewis reject the strong claim that composition just is identity in favor of the weaker claim that composition is a lot like identity? 1 He did so because, like many others, he could not make sense of strong composition as identity. In particular, he had two main obstacles. He writes: In the fi rst place, I know of no way to generalize the defi nition of ordinary one-one identity in terms of plural quantifi cation. (87) In other words, he could see no good way of making sense of manyone identity. If we cannot make sense of many-one identity, and the parts are many while the whole is one, then it appears that composition as identity is unintelligible. Moreover, Lewis suggests: And in the second place, . . . still we do not really have a generalized principle of the indiscernibility of identicals. It does matter how you slice it . . . What's true of the many is not exactly what is true of the one. (87) The whole may have properties lacked by its parts taken together; the parts may have properties lacked by the whole. And the failure of the indiscernibility of identicals leads us to believe that the relation between a whole and its parts is not identity after all. The aim of this chapter is to formalize (a version of) composition as identity, addressing these obstacles. In section 1, I address a challenge present in Lewis but made most explicit by van Inwagen (1994) -the syntactic challenge -by appealing to free relatives in English as operators that shift syntactic number while leaving 1 I will follow Yi's (1999) usage of strong composition as identity for the identity claim, and weak composition as identity for the 'a lot like identity' claim. 0001988544.INDD 294 6/13/2013 3:56:59 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 295 semantic number fi xed. In section 2, I respond to Lewis's fi rst obstacle: the semantic challenge . I start by giving a heuristic set-theoretic model of one interpretation of many-one identity, and then show how this identity relates to other standard notions like plural identity and parthood. In section 3, I address Lewis's second obstacle: the discernibility challenge . I utilize two cover-based semantics for collective, distributive, and cumulative predication in plural logics that require no restrictions on the indiscernibility of identicals. This shows that the general identity relation given in section 3 is a genuine form of identity . In section 4, I show how this theory avoids recent arguments from Sider ( 2007 ). The result is an intelligible version of the thesis that composition is identity. I close with an appendix providing technical results. 1. SYNTAX, SEMANTICS, AND IDENTITY Those who endorse strong composition as identity commit to the following two identity claims: 2 (1) The fusion of them i is them i (2) They i are the fusion of them i Lewis's fi rst challenge is to make sense of the one-many and manyone identity relations expressed in (1) and (2). 3 But it is unclear how to make sense of such a hybrid 'is/are' identity predicate in English. The standard distinction between the syntax of a language and the semantics of a language reveals that there are really two challenges present here. Let us label them as follows. syntactic challenge Is there any way to make syntactic sense of an identity predicate that takes a plural term and a singular term in each of its argument places? semantic challenge Is there any way to make semantic sense of an identity relation such that many things are identical to one thing? The fi rst question is fundamentally about the structure of language while the second is primarily about the referents of terms and the 2 See Lewis ( 1991 ). Indexes will be used to facilitate cross reference. 3 The concept of 'many-one identity' is due to Don Baxter ( 1988 ). 0001988544.INDD 295 6/13/2013 3:56:59 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 296 | Aaron J. Cotnoir 4 Thanks to Einar Bøhn, Jon Litland, and Andreas Fjellstad here. relations between those entities. The one is a question for linguists, the other for metaphysicians. But philosophers have been concerned along syntactic lines. van Inwagen ( 1994 ) has argued that strong composition as identity theorists cannot use English to grammatically state their own view. There is the 'is' of (singular) identity. This word makes syntactical sense when it is fl anked by singular terms and variables . . . There is the 'are' of (plural) identity. This word makes sense when it is fl anked by plural terms and plural variables . . . But what kind of syntactical sense is there in taking either the 'is' or 'are' and putting a singular term or variable on one side of it and a plural term or variable on the other? (210–11) The thrust of the objection is that such sentences are syntactically unacceptable in English. Sider ( 2007 ) fl ags the syntactic challenge as well. But now there is a problem. Given the truth of 'Ted = h , a , l , and t ' and 'Ted is human', [Leibniz's] Law apparently implies that ' h , a , l , and t is human' is true. This sentence is ungrammatical; the logic/English hybrid we are now speaking at best allows ' h , a , l , and t are human' . . . Grammatical revisionism was perhaps already in place right at the start. (57) Sider's response to the concern is to move to a formal language without the singular-plural distinction-in effect, a one-sorted plural fi rst-order language. I, with Sider, am happy to regiment the theory in a formal language that allows for such peculiarities. It is worth noting, however, that whether van Inwagen's and Sider's claims are correct depends heavily on the results of the best theories of agreement in the syntax of English. Thus, the syntactic challenge strikes me as an empirical question for linguists to answer, not a challenge that can be leveled from the armchair. Moreover, it is unclear why-apart from linguistic prejudice-we should only be concerned with the syntactic constraints of English . In other natural languages (e.g. Nordic languages), the construction is perfectly syntactically acceptable. For Norwegian, the verb meaning to be ('vaere') is conjugated the same (present tense: 'er') for both singular and plural noun phrases. 4 But let's not dismiss the syntactic challenge so quickly. As it turns out, some linguists and philosophers of language think that such semantically hybrid constructions exist in English, too. 0001988544.INDD 296 6/13/2013 3:56:59 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 297 1.1. Singular, plural, many, one Consider the following two distinctions: syntactically plural vs syntactically singular , and semantically plural vs semantically singular . An English term is syntactically plural if it is morphologically plural, and syntactically singular if it is morphologically singular. The syntactic difference between singular and plural morphemes often takes the form of different endings (e.g. 'fungus'; 'fungi') and usually requires different verb conjugation (i.e. 'The dog barks.'; 'The dogs bark.'). The basic idea is to take singular and plural morphemes of the same lexeme; but the idea extends to pronouns and other noun phrases as well (e.g. 'it'; 'them'). Also, let a term be semantically plural if the referent of the term is more than one object, and let it be semantically singular if the referent is only one object. Of course, the main topic of this chapter is tied up with controversies over what counts as one object and what counts as more than one object. Needless to say, whether a given term is semantically plural or singular may be controversial. It may even be controversial as to whether there is any mind-independent fact of the matter as to whether the referent of a term is many or one . It might come as a surprise if syntactic number and semantic number were perfectly aligned. Unsurprisingly, the distinctions cut across each other. We can fi nd examples-perhaps not uncontroversial ones-of syntactically plural terms that are semantically singular. Consider 'scissors' and 'pants'. Both have morphologically plural endings, conjugate plurally ('The scissors are sharp.'; *'The scissors is sharp.'), and yet putatively refer to a single thing. 5 It may be noted that 'scissors' and 'pants' are linked to constructions like 'pair of scissors' and 'pair of pants', which are syntactically singular. But this simply reinforces the conclusion that, in English, we may use syntactically singular and plural constructions to refer to the very same thing(s). Likewise, we can fi nd examples of syntactically singular terms that are semantically plural. Consider 'clothing', 'furniture', and 'jury'. These terms are morphologically singular, conjugate singularly ('The furniture is Federal.'; *'The furniture are Federal.'), and yet each of them refer to many things. 6 5 Thanks to Leo Iacono for suggestions here. 6 But see Laycock ( 2006 ) for a view according to which some of these terms refer neither singularly, nor plurally. See also Uzquiano ( 2007 ) for a view according to which some of these terms are semantically singular. 0001988544.INDD 297 6/13/2013 3:57:00 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 298 | Aaron J. Cotnoir The fact that these distinctions cut across each other may be displayed in other ways. In British English, verb conjugation is sometimes keyed to semantic number rather than syntactic number. Consider the headlines 'Arsenal win by one' or 'Parliament disagree on proposal'. Even American academics tend to fi nd both of the following sentences syntactically acceptable: 'The faculty try hard not to fi ght.' and 'The faculty tries hard not to fi ght.' Likewise, when asked 'Where is the jury?', it would appear perfectly acceptable to respond 'They are still deliberating'. 7 If these examples are unconvincing, the reader is welcome to think of others. The idea that semantic number and syntactic number have some independence from one another does not by itself address the syntactic challenge to composition as identity. However, this fact, combined with an additional claim does address the objection. The claim: English has the resources for syntactic singularization of semantically plural terms. 1.2. Singularization in natural language I do not intend to undertake a full defence of this claim here. I take this to be an empirical question, not suitably answered by philosophical refl ection. However, I will say a few things by way of explanation and point to some linguistic evidence. The rough idea is that English speakers have the linguistic resources to singularly refer to many things whenever they can plurally refer to those things. Phillipe Schlenker ( MS ) has argued that even though plurals are explicitly morphologically typed, they are badly typed. He suggests that a certain kind of defi nite description-called a free relative -behaves as a type-shifting mechanism transforming plurals into singular terms. A natural suggestion, then, is that what -descriptions provide the missing link because they are . . . morphologically singular and yet, in a sense, semantically plural. (11) Consider Schlenker's example of a what -description compared to standard defi nite description. 7 Thanks to Sam Wheeler, John Troyer, and Marcus Rossberg for suggestions here. 0001988544.INDD 298 6/13/2013 3:57:01 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 299 (3) I bought some things. The things I bought *was/were expensive. (4) I bought some things. What I bought was/*were expensive. Contrary to usual defi nite descriptions, the what -description triggers singular verb agreement. 8 But the referent of 'what I bought' is not one of the things. After all, each of the things may be relatively inexpensive individually but collectively expensive nonetheless. The referent is not the set of things; sets are abstracta and are not expensive. Given the appearance that (3) and (4) have the same semantic content, Schlenker plausibly suggests that the referent of 'what I bought' is the things themselves. Oliver and Smiley ( 2008 ) also address free relatives from a plural perspective. They independently note the same phenomenon. 9 Consider one of their examples: 'I took what they offered me' is tantamount to 'I took the things they offered me'. (29) Here they appeal to the fact that sentences involving free relatives and parallel sentences involving plurals have the same semantic content. Now, fi nally, we can substantiate the claim that English has resources to singularize syntactically plural terms while maintaining plural reference. 10 singularization For any syntactically plural term xx , there is some syntactically singular term 'what they xx are identical to' such that the referent of xx is the same as the referent of 'what they xx are identical to'. singularization is the conclusion of some linguists. As mentioned, the claim of singularization with respect to the resources of 8 The what -description is not the standard defi nite description operator; nor is it a plural defi nite description operator. See Rayo ( 2002 , 446) for a defi nition of plural defi nite descriptions; or for a more general account, see Sharvey ( 1980 ). 9 They give three readings of free relatives, and each reading displays the same phenomenon of syntactic singularization. The example that follows is intended as an example of the defi nite reading. 10 It should be noted that, when combined with unrestricted comprehension for plural terms, singularization is inconsistent in classical logic. See Schlenker ( MS , 10). But plural comprehension will already have to be restricted for composition as identity theorists, due to confl icts with Cantor's theorem. It is an interesting additional question as to whether more restrictive versions of plural comprehension combined with singularization are classically consistent. One version is given in the Appendix 1 . For more discussion, see Saucedo ( Unpublished ). 0001988544.INDD 299 6/13/2013 3:57:02 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 300 | Aaron J. Cotnoir English is ultimately empirical. But if correct, it can be used to formulate a syntactically unobjectionable version of the one-many identity claim in (1) and the many-one identity claim in (2). (5) The fusion of them i is what they i are identical to. (6) What they i are identical to is the fusion of them i Given Singularization , 'what they i are identical to' is a syntactically singular term with semantically plural reference. 'The fusion of them i ' is both syntactically and semantically singular. So, what we have, from a syntactic point of view, is a singular-singular identity statement. There is no grammatical abnormality. From a semantic point of view, however, we have a full-blown many-one identity claim. This response to the syntactic challenge is dependent on a theory of plurals that has not been given a full defence. Nonetheless, I have highlighted a (possibly true) linguistic theory according to which many-one identity claims are perfectly grammatical in English. 2. MANY-ONE IDENTITY We now turn in earnest to the semantic challenge that concerned Lewis. He writes: I know of no way to generalize the defi nition of ordinary one-one identity in terms of plural quantifi cation. We know that x and y are identical iff, whenever there are some things, x is one of them iff y is one of them. But if y is the fusion of the xx , then there are some things such that each of the xx is one of them and y is not; and there are some things such that y is one of them but none of the xx is. (1991, 87) Lewis is here registering the complaint that the ordinary plural definition of identity in terms of the is-one-of relation does not extend to a many-one identity relation. On the standard semantics of identity, a singular (one-one) identity claim like ' a = b ' is true if and only if ' a ' and ' b ' denote the same object. Plural (many-many) identity can be defi ned in terms of the 'is-one-of' predicate, thus: ' aa = bb ' is true if and only if for all x , x is one of aa if and only if x is one of bb . Intuitively, an identity claim is true exactly if the terms on either side of the identity symbol denote the same object(s). How can this be generalized to many-one identity? 0001988544.INDD 300 6/13/2013 3:57:03 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 301 As should be apparent, the standard treatment of identity as sameness of reference will not work. Take a many-one identity claim like ' aa = b '. If ' aa ' is a semantically plural term, its referent will be many things; and in order for the identity to hold, the referent of ' b ' would have to be those same things. But that contradicts the supposition that ' b ' is semantically singular. If the discussion in section 1.2 is correct, then ' b ' may be semantically plural even if syntactically singular, but even then this will not be a satisfactory solution to the semantic problem. So we need some other semantic treatment of many-one identity, preferably one that describes some more general phenomenon that has many-many and one-one identity as a special case. For this task, I construct a set-theoretic interpretation of a generalized identity relation that gives the right results. I do not, however, mean to be assuming the ontology of the semantics. For those with ontological qualms about using set theory for semantics, the semantics could be done using hyperplurals; but given the relative unfamiliarity with higherorder plural quantifi cation, the set-theoretic interpretation will serve as a useful guide. 11 The reader should beware of reading additional ontological commitments into the set-theoretic discussion. In order to take many-one identity seriously, we need to suppose that we can refer to a portion of the world singularly or plurally, and that our way of referring to this portion of the world does not change the fact that it is the same portion either way. The intuitive pull behind composition as identity is the thought that we may 'carve up' reality however we like. But no matter whether we carve a portion of it as one individual or many, it is still the same bit of reality. Compare Lewis ( 1991 ): Take them together or take them separately, [they] are the same portion of reality either way. (81) And recall Frege, who in the Foundations of Arithmetic (1980) claimed: If, in looking at the same external phenomenon, I can say with equal truth 'This is a copse' and 'These are fi ve trees', or 'Here are four companies' and 'Here are fi ve hundred men', then what changes here is neither the individual nor the whole, the aggregate, but rather my terminology. (Section 46) 11 For a semantics of hyperplurals that could be adapted for this purpose, see Rayo ( 2006 ). 0001988544.INDD 301 6/13/2013 3:57:04 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 302 | Aaron J. Cotnoir They are 'the same external phenomenon'; the fi ve trees are the copse. What we want, then, is a way of modeling the concept of being 'the same external phenomenon' via ways of carving up the world. To model this, we start with a set A of objects. You may think of them as atoms. 12 Recall, the intuitive idea behind many-one identity is that identities are insensitive to our ways of counting things. In other words, what there is , and hence what is generally identical to what, does not depend on our practices of counting. A simple way of modeling this phenomenon is to look at all partitions of A . PARTITION A set P of non-empty sets is a partition of A if: (i) P covers all of A (i.e. ⋂ P = A ); and (ii) the members of P are pairwise disjoint (i.e. pi ∩ jp = ∅ for any ip and jp in P s.t. i j≠ ). Partitions are essentially ways of counting a domain. 13 Condition (i) guarantees that in any count every portion of reality gets included in the count (even if not as a single thing). Condition (ii) rules out counting the same external phenomenon more than once; it is a prohibition against 'double counting'. 14 How is this useful? A partition carves up reality into chunks or portions; it treats all the atoms in the same portion as a single thing . Partitioning a domain is a way of carving up reality into individual objects-a 'way of counting'. Different partitions might carve up a subset of A as one chunk, or many chunks. But whether treated as one or many, it is still the same subset of A -it is still the same underlying portion of reality. We can express a relation on A via a binary predicate ~. Where x and y are singular terms (or variables), x is the denotation of x , and π is any partition on A : 12 You may think of them as atoms, but one needn't think of them as atoms. (Whether composition as identity is committed to atomism is an interesting question, but beyond the scope of this chapter.) Another possible interpretation-to be explored in future work-is to think of them merely as propertied spacetime points. I largely leave the underlying metaphysics open, since the semantic approach endorsed here is compatible with a number of metaphysical views. 13 They are, roughly, a formalization of Baxter's ways of counting . See (1988). 14 For justifi cation of the 'no double counting' view of ontological commitments, see Baxter (1988) and Varzi (2000) . See also the discussion in what follows. 0001988544.INDD 302 6/13/2013 3:57:05 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 303 EQUIV x ~ y is true iff x is in π and y is in π. The predicate ~ expresses (roughly) the relation of being in the same count ; that is, it is true of some things whenever there is a way of counting the world that includes both objects. As a consequence of condition (ii), some objects can never be in the same count. Keeping the same intended meaning, we can generalize ~ to take plural terms on either side as well. We now let singular terms x , y , z and plural terms xx , yy , zz range over members of partitions on A . So, a singular term x has a denotation x that is a chunk of atoms. A plural term xx has a denotation xx that is a set of chunks of atoms under the same partition . That is, we do not allow a given plural term to simultaneous refer to members of different partitions; xx must always refer under the same 'way of counting'. 15 We now have the tools to give a heuristic account of a generalized identity predicate, ≈. 16 Where xx is a subset of partition π on A and yy is a subset of a (possibly distinct) partition π' on A , MANY-MANY xx ≈ yy is true iff yyxx =∪ ∪ MANY-ONE xx ≈ y is true iff yxx =∪ ONE-MANY x ≈ yy is true iff x yy= ∪ ONE-ONE x ≈ y is true iff x y= Now, ≈ is a general notion of identity that holds between portions of reality independent of our ways of counting it. 17 In short, it does not matter how we partition the domain, whether we count it as one or many, it is still the same portion either way. 15 This restriction amounts to a restriction on plural comprehension, and is necessary for cardinality reasons. Moreover, see the previous discussion of plural comprehension in footnote 10. 16 For ease of explication, I will call this notion 'general identity' in what follows. Whether this is really a kind of identity will be addressed in section 3. I will use the term 'numerical identity' to refer to the standard singular and plural notions. 17 Indeed, set union ∩ is used to collapse the partitioned subset into a subset of atoms. Alternatively, one could use mereological fusion; however, doing so would be question-begging on a number of grounds. One major reason is that set union is unrestricted, and I do not want to suppose that composition as identity is committed to unrestricted mereological composition. On a hyperplural semantics neither set union nor fusion operators of any kind are required. 0001988544.INDD 303 6/13/2013 3:57:09 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 304 | Aaron J. Cotnoir It is worth noting that the many-many version of ≈ is not the standard notion of plural identity as defi ned by aa = bb iff for every x , x is one of the aa iff x is one of bb . There may be two ways of counting a portion of reality as many. Consider, for example, a black-and-white tile fl oor patterned in such a way that tiles are grouped into larger squares of the same colour. On one way of counting, there are just the many tiles; on another, there are the black squares and the white squares; on a third way of counting, there is just the tile fl oor. The fi rst two ways of counting treat the fl oor as many . They are different partitions in the sense that the tile count is fi ner than the square count. But the many tiles are identical to the many squares. Notice, however, that it simply is not the case that for any x , x is one of the tiles if and only if x is one of the squares. In fact, none of the tiles are among the squares, and none of the squares are among the tiles. However, the many-many version of ≈ is not inconsistent with ordinary plural identity. In fact, the many-many version just is ordinary plural identity whenever xx and yy refer to members of the same partition. In other words, we can recover ordinary plural identity via the following defi nition. PLURAL IDENTITY ~dfxx yy xx yy xx yy= ≡ ∧ ≈ Thus, many-many may be a relation between objects in different counts-a cross-count identity relation-or a relation between objects within a count-an intra-count identity relation. 18 If manymany is intra-count , it is just the standard plural identity relation. By contrast, the true many-one and one-many identity claims are always cross-count . The true one-one identities are always intracount , and in this case amount to just the standard fi rst-order identities. 19 General identity given by ≈ can be generalized further. ARE-COVERED-BY xx ≾ yy is true iff ⋃ ⊆ yyxx ARE-PARTS-OF xx ≾ y is true iff ⋃ ⊆ yyxx 18 Again, these distinctions were fi rst made by Don Baxter (1988) . 19 This is a slight simplifi cation. Both one-one and many-many identities can be cross-count whenever the objects denoted are in the intersection of the two partitions. This is refl ected in the full semantics in Appendix 1 . 0001988544.INDD 304 6/13/2013 3:57:18 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 305 IS-COVERED-BY x ≾ y is true iff ⊆x ⋃ yy IS-PART-OF x ≾ yy is true iff ⊆x ⋃ yy The connection between ≾ and ≈ can be exploited yielding the following defi nition: xx ≈ yy ≡ df xx ≾ yy ∧ yy ≾ xx . Parallel defi nitions hold for the many-one , one-many , and one-one cases. Again, and for similar reasons, are-covered-by is not the same relation as the standard plural relation 'are-among'; it is more like the relation 'help compose'. When xx and yy are interpreted by the same partition, however, the difference collapses. The standard plural 'are-among' relation is intra-count , whereas ≾ may be either cross-count or intra-count . Likewise, is-covered-by reduces to the standard plural 'is-one-of' relation only if x and yy are interpreted by the same partition. If not, then it is more like the relation 'helps compose'. Again, the standard notions can be recovered in a straightforward way: PLURAL ARE-AMONG xx ⪯ yy ≡ df xx ~ yy ∧ xx ≾ yy PLURAL IS-ONE-OF x ⪯ yy ≡ df x ~ yy ∧ x ≾ yy These relations behave exactly like the plural logic versions. Plurals are extensional in the sense that z ⪯ xx iff z ⪯ yy implies xx = yy , where = here is the intra-count plural identity relation defi ned earlier. 20 Plurals are also comprehensive in the sense that every subset of our set of atoms A is denoted by some plural term. Moreover, a stronger result holds: for every possible partition on A , there is a plural term that denotes each subset of that partition. 21 The composition as identity theorist can also recover other standard notions. is-part-of is very much like the standard mereological parthood relation. Recall that a partition is simply a way of counting. If we are not picky about ways of counting-that is, if we allow all possible partitions as admissible ways of counting- then the one-one version of ≾ satisfi es all the axioms of atomic 20 This is a consequence of the extensionality of sets used in the model theory. See Appendix 2 . 21 Again, this is a consequence of the model theory; see Appendix 1 . They are not , however, comprehensive in the sense that every subset of the domain of all objects (e.g. all things referred to by a term) is represented by a plural term. Again, this is mainly for cardinality reasons involving Cantor's theorem. See footnotes 11 and 16. 0001988544.INDD 305 6/13/2013 3:57:21 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 306 | Aaron J. Cotnoir classical extensional mereology. 22 The most detailed way of counting-the fi nest partition-yields all the atoms; the least detailed way of counting-the coarsest partition-yields the whole universe. Intermediary ways of counting may be thought of as different 'levels of decomposition'. If we have a name for the whole universe in our language (say, ), we have a straightforward way of determining whether a plurality is itself a count. Let C be the predicate ' are-a-count ', defi ned as follows. COUNT C ( xx ) ≡ df xx ≈  The fact that xx must be interpreted by the same partition tells us that xx are pairwise disjoint. But since xx ≈  is true, we know that ⋃ =xx  , in which case xx cover the whole universe. Thus, C is true of xx whenever xx are a way of counting the domain of atoms. Composition, then, is many-one cross-count identity given by ≈. In other words, xx compose y iff xx are parts of y and y is covered by xx . It is plain to see that some parts compose a whole whenever those parts and the whole are the same portion of reality counted as many and counted as one , respectively. Moreover, the composition as identity theorist can appeal to standard fi rst-order identity, classical mereology, standard plural identity, and the standard plural 'are-among' and 'is-one-of' predicates, since ≈ and ≾ are straightforward generalizations of these notions. 3. LEIBNIZ'S LAW We now turn to Lewis's discernibility challenge . Lewis writes: [E]ven though the many and the one are the same portion of reality, and the character of that portion is given once and for all whether we take it as many or take it as one, still we do not really have a generalized principle of the indiscernibility of identicals. It does matter how you slice it -not to the character of what's described, of course, but to get the form of the description. What's true of the many is not exactly what is true of the one. (1991, 87) Lewis appears to be right. Consider again the example of the tiled fl oor. The tiles are identical to the black and white squares. But it is 22 The proof is in Appendix 2 . 0001988544.INDD 306 6/13/2013 3:57:24 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 307 23 For a start, see Lewis (1991, p. 84), Sider (2007, 55, footnote 12), and Varzi (2000, 285). The lone exception appears to be Yi (1999, endnote 13). 24 For details, see (1999). true of the tiles that they are tiles , whereas the black or white squares are not tiles -they are merely composed of tiles. While it is true of the black and white squares that they are squares , those squares could be made up of triangular tiles, which obviously are not squares . It does matter how you slice it. But if we do not have the indiscernibility of identicals, we do not really have identity. Compare Sider (2007) : Defenders of strong composition as identity must accept Leibniz's Law; to deny it would arouse suspicion that their use of 'is identical to' does not really express identity. (57) In short, the challenge is as follows: discernibility challenge Is there any way to make sense of an identity predicate that engenders widespread failures of Leibniz's Law? That is, if the truth of xx ≈ yy does not imply that every predicate P is such that P ( xx ) is true if and only if P ( yy ) is true, then how does '≈' express anything like identity ? I claim that the discernibility challenge can be met. The solution involves cover-based semantics for distributive, collective, and cumulative predication in plural logics that require no restrictions on the indiscernibility of identicals. I provide two possible semantics: an indexical approach, and a subvaluational approach. Both versions fully satisfy Leibniz's Law, indicating that the general identity relation expressed by ≈ is legitimately considered a form of identity. Before delving into the semantics, a brief aside. Donald Baxter (1988 , 1999) has long been viewed as the sole defender of strong composition as identity. Virtually every paper published on the topic cites him in this way. 23 But, for the sake of clarity, according to the earlier conception of identity that characterization is mistake. Baxter's view, too, is a form of weak composition as identity as he restricts the indiscernibility of identicals. 24 The theory advanced in section 2 owes a great deal to his original theory given in (1988). While Baxter might well appeal to the semantics for plural predi0001988544.INDD 307 6/13/2013 3:57:25 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 308 | Aaron J. Cotnoir cates considered in section 3.2, it appears he prefers not to characterize identity as essentially involving Leibniz's Law. 3.1. Plural predication Plural logic (in particular plural reference) opens up new ways of predicating. Some plural predication is distributive , where P ( xx ) is distributive iff the truth of P ( xx ) implies the truth of P ( x i ) for each x i among xx . A sentence like 'Tom and Dick are tall' is true iff Tom is tall and Dick is tall. This kind of plural predication is reducible to singular predication. While distributive plural predication can be reduced in this way, other kinds of plural predication cannot. Some plural predication is collective . P ( xx ) is collective iff P ( xx ) is true only of the plurality and not of the individuals. For example, consider a sentence like 'Tom, Dick, and Harry carried the piano', which is true because they carried the piano together ; none of them was capable of doing so individually. One might suggest that English predicates like carried the piano are ambiguous: there are two distinct predicates, one of which is collective ( Carried C ) and the other distributive ( Carried D ). 25 While this proliferates homonymous predicates, it solves the diffi culty in interpreting collective and distributive predication. There is, however, another kind of plural predication, cumulative predication, where P ( xx ) is cumulative when P ( xx ) is true of neither the individual objects, nor the objects collectively, but only of certain 'sub-pluralities'. 26 To clarify, consider an example sentence: 'Rogers, Hammerstein, and Hart wrote musicals'. Now, is this sentence true? Presumably, but the three men never wrote any musicals together. Nor did any of them write any individually. Rogers and Hammerstein wrote musicals together, and Rogers and Hart wrote musicals together. So, we might say the predicate wrote musicals is true of Rogers, Hammerstein, and Hart, but only with respect to certain ways of 'carving up' the plurality. 25 As does Rayo ( 2002, 446). 26 This distinction was made early on by Landman (1989) , following Link. Landman discusses both collective and distributive predication, in addition to what he called 'group' predication. Other authors have called it 'intermediary' predication. 0001988544.INDD 308 6/13/2013 3:57:25 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 309 Are there different homonymous predicates for every possible way of carving up the plurality? Consider the sentence 'The soldiers hit all four targets'. And suppose 'the soldiers' refer to Tom, Dick, and Harry. Do we need distinct predicates distinguishing the case where Tom hit two targets and the others hit only one from the case where Dick hit two and the others each hit one, and so on? Proliferating predicates is not likely to strike many as a natural fi x. Moreover, it appears not to validate some intuitive inferences using them. 27 Many linguists and philosophers of language have rejected this proliferation approach and have taken to interpreting predicates to be true of some individuals with respect to a given cover . 28 What exactly is a cover? COVER A set P of non-empty sets 1 np p... is a cover of A if ... =∪ 1 np p A 29 In other words, covers are just like partitions, but without the disjointness requirement. How does this help? The distributive sentence 'Tom and Dick are tall' is true with respect to the cover {{Tom},{Dick}}. The collective sentence 'Tom, Dick, and Harry carried the piano' is true with respect to the cover {{Tom, Dick, Harry}}. And the cumulative sentence 'Rogers, Hammerstein, and Hart wrote musicals' is true with respect to the cover {{Rogers, Hammerstein},{Rogers, Hart}}. While the 'correct' cover-based semantics for plural predicates is still very much up for debate, I consider two options for semantic clauses: an indexical semantics, and a subvaluational semantics. On an indexical semantics, sentences involving plural predication are true relative to a cover. That is, plural terms may be interpreted by any cover, and the truth or falsity of the sentence varies with the interpretation. Where c is any cover, and cxx is the denotation of xx under that cover, and P is the extension of P : INDEXICAL P ( xx ) is true-underc iff cxx is in P 27 For discussion of these failures in inference, see Oliver and Smiley ( 2008 ). 28 For more on this approach to plural predication, see Gillon ( 1992 ) and Nicolas ( 2008 ). An excellent discussion of cover-based approaches can be found in Schwarzschild ( 1996 ). 29 For our purposes, I interpret covers set-theoretically, but they may be done hyperplurally as well. See Nicolas and Linnebo ( 2008 ) on hyperplural covers. 0001988544.INDD 309 6/13/2013 3:57:25 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 310 | Aaron J. Cotnoir On this approach, covers are additional parameters like contexts, times, or worlds. The truth of a sentence depends directly on the choice of a cover, on whether that choice is appropriate to the denotation of the plural terms. One advantage of this approach is that the very same predicate may be distributive, collective, and cumulative; no proliferation required. It is crucial to note that there is no diffi culty with Leibniz's Law. Imagine we have it that aa = bb is true according to the standard conception of plural identity. Imagine also that a predicate P is true of caa where 1 2{{ , }}c a a= and P is true of cbb where 1 2{{ , }}c b b= . In other words, imagine 1 1a b= and 2 2a b= and P is interpreted collectively. Leibniz's Law yields that the truth of aa = bb implies the truth of ( ) ( )P aa P bb↔ . This is satisfi ed so long as both aa and bb are interpreted under c . It may be noted that if we interpret P ( aa ) via 'caa where 1 2' {{ }, { }}c a a= and keep P ( bb ) interpreted by c , P ( aa ) will be false and P ( bb ) will be true. But this is not a counterexample any more than it would be if we interpreted aa and bb at different times or at different worlds. 30 The upshot is that the indiscernibility of identicals holds; but covers introduce an intensional (opaque) context because they are indexical. For those uneasy with an indexical approach, one could instead use a subvaluational approach to the semantics of plural predication. SUBVALUATIONAL P ( xx ) is true iff there is a cover c , such that cxx is in P Likewise, P ( xx ) is false whenever there is no such cover (thus, avoiding any true contradictions). This semantic clause is not indexical; the truth of P ( xx ) is not relative to any parameters. This approach also does not proliferate homonymous predicates, as the same sentence may be true when used distributively, collectively, or cumulatively. And again, there is no diffi culty with Leibniz's Law. Imagine we have it that aa = bb is true according to the standard conception of plural identity. Let P be true of caa where 1 2{{ , }}c a a= as before. 30 Thanks to an anonymous referee for this suggestion. 0001988544.INDD 310 6/13/2013 3:57:31 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 311 31 Thanks to Michael Della Rocca for alerting me to the importance of this question. Since 1 1a b= and 2 2a b= , we know that there is at least one cover- namely c -making P ( bb ) true. 3.2. Covers and counts We can now address the discernibility challenge by showing how ≈ fully satisfi es the indiscernibility of identicals. The composition as identity theorist is in exactly the same situation as those giving semantics for plural predication. General identity given by ≈ is insensitive to our ways of carving up the domain; the identity of portions of reality is independent of how we count them. Other predicates are sensitive to these carvings. Parthood relations, for the defender of composition as identity, are expressed by predicates sensitive to counts. A singular individual is part of another singular individual only with respect to two different ways of counting- one that treats the part as a singular thing, and another that treats the whole as a singular thing. The one-one version of ≾ is always cross-count . Instead of covers, however, we model this phenomenon using partitions . Recall that partitions are simply covers plus a disjointness requirement. In the case of composition, there is independent reason for the disjointness requirement; Don Baxter ( 1988 ) and Achille Varzi ( 2000 ) argue that for ontological purposes, we ought to avoid 'double counting' certain portions of reality. The composition as identity theorist endorses the 'no double counting' requirement for ontological reasons, but the upshot for Leibniz's Law is no different here. The composition as identity theorist can endorse the indexical semantics above: if xx ≈ yy is true-underc then every predicate P (whether sensitive to counts or not) is such that P ( xx ) is true-underc if and only if P ( yy ) is true-underc . There are no failures of Leibniz's Law provided we do not switch our way of counting 'mid-sentence', as it were. Again, this is not a restriction on the indiscernibility of identicals; 'Socrates is sitting' could be true while 'Socrates is standing' false when interpreted at different times or different possible worlds. It is an interesting question as to why 'ways of counting' introduce intensional contexts. 31 One possible answer: ways of 0001988544.INDD 311 6/13/2013 3:57:42 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 312 | Aaron J. Cotnoir counting are mind-dependent; they are ways of representing the world and not part of the world themselves. Perhaps then, they introduce intensional contexts in a similar way as 'believes that' does. But a full consideration of this question is beyond the scope of this chapter. For those who are not sympathetic to the indexical semantics, we turn to another option. The composition as identity theorist can also endorse a subvaluational semantics; predicates are true of objects just if there is some way of counting the objects such that they have the property expressed by the predicate. Here again, ≈ can be shown to satisfy Leibniz's Law in full. Assume aa ≈ bb and P ( aa ) are true. Then there is a count c such that caa is in the extension of P . But since ⋃ =aa ⋃bb, it follows that cc aabb = . Hence, there is also a partition of bb - namely c -such that cbb is in the extension of P . Thus, P ( bb ) is true. Regardless of which semantics is preferred by the composition as identity theorist, I consider the discernibility challenge to be surmountable. The relation given by ≈ is a genuine identity relation. Let me close this section with an interesting aside. (What remains of this section is tangential to the main arguments of this chapter and should be regarded as a more speculative line of thought for future research.) It is interesting to note that there may also be predicates P i true of a portion of reality regardless of our way of counting. So, for these count-insensitive predicates, an additional supervaluational semantic clause may be appropriate. SUPERVALUATIONAL P i ( xx ) is true iff for any count c , cxx is in P As in the case of predication in plural logic, this clause would be inappropriate for most predicates but perhaps appropriate for some. Of course, this new clause introduces no issues with Leibniz's Law for ≈: P i ( aa ) will be true exactly when P ( bb ) is true given that aa ≈ bb . Recall Lewis: 'It does matter how you slice it-not to the character of what's described, of course, but to get the form of the description' (italics added). The composition as identity theorist can utilize the subvaluational and supervaluational semantics to explain Lewis's remark. The count-sensitive predicates like 'is a copse' and 'are fi ve trees' are true in virtue of the form of our descriptions of the world; thus, they should receive the subvaluational semantics. On the other hand, there are count-insensitive predicates true of all ways of counting the copse or fi ve trees: 'spatially 0001988544.INDD 312 6/13/2013 3:57:44 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 313 extended', 'material', 'greenish', etc. These predicates are true in virtue of the character of the world; and should receive a supervaluational semantics to refl ect this difference. 4. SIDER'S OBJECTIONS Sider ( 2007 ) has given some important objections to the thesis of composition as identity. 32 In this section, I examine some of these objections and show how the current proposal avoids them. In each case, Sider's argument relies on collapsing the distinctions between ways of counting. Ways of counting preserve additional structure that is necessary for the logic of plurals to behave nicely, and Sider's arguments fail to go through in the presence of them. 4.1. Collapse First, Sider shows that composition as identity (in conjunction with classical extensional mereology) implies the following principle. COLLAPSE y is part of the fusion of the xx iff y is one of xx The principle says that xx are all and only the parts of the fusion of xx . It arises from treating composition as numerical identity , rather than the general identity given by ≈. This principle causes some problems for the logic of plurals, and the composition as identity theorist ought to reject it. Consider again the tiled fl oor, where the black tiles are grouped into larger black squares and the white tiles are grouped into larger white squares. The fusion of the black squares and the white squares is the whole fl oor. But the black squares and white squares are not all of the parts of the fl oor; each individual tile is part of the fl oor, yet fails to be one of the black or white squares. So, the composition as identity theorist ought to reject the principle. Sider's proof for collapse is as follows. Left-to-right: let a be the fusion of the xx , let y be part of a . In addition to being composed of the xx , a is composed of y and a . Given strong compo32 Early versions of at least one of these objections appeared in Yi ( 1999 ). Since Yi's objection relies on the same principles as Sider's, the main lines of my response to Sider will serve as a response to Yi. 0001988544.INDD 313 6/13/2013 3:57:50 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 314 | Aaron J. Cotnoir sition as identity, we get that a = xx , and also that a = y and a ; and so the xx = y and a . Since y is one of y and a , it follows that y is one of the xx . Right-to-left follows immediately from the defi nition of 'fusion'. 2007, 57–8) The argument fails to apply to my proposal. To see why, let us follow along. Suppose a is the fusion of xx . According to composition as identity, a is the fusion of xx iff a is identical to xx . In our notation, a ≈ xx . Also, let y be a part of a , so y ≾ a . Since, ≈ expresses general identity, we do in fact have it that xx is identical to y in the sense of being the same portion of reality. It is also the case that y is composed of y and a , so y ≈ y + a where + expresses binary fusion. But we do not have it that y ≈ y , a (where y , a is the plurality made up of y and a ). Here we meet up with the fi rst problem with Sider's argument. The issue is that since y and a are not disjoint, they cannot be among the same plurality. Recall, the plural terms have as referents members of the same partition . So, expressing y ≈ y , a is ruled out by the semantics. No matter, though. As Sider himself notes, the argument can be run using a ≈ y , b where b is just the mereological difference between y and a (this assumes that y is a proper part of a ). 33 So far, then, we have it that a ≈ xx , y ≾ a , and a ≈ y , b . It does indeed follow (from the transitivity of ≈) that xx ≈ y , b . This is an instance where ≈ is manymany . As noted in section 2, however, many-many is not the same relation as plural identity. If it were, then since y is one of y , b , it would follow that y is one of xx . But it is not, and hence we do not necessarily have it that y is one of xx . Another way to see this point is by considering that the onemany version ≾ expresses the plural 'is-one-of' if the terms are interpreted by the same partition. It only makes sense to say that one thing 'isone -of' some other things if we are speaking according to a single way of counting. In Sider's proof, it would not follow that y is one of xx unless y ~ xx is true. It is, however, worth noting that we do have it that y ≾ xx , even if they are interpreted via different counts. But in this case ≾ does not express the standard plural predicate. This leads us to a related point of Sider's. He claims that collapse implies the failure of lists . 33 See Sider ( 2007 , 57, fn. 21). 0001988544.INDD 314 6/13/2013 3:57:50 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 315 LISTS x is one of yy iff 1x y= or . . . or nx y= (where each y i is among yy ) The failure of lists would be detrimental to plural logic. However, since on my account we do not have collapse , we may retain lists . In fact, we do have lists when ≾ expresses the 'is-one-of' relation (when x ∼ yy ). For in that case, x ≾ yy is true iff ⊆ ∪yyx . But given that partitions are pairwise disjoint, this can only happen if 1x y= or . . . or nx y= (where each y i is among yy ). The main issue here is that Sider is using the plural 'is-one-of' predicate and the plural identity predicate across different ways of counting. This can seem legitimate on a theory according to which composition is just the standard numerical identity. But on my account, where composition is general identity, 'is-one-of' is strictly an intra-count notion that depends on the way one is counting the domain. 4.2. Plural predication again Sider's second argument is that collective and distributive predication gets messed up. According to Sider: There is no predicate carried the basket such that 'Tom, Dick, and Harry carried the basket' is true while 'Tick, Darry, and Hom carried the basket' is false where Tick = Tom's head + Dick's body (Dick minus his head), Darry = Dick's head + Harry's body, and Hom = Harry's head + Tom's body. For strong composition as identity implies that Tom, Dick, and Harry are identical to Tick, Darry, and Hom. (2007, 58) This argument is illuminating because it clearly shows how composition as numerical identity forces the collapse of distinct counts. While it is true that Tom, Dick, Harry are identical ( many-many ≈) to Tick, Hom, Darry, they are explicitly different ways of counting the same portion of reality. On the indexical semantics, the truth of the sentence depends on the count used to interpret the plural term. So, on the Tom-Dick-Harry count, the sentence is true; on the Tick-Hom-Darry count, it is false. On the subvaluational semantics, 'Tick, Hom, and Darry carried the basket' is true, but only because there is a count which makes it true-namely, the collective count {{Tom, Dick, Harry}}. 0001988544.INDD 315 6/13/2013 3:57:50 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 316 | Aaron J. Cotnoir The same holds true for distributive predication, which Sider claims the composition as identity theorist cannot have. Sider's argument goes like this: Suppose Π obeys Distribution, suppose 1( , , )nx xΠ ... , suppose + ...+ =1 1my y x +. . .+(' + ' denotes fusion), and suppose ( )iy¬Π for some i . By strong composition as identity, we have ... = + ...+1 1, , n nx x x x and ... = + ...+1 1m my y y y ; by transitivity and symmetry of identity, we have 1 1, , n mx x y y... = ; by Leibniz's Law, we have 1( , , )my yΠ ... ; by Distribution, we then have ( )iyΠ ; contradiction. (2007, 58) Everything in this argument is correct. But on the indexical view, the appeal to Leibniz's Law is illegitimate. If, under the supposition, Π is true of 1 , , nx x... but not true of iy where iy is part of the fusion of 1 , , nx x... , then clearly Π is a count-sensitive predicate. As such, Leibniz's Law will only hold of plural terms interpreted under the same partition. However, by supposition 1 , , nx x... and 1 , , my y... must be interpreted via different partitions. So, the argument does not go through. On the subvaluational semantics, whether a predicate distributes or not depends entirely on partitions of the denotations of the plural terms. We can derive 1( , , )my yΠ ... since there is a partition of 1 , , my y... -namely, 1{{ }, ,{ }}nx x... -according to which it is true. But we may not infer that Π( y i ), since Π is distributive only relative to the x -partition and not the y -partition, by supposition. So, it may well be that these considerations lead one to favour the indexical semantics over the subvaluational semantics (or vice versa). But, by no means do they cause problems for the logic of plurals on my theory. Sider writes: What underlies all these cases of unexpected behavior of plural expressions is that plural expressions are never 'tied to a unique decomposition' given strong composition as identity. (2007, 59) But on my proposal, plural expressions only ever refer to a portion of reality under a way of counting , and hence are tied to a unique decomposition. Sider is working with a theory of composition as numerical identity, which is forced to collapse this additional structure. By appealing explicitly to counts, composition as general identity can preserve this structure. Moreover, it is not as if these 'ways of counting' are ad hoc fi xes which 'tack on' additional structure to the theory in order to save it 0001988544.INDD 316 6/13/2013 3:57:55 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 317 from Sider's objections. Ways of counting were an essential ingredient of composition as identity from its inception. Baxter's original idea, crucially , relied on ways of counting. 34 I hope that the formalization given in this chapter will show that composition as identity is not as incoherent as has previously been argued. Moreover, it has signifi cant advantages over Sider's version. I have given responses to Lewis's obstacles: the syntactic challenge , the semantic challenge , and the discernibility challenge . I have shown how to make sense of composition as identity in a way that avoids the strongest recent objections. The key to the problem is recognizing that the correct generalization of identity is a count-insensitive notion, that parthood and composition are cross-count notions, and that ordinary notions like identity, plural identity, and 'is-one-of' are intra-count notions. The composition as identity theorist is free to endorse a single way of counting as the correct one, and in so doing would give an answer to the special composition question. And that answer need not be a universalist answer. 35 Other coarser or more fi ne-grained counts would merely be 'loose talk'. 36 But composition as identity theorists are also free to claim that all ways of counting are equally good, as is assumed in Appendices 1 and 2. There are also intermediate views according to which some but not all ways of counting are correct. Whether 'ways of counting' themselves are objects which require additional ontological commitments is an interesting question. A negative answer is required in order for composition as identity to truly be ontologically innocent. But that will have to wait for another paper at some other time. 34 See Baxter (1988) . Wallace ( 2011a , 2011b ) has attempted to use Baxter's notion of 'counts' to help composition as identity. She relativizes numerical identity to a way of counting, but does not give a generalized notion of identity. But it is unclear to me how composition (a cross-count notion) could be numerical identity (an intra-count) notion unless one has a general notion connecting the two. Moreover, Bøhn ( 2009 ) relativized identity to 'concepts', which behave somewhat like counts. 35 Many authors have recently come to the conclusion that the thesis of composition as identity is independent of the special composition question. I think this is correct, because the thesis of composition as identity does not commit one to any particular ways of counting. See Cameron (2012) , Effi ngham (MS) , and McDaniel (2010) for more on this topic. 36 See Baxter (1988) . 0001988544.INDD 317 6/13/2013 3:58:10 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 318 | Aaron J. Cotnoir APPENDIX 1: THE LANGUAGE Lci In this appendix, I provide a syntax and set-theoretic semantics for the language of composition as identity L CI . (a) Syntax for L CI (i) Vocabulary Our formulas and sentences are built from a countable vocabulary: • A set, SC , of singular constants: { a , b , c , . . .} • A set, SV , of singular variables: { x , y , z , . . .} • A set, PC , of plural constants: { aa , bb , cc , . . .} • A set, PV , of plural variables: { xx , yy , zz , . . .} • A set, LP , of logical predicates (binary): 37 {≾, ≈, ~ } • A set, Q , of quantifi ers: 38 {∀ 1 , ∀ 2 , ∃ 1 , ∃ 2 } • A set, C , of connectives (usual arity): 39 {¬, ∧} • A set, P , of punctuation marks: {(,)} Constants in SC or PC and variables in SV or PV are terms. (ii) Formulas and Sentences We defi ne our set of formulas, Form, recursively. • For terms ss and tt , ( ss ≾ tt ) and ( ss ≈ tt ) and ( ss ~ tt ) are in Form. 40 • If φ ∈ Form and v ∈ SV , then ∀ 1 ( φ ) ∈ Form and ∃ 1 v ( φ ) Form. • If φ ∈ Form and vv ∈ PV , then ∀ 2 vv ( φ ) ∈ Form and ∃ 2 vv ( φ ) ∈ Form. • If φ ∈ Form then ¬ φ ∈ Form. • If φ ,ψ ∈ Form then ( φ ∧ ψ) ∈ Form. • Nothing else is in Form. Our set of sentences, Sent ⊆ Form, is merely the standard restriction of Form to those formulas where all occurring variables (if any) are bound. In the case of singular variables in SV , they must be bound 37 Alternatively, we could treat s ≈ t as defi ned by s ≾ t ∧ t ≾ s . 38 Alternatively, we could treat ∃ 1 v ( φ ) and ∃ 2 vv ( φ ) as defi ned by ¬∀ 1 v (¬ φ ) and ¬∀ 2 vv (¬ φ ). 39 Treat ⊃, ∨, ≡ as defi ned in the usual way. 40 ≾ and ≈ and ~ are polymorphic, taking either singular or plural terms. 0001988544.INDD 318 6/13/2013 3:58:10 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 319 by ∀ 1 or ∃ 1 ; and in the case of plural variables in PV , they must be bound by ∀ 2 or ∃ 2 . (b) Semantics for L CI (i) Models A model M , is a triple 〈 A , Π, I 〉 where A ≠ ∅ (our atoms). Π is the set of all partitions on A . I is our interpretation function, which must satisfy the following. • For all c ∈ SC , I ( c ) ⊆ π for some π ∈ Π. • For all cc ∈ PC , I ( cc ) ⊆ π for some π ∈ Π. (ii) Variable Assignments A variable assignment, i , is a function that satisfi es the following. • For all v ∈ SV , i ( v ) ⊆ π for some π ∈ Π. • For all vv ∈ PV , i ( vv ) ⊆ π for some π ∈ Π. (iii) Denotation We can now defi ne a denotation function, δ , s.t. for any term t : ( ) if ( ) ( ) if I t t SC PC t i t t SV PV δ ∪∈⎧ = ⎨ ∈ ∪⎩ (iv) Satisfaction A model and variable assignment satisfy a formula-written M , i ⊨ φ-if and only if the following hold: • For all terms ss and tt , M , i ⊨ ( ss ≾ tt ) iff ⋃ δ ( ss ) ⊆ ⋃ δ ( tt ). • For all terms ss and tt , M , i ⊨ ( ss ≈ tt ) iff ⋃ δ ( ss ) = ⋃ δ ( tt ). • For all terms ss and tt , M , i ⊨ ( ss ~ tt ) iff there is some π ∈ Π, s.t. δ( ss ) ⊆ π and δ ( tt ) ⊆ π . • For all v ∈ SV and φ ∈ Form, M , i ⊨ ∀ 1 v ( φ ) iff M , i ' ⊨ φ for every i ' that disagrees with i only wrt v (if at all); and M , i ⊨ ∃ 1 v ( φ ) iff M , i ' ⊨ φ for some i ' that disagrees with i only wrt v (if at all). 0001988544.INDD 319 6/13/2013 3:58:10 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 320 | Aaron J. Cotnoir • For all vv ∈ PV and φ ∈ Form, M , i ⊨ ∀ 2 vv ( φ ) iff M , i ' ⊨ φ for every i ' that disagrees with i only wrt vv (if at all); and M , i ⊨ ∃ 2 vv (φ) iff M , i ' ⊨ φ for some i ' that disagrees with i only wrt vv (if at all). • For all φ ∈ Form, M , i ⊨ ¬ φ iff M , i ⊭ φ . • For all φ , ψ ∈ Form, M , i ⊨ ( φ ∧ ψ) iff M , i ⊨ φ and M , i ⊨ ψ. We say a model satisfi es a formula-written M ⊨ φ -iff M , i ⊨ φ for all i . We say a model and variable assignment satisfi es Γ⊆Form- written M , i ⊨ Γ-iff M , i ⊨ γ for all γ ∈ Γ. (v) Validity The argument from Γ to φ is valid iff for every M and i , if M , i ⊨ Γ, then M , i ⊨ φ . A formula, φ , is valid iff for every M , M ⊨ φ . APPENDIX 2: MEREOLOGY FOR ≾ In this appendix, I prove that the one-one version of ≾ satisfi es the axioms for parthood in classical mereology. Theorem. ⊨ ∀ 1 x ( x ≾ x ); ⊨ ∀ 1 x ∀ 1 y ( x ≾ y ∧ y ≾ x → x ≈ y ); ⊨ ∀ 1 x ∀ 1 y ∀ 1 z ( x ≾ y ∧ y ≾ z → x ≾ z . Proof. These claims follow from the fact that M , i ⊨ s ≾ t iff δ ( s ) ⊆ δ ( t ), and that ⊆ is a partial order on ℘( A ). Theorem. Strong Supplementation: ⊨ ∀ 1 x ∀ 1 y ( x  y ) → ∃ 1 z ( z ≾ x ∧¬z ◦ y) Proof. Fix an M , i s.t. M , i ⊨ ∀ x ∀ y ( x  y ). So then δ ( x ) ⊈ δ ( y ) under i . Now let δ ( z ) = δ ( x )\ δ ( y ), and fi x i ' as the variable assignment that disagrees with i wrt z (if at all) by assigning z to δ ( x )\ δ ( y ). Notice δ ( z ) ⊆ δ ( x ) and for every w ∈ δ ( z ), w ∉ δ( y ). Hence, M , i  ⊨ z ≾ x ∧ ⌐z ◦ y) and so M , i ⊨ z ≾ x ∧ ¬z◦y). i ' is a legitimate variable assignment since every subset of our domain A of atoms is a member of some possible partition on A . Since δ( z )⊆ A and Π is the set of all possible partitions, δ ( z ) ∈ π for some π ∈ Π. Theorem. Plural Unrestricted Fusion: ⊨ ∀ 2 xx ∃ 1 y ∀ 1 z ( z ◦ y ↔ ∃ 1 x ( x ≾ xx ∧ z ◦ x )). 41 41 Here x ∘ y is an abbreviation for ∃ 1 w ( w ≾ x ∧ w ≾ y ). 0001988544.INDD 320 6/13/2013 3:58:13 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi Composition as General Identity | 321 Proof . Let δ ( xx ) ⊆ π where π ∈ Π (π is a partition on A ). Now fi x δ(y) = ⋃ δ(xx) . Notice that, in the set-theoretic interpretation, a ◦ b iff δ ( a ) ∩ δ ( b ) ≠ ∅. Since δ ( z ) ∈ ℘( A ), we know that δ ( z ) ∩ δ ( y ) ≠ ∅ iff δ ( z ) ∩ ⋃ δ ( xx ) ≠ ∅. By simple set theory, then, δ( )z ∩ δ ≠ ∅( )ix for some x i among xx . 42 University of St Andrews REFERENCES Baxter, D. Identity in the loose and popular sense. Mind 97 (1988a), 576–82. Baxter, D. Many–one identity. Philosophical Papers 17 (1988b), 193–216. Baxter, D. The discernibility of identicals. Journal of Philosophical Research 24 (1999), 37–55. Bøhn, E. Composition as Identity . PhD thesis, University of Massachusetts, 2009. < http://scholarworks.umass.edu/open_access_dissertations/92/ >. Cameron, R. Composition as identity doesn't settle the special composition question. Philosophy and Phenomenological Research 85, 3 (2012), 531–54. Effi ngham, N. Debunking a mereological myth: if composition as identity is true, then universalism need not be. Unpublished manuscript: < http://www.nikkeffingham.com/resources/Debunking+a+ Mereological+Myth.pdf >. Frege, G. The Foundations Of Arithmetic: A Logico-Mathematical Enquiry into the Concept of Number , 2nd edn. Evanston, IL: Northwestern University Press, 1980. Gillon, B. Towards a common semantics for English count and mass nouns. Linguistics and Philosophy 15, 6 (1992), 597–639. Landman, F. Groups I. Linguistics and Philosophy 12, 5 (1989), 559–605. Laycock, H. Words without Objects . Oxford: Clarendon Press, 2006. Lewis, D. Parts of Classes . Oxford: Basil Blackwell, 1991. 42 This chapter arose out of two excellent seminars I took while a graduate student at the University of Connecticut: Marcus Rossberg's seminar on higher-order and plural logics, and Don Baxter's seminar on identity in metaphysics. Thanks to the following for many helpful discussions on these issues: Andrew Bacon, Ralf Bader, Jc Beall, Don Baxter, Einar Bøhn, Colin Caret, Michael Della Rocca, Tim Elder, Tamar Gendler, Katherine Hawley, Michael Hughes, Philip Kremer, Jon Litland, Doug Owings, David Nicholas, Agustín Rayo, Marcus Rossberg, Yael Sharvit, Zoltan Szabo, John Troyer, Gabriel Uzquiano, Achille Varzi, Sam Wheeler, Bruno Whittle, and Jessica Wilson. Finally, I wish to thank four anonymous referees for comments that led to many improvements of this chapter. 0001988544.INDD 321 6/13/2013 3:58:13 PM OUP UNCORRECTED PROOF – REVISES, 06/13/2013, SPi 322 | Aaron J. Cotnoir McDaniel, K. Composition as identity does not entail universalism. Erkenntnis 73, 1 (2010), 97–100. Nicolas, D. Mass nouns and plural logic. Linguistics and Philosophy 31, 2 (2008), 211–44. Nicolas, D., and Linnebo, O. Superplurals in English. Analysis 68, 3 (2008), 186–97. Oliver, A., and Smiley, T. Is plural denotation collective? Analysis 68, 1 ( January 2008), 22–34. Rayo, A. Word and objects. Noûs 36, 3 (2002), 436–64. Rayo, A. Beyond plurals. In A. Rayo and G. Uzquiano (eds), Absolute Generality . Oxford: Oxford University Press, 2006, pp. 220–54. Saucedo, R. Composition, identity, and the number of things. Unpublished manuscript. Schlenker, P. Properties, plurals, and paradox. Unpublished manuscript: < http://www.linguistics.ucla.edu/people/schlenker/PPP.pdf >. Schwarzschild, R. Pluralities . Dordrecht: Kluwer, 1996. Sharvey, R. A more general theory of defi nite descriptions. The Philosophical Review 89 (1980), 607–24. Sider, T. Parthood. The Philosophical Review 116 (2007), 51–91. Uzquiano, G. The supreme court and the supreme court justices: A metaphysical puzzle. Noûs 38, 1 (2007), 135–53. van Inwagen, P. Composition as identity. In J. Tomberlin (ed.), Philosophical Perspectives , vol. 8. Ridgeview, Atascadero CA, 1994, pp. 207–20. Varzi, A. Mereological commitments. Dialectica 54 (2000), 283–305. Wallace, M. Composition as identity: Part I. Philosophy Compass 6 (2011a), 804–16. Wallace, M. Composition as identity: Part II. Philosophy Compass 6 (2011b), 817–27. Yi, B. Is mereology ontologically innocent? Philosophical Studies 93 (1999), 141–60. 0001988544.INDD 322 6/13/2013 3:58:15 PM