The Metaphysical Significance of the Ugly Duckling Theorem Abstract According to Satosi Watanabe's "theorem of the ugly duckling", the number of (possible) predicates satisfied by any two different particulars is a constant, which does not depend on the choice of the two particulars. If the number of (possible) predicates satisfied by two particulars is their number of properties in common, and the degree of resemblance between two particulars is a function of their number of properties in common, then it follows that the degree of resemblance between any two different particulars is a constant, which does not depend on the choice of the two particulars either. Avoiding this absurd conclusion requires questioning assumptions involving infinity in the proof or interpretation of the theorem, adopting a sparse conception of properties according to which not every (possible) predicate corresponds to a property, or denying that degree of resemblance is a function of number of properties in common. After arguing against the first two options, this paper argues for a version of the third which analyses degrees of resemblance in terms of degrees of naturalness of common and uncommon properties. In the course of doing so, it presents a novel account of degrees of naturalness. 1 Introduction "...the point of philosophy," according to Bertrand Russell, "is to start with something so simple as not to seem worth stating, and to end with something so paradoxical that no one will believe it" (Russell, 1918, 514). The argument discussed in this paper, which proceeds from platitudinous or nearly provable premises about predicates and properties to the barely believable conclusion that any two different particulars resemble each other to the same degree, does not fall far short of Russell's goal. The paper attempts to assess the metaphysical significance of the argument by considering which premise should be rejected, and whether any surrogate premise can capture its platitudinous aspects, without entailing a barely believable conclusion. The first premise, which Satosi Watanabe (1969, 376) dubs "the theorem of the ugly duckling", is: (1) The number of (possible) predicates satisfied by two particulars which do not satisfy all the same (possible) predicates is a fixed (infinite) constant, which equals the number of (possible) predicates satisfied by only the first, as well as the number of (possible) predicates satisfied by only the second. As Watanabe explains "The reader will soon understand the reason for referring to the story of Hans Christian Anderson, because this theorem, combined with the foregoing interpretation [or premises two and three below], would lead to the conclusion that an ugly duckling and a swan are just as similar to each other as are two (different) swans." (Watanabe, 1969, 376). The first section explains the rationale behind this premise. 2 The second premise follows from an abundant conception of properties, according to which a particular has a property if and only if it satisfies a (possible) predicate corresponding to that property, and so the number of properties is the number of (possible) predicates. It is: (2) The number of (possible) predicates satisfied by two particulars is the number of properties they have in common, the number of (possible) predicates satisfied by only the first is the number of properties the first has not in common with the second, and the number of (possible) predicates satisfied by only the second is the number of properties the second has not in common with the first. Snow, for example, has the property of being white, according to abundant conceptions of properties, if and only if snow satisfies the corresponding predicate 'is white'. Likewise, two peas in a pod have the properties of greenness, roundness and yuckiness in common, according to abundant conceptions of properties, if and only if they satisfy the corresponding predicates 'is green', 'is round', and 'is yucky'. And cheese has the property of edibility not in common with chalk if and only if cheese but not chalk satisfies the predicate 'is edible'.1 1The name "abundant" comes from Lewis (1983, 346); see also Lewis (1986b, 59). Some writers prefer "deflationary", following Hale, who writes "According to the abundant or, as I prefer to call it, deflationary conception of properties, every meaningful predicate stands for a property or relation, and it is sufficient for the actual existence of a property or relation that there could be a predicate with appropriate satisfaction conditions" (Hale, 2013, 132); see also Cook (2014) and Hale (2015). I prefer "abundant" not only because of the contrast with "sparse", but also because I do not wish to imply that, according to the abundant conception, properties are any less real or fundamental. 3 The second premise is plausible on the hypothesis that the meaning of a (possible) predicate is a property: the meaning of the predicate 'is white', for example, is simply the property of being white. So even though the second premise could also be motivated by assuming the doctrine of predicate nominalism, according to which a particular has a property in virtue of satisfying a corresponding (possible) predicate, or the doctrine of class nominalism, according to which an individual has a property in virtue of being a member of the class of (possible) individuals which have that property, it is also independently plausible: it requires for its motivation no stronger metaphysical doctrine than the thesis that properties are the meanings of (possible) predicates. Proponents of sparse conceptions of properties, according to which there is not a property corresponding to every (possible) predicate, will find this the obvious premise to reject.2 But I will argue in the second section that many sparse conceptions of properties which are otherwise well motivated nevertheless fail to escape the barely believable conclusion that the degree of resemblance between two different particulars is a constant, independent of the choice of the two particulars. According to David Armstrong's influential conception, for example, there are instantiated conjunctive, but no negative, disjunctive or uninstantiated properties (Armstrong, 1978b). But later I will argue, following John Bacon (1986), that Armstrong's conception entails that every particular has at most one property, and so the degree of resemblance between any two different particulars is zero, regardless of the choice of the two particulars. 2See, for example, Niiniluoto (1987, 37), Armstrong (1989, 40), Rodriguez-Pereyra (2002, 66-7) and Ott (2016, 140). 4 The third premise is supported by the analysis of resemblance as having properties in common, which suggests that the more properties particulars have in common, the more they resemble each other, and the more properties particulars have not in common with each other, the less they resemble each other. It is: (3) The degree of resemblance between two particulars is a function of the number of properties they have in common, the number of properties the first has not in common with the second, and the number of properties the second has not in common with the first. It's natural to suggest, for example, that two peas in a pod resemble each other to a high degree because they have many properties in common and few properties not in common. Likewise, it's natural to suggest that the degree of resemblance between a raven and a writing desk is low because a raven and a writing desk have few properties in common and many properties not in common. For illustrative purposes, I will focus on the suggestion that the degree of resemblance between particulars is their proportion of properties in common or, in other words, their number of properties in common, divided by their number of properties in total (the sum of their number of properties in common and number of properties not in common). This is convenient because the degree of resemblance between particulars which have all of their properties in common is one, whereas the degree of resemblance between particulars which have none of their properties in common is zero. But nothing important depends on this choice of illustration.3 3For definitions of degree of dissimilarity as a function of number of properties in common and not 5 The first premise and the second in combination entail that the number of properties in common and the number of properties not in common between two different particulars is a constant, which in combination with the third premise entails that the degree of resemblance between two different particulars is a function of a constant, and so: (4) The degree of resemblance between two particulars which do not satisfy all the same (possible) predicates, or which do not have all of their properties in common, or which differ from each other, is a fixed constant, which does not depend on the choice of the two particulars. This conclusion is barely believable. According to it, a raven resembles a writing desk, for example, to the same degree as a raven resembles a magpie, and a cygnet resembles a duckling to the same degree as two different ducklings resemble each other. Through Nelson Goodman's later work, especially Seven Strictures on Similarity, the argument has become extremely familiar. As Goodman writes "...any two things have exactly as many properties in common as any other two. If there are just three things in the universe, then any two of them belong together in exactly two classes and have exactly two properties in common... Where the number of things in the universe in common see, for example, Niiniluoto (1987, 22-35), Oliver (1996, 52), Rodriguez-Pereyra (2002, 659), (Paseau, 2012, 365), Blumson (2014b, 179-93), Paseau (2015, 110), Blumson (2018b) and Yi (2018, 796-803). For scepticism that resemblance is measurable by numerical degree at all, see Lewis (1973, 50), Williamson (1988, 457-60) and Blumson (2018a); for defence see, for example, Bigelow (1976, 1977), Tversky (1977), Suppes et al. (1989, 159-225), Weisberg (2012) and Kroedel and Huber (2013, 459-462). Section (3) is also a partial defence of this presupposition. 6 is n, each two things have in common exactly 2n−2 properties out of the total 2n − 1 properties; each thing has 2n−2 properties that the other does not, and there are 2n−2−1 properties that neither has" (Goodman, 1972, 443-4; see also Quinton, 1957, 36). But despite its familiarity, the argument is worth revisiting for four reasons. Firstly, this version of the argument assumes the controversial doctrine of class nominalism, according to which there is a property corresponding to every set of (possible) particulars, and so if n is the number of (possible) particulars, the number of properties is 2n. While this is a much quicker route to the absurd conclusion, the assumption of class nominalism is itself in need of justification. As Goodman himself admits "...as a [predicate] nominalist, I take all talk of properties [and classes] as slang for a more careful formulation in terms of predicates" (Goodman, 1972, 443). The presentation below assumes neither class nor predicate nominalism (although it does assume the existence of classes and properties), and so is a more careful formulation in terms of predicates of the kind Goodman alludes to. As a result, it reveals more than Goodman's presentation about the underlying sources of the problem. Secondly, discussions of the problem almost invariably focus on the case in which the number of (possible) predicates or properties is infinite. David Lewis, for example, writes "Because properties are so abundant, they are undiscriminating. Any two things share infinitely many properties, and fail to share infinitely many others. That is so whether the two things are perfect duplicates or utterly dissimilar. Thus properties do nothing to capture facts of resemblance" (1983, 346). In a similar vein, David Armstrong writes "We should perhaps take quick and unfavourable notice of the view sometimes 7 encountered that degrees of resemblance are quite arbitrary because with respect to any two things at all we can find an indefinite number of resemblances and an indefinite number of differences and that, as a result, no two things are more, or less, alike than any other two" (1989, 40).4 Since the number of (possible) predicates is infinite, the focus on the infinite case is unsurprising. But the focus on the infinite case also makes it hard to avoid the impression that infinity is the source of the problem, which in turn suggests that clear thinking about infinity may be the route to a solution. I will argue below that there are two controversial assumptions relating to infinity which could be rejected in order to resist the conclusion of the argument; namely, the axiom of choice and the thesis that every collection of (possible) predicates, whether finite or infinite, has a disjunction and conjunction. But since the argument goes through in the finite case without either of these controversial assumptions, I will also argue that controversies concerning infinity are a distraction, and do not undermine the force of the problem. Thirdly, despite the absurdity of the conclusion, the argument has been extremely influential. In a discussion on concepts in cognitive science, Peter Gardenfors (2000, 111), for example, writes: ... any two objects can be shown to share an infinite number of properties. ... If it is the number of shared properties that determines the similarity of objects, then any two objects will be arbitrarily similar. ... Restricting the problem to natural properties ... does not help – there are still arbitrarily 4See also, for example, Guigon (2014, 390), Cowling (2017, 10) and the references in footnote 5. 8 many. ... I know of no theory of properties that furnishes a satisfactory solution to this problem. Consequently, I see no way of defining similarity as the number of shared properties. It is clear that Gardenfors would respond to the argument by rejecting the third premise. But other writers take the argument to throw doubt on whether overall similarity makes sense at all. In a discussion of biodiversity, James Maclaurin and Kim Sterelny (2008, 14), for example, come close to accepting the conclusion when they write emphatically that: ... the project of building a classification based on overall similarity is hopeless. If any characteristic at all counts in determining similarity relations among (say) a horse fly, a fruit fly, and a bee, then they are all equally similar and equally unlike one another. For every individual has, and lacks, an infinity of characteristics. ... Overall similarity is not a well defined concept, as Nelson Goodman vigorously remarked in Seven Strictures on Similarity. An argument purported to have such radical and far reaching consequences deserves to be considered extremely carefully.5 Finally, although it is clear that the conclusion of the argument should be avoided 5The argument is also raised outside metaphysics by, amongst others, Towster (1975), Watanabe (1985), Oddie (1986, 164-5), Niiniluoto (1987, 35-7), Medin et al. (1993, 255), Mundy (1995, 35-6), Feldman (1997, 150), Byrne (2003, 641), Priest (2008, 97), Sterrett (2009, 803), Decock and Douven (2011, 68), Isaac (2013, 685), Blumson (2014b, 182-96) and Ott (2016, 140-1). Morreau (2010) argues against the cogency of overall comparative similarity on different grounds. 9 by rejecting either the first, second or third premise, it is not at all clear which premise ought to be rejected. Ideally, a motivation for rejecting one premise rather than the other ought to include a surrogate for the rejected premise, which captures what is intuitive about the original premise, but which escapes the barely believable conclusion. However, I will argue below that many of the most obvious and popular surrogates, while successful in capturing what is intuitive about the original premises, in fact fail to escape the barely believable conclusion. I am most optimistic about the prospects for an intuitive revision of the third premise. In particular, I will argue in the third section that degree of resemblance between particulars is a weighted function of properties in common and not in common, where the weights in question are interpreted as degrees of objective naturalness or subjective importance.6 As a theory of degrees of naturalness, this theory is an explication of the conception Theodore Sider calls "the extreme view", according to which "one property is more natural than another if and only if it makes for more similarity than the other" (1993, 52; see also Dorr and Hawthorne, 2013, 22-23). Nevertheless, I will argue in section three that "the extreme view" provides the best conception of degrees of resemblance available. Besides the analysis of resemblance, naturalness has many roles in philosophy. Sider's opposition to the conception provided by the "extreme view" is driven by its inability to play those other roles (Sider, 1993, 58). But I am very sympathetic to the possibility, emphasised by Cian Dorr and John Hawthorne (2013), that nothing can play all the 6Watanabe (1969, 1985), Niiniluoto (1987, 37) and Blumson (2014b, 193-6) also favour this solution. 10 roles that naturalness has been asked to. For that reason I want to set aside in this paper most of the other roles naturalness, and the theory of properties in general, is supposed to play in metaphysics, in order to focus exclusively on the problem of degrees of resemblance. 1 The First Premise A predicate is a sentence with a name removed. The predicate 'is white', for example, is the sentence 'snow is white' with the name 'snow' removed. A (named) particular satisfies a predicate if and only if replacing the gap in the predicate by a name of the particular results in a true sentence. Snow satisfies 'is white', for example, because the sentence 'snow is white' is true. According to abundant conceptions of properties, there is a property corresponding to every predicate: corresponding to the predicate 'is white', for example, is the property of being white. There are some properties that do not correspond to any actual predicate. As David Armstrong writes "It is clearly possible, and we believe it to be the case, that particulars have certain properties and relations which never fall under human notice" (Armstrong, 1978a, 21). Nevertheless, if these properties were to fall under human notice, we could introduce predicates to talk about them, so corresponding to every property is a possible predicate. Possible predicates are a complicating factor at some points in the argument, because of their great number, but a simplifying factor at others, because of their completeness. When possible, I may omit to mention them. Recall that according to the first premise, the number of (possible) predicates satisfied 11 by two particulars which do not satisfy all the same (possible) predicates is a fixed (infinite) constant, which equals the number of (possible) predicates satisfied by only the first, as well as the number of (possible) predicates satisfied by only the second. So the number of predicates satisfied by snow and ice, by just snow and not ice, and by just ice and not snow, for example, is exactly the same as the number satisfied by both chalk and cheese, by just chalk and not cheese, and by just cheese but not chalk. The first premise is itself supported by two subpremises. The first of these subpremises is that the predicates under the relation of entailment form a complete boolean lattice. The second subpremise is a representation theorem for complete boolean lattices, according to which the elements of a complete boolean lattice are isomorphic to a set of subsets.7 The following subsections explains the philosophical rationale behind the first subpremise, the proof of the second subpremise, and their bearing on the main argument. 1.1 Complete Boolean Lattices In this subsection, I argue that the (possible) predicates under the relation of entailment form a complete boolean lattice. I'll begin by introducing the definition of a boolean lattice, and arguing that that definition is met by the (possible) predicates under the relation of entailment. Then I will argue for the more controversial part of the premise, 7A generalisation of this theorem is known as the Stone representation theorem for boolean lattices (Stone, 1936). An accessible proof for the finite case can be found in Davey and Priestly (2002, 112-5). The version of the proof below is generalised slightly from the finite case to cover the case of complete boolean lattices, finite or infinite. 12 which is that the boolean lattice of possible predicates under the relation of entailment is complete. As I will explain, this is the first controversial assumption of the argument which could be resisted in the infinite, but not the finite, case. 1.1.1 Boolean Lattices A predicate entails another predicate if and only if necessarily any particular which satisfies the former also satisfies the latter. The predicate 'is white' entails the predicate 'is coloured', for example, because it's necessary that any particular which satisfies 'is white' also satisfies 'is coloured'. Entailment between predicates is a reflexive and transitive relation: since necessarily any particular which satisfies 'is white' satisfies 'is white', for example, 'is white' entails 'is white'. And since 'is scarlet' entails 'is red' and 'is red' entails 'is coloured', 'is scarlet' entails 'is coloured'. It's also convenient to stipulate that the relation of entailment between predicates is antisymmetric. In other words, if a predicate entails a second predicate and the second predicate entails the first, then they are the same predicate. Since 'is white' entails 'is not unwhite' and 'is not unwhite' entails 'is white', for example, 'is white' and 'is not unwhite' are the same predicate. This stipulation is convenient because it ensures that there is only one (possible) predicate corresponding to each property, so if there is a (possible) predicate corresponding to every property, then there is exactly one (possible) predicate corresponding to every property (Armstrong, 1978a, 7). Two clarifications. First, for many purposes it's desirable to distinguish between predicates which entail each other, and between their corresponding properties (see, for 13 example, Lewis (1986b, 55-59)). Although 'is triangular' and 'is trilateral', for example, entail each other, it's often desirable to distinguish between them, as well as to distinguish between the corresponding properties of being triangular and being trilateral. But it's not desirable to draw this distinction for the purpose of analysing resemblance. We should not count being triangular and being trilateral, for example, as distinct similarities between two shapes, since that would be to count one similarity twice over. Second, consider the purported predicate 'is not satisfied by itself'. If an abundant conception of properties is correct, a predicate satisfies 'is not satisfied by itself' if and only if it satisfies the corresponding property of not being satisfied by itself or, in other words, if and only if it does not satisfy itself. So 'is not satisfied by itself' satisfies itself if and only if it does not satisfy itself, which is a contradiction. This is a serious problem for abundant conceptions of properties (Field, 2004), but not the problem under discussion in this paper. To avoid it, I consider only predicates applying to individual particulars, and not to other predicates, properties, or sets.8 A partially ordered set is an ordered pair of 〈A,≤〉 of a set A and a partial ordering relation≤ between elements of A (Gratzer, 2011, 1). Since entailment between predicates is a reflexive, antisymmetric and transitive relation, it follows that entailment between predicates is a partial ordering relation, and predicates are a partially ordered set under the relation of entailment.9 8This means that the issues raised about the abundant theory of properties here are orthogonal to those raised by Hale (2013, 2015) and Cook (2014), who are explicitly concerned with second-order logic. 9As usual I will say that a < b if and only if a ≤ b but it is not the case that b ≤ a, and a = b if and only if a ≤ b and b ≤ a. As well as the relation of entailment between predicates, '≤' below may stand 14 The conjunction of two elements in a partially ordered set can be defined in terms of its ordering relation as follows: an element a ∈ A is the conjunction b∧c of two elements b, c ∈ A of a partially ordered set 〈A,≤〉 if and only if (i) a ≤ b and a ≤ c and (ii) for all d ∈ A if d ≤ b and d ≤ c, then d ≤ a. The predicate 'is red and square' is the conjunction of 'is red' and 'is square', for example, because 'is red and square' entails 'is red' and entails 'is square', and because every predicate which entails 'is red' and entails 'is square' entails 'is red and square'. Likewise, an element a ∈ A is the disjunction b ∨ c of two elements b, c ∈ A of a partially ordered set 〈A,≤〉 if and only if (i) b ≤ a and c ≤ a and (ii) for all d ∈ A if b ≤ d and c ≤ d, then a ≤ d. The predicate 'is Czechoslovakian' is the disjunction of 'is Czech' and 'is Slovakian', for example, because 'is Czech' and 'is Slovakian' entail 'is Czechoslovakian', and every predicate which is entailed by 'is Czech' and entailed by 'is Slovakian' is also entailed by 'is Czechoslovakian'. Notice that neither definition requires 'or' or 'and' to appear in a predicate for it to be a conjunction or disjunction. This is important, since it means that whether a predicate is a conjunction or disjunction of possible predicates in this sense is not contingent on which language we speak. So if, as we consider in the next section, we deny that there are properties corresponding to disjunctive or conjunctive predicates in this sense, which properties we are denying the existence of likewise is not contingent on language.10 A lattice is a partially ordered set 〈A,≤〉 in which every pair of elements a, b ∈ A has for the standard ordering relation between real numbers: context should disambiguate. 10For a related point see, for example, Oddie (2005, 151-2). 15 a conjunction a∧ b and a disjunction a∨ b. Since every pair of (possible) predicates has a conjunction which may be formed with 'and' and a disjunction which may be formed with 'or', the partial ordering of (possible) predicates under the relation of entailment is a lattice. An element a ∈ A is the maximum > of a partially ordered set 〈A,≤〉 if and only if b ≤ a for all b ∈ A (Gratzer, 2011, 5). The predicate 'exists' or 'is white or not white', for example, is the maximum element of the set of predicates under the relation of entailment, because necessarily, if a particular satisfies any predicate, then it satisfies 'exists' or, in other words, because every predicate entails 'exists'. Likewise, an element a ∈ A is the minimum ⊥ of a poset 〈A,≤〉 if and only if a ≤ b for all b ∈ A (Gratzer, 2011, 5). An element a ∈ A is the negation ¬b of an element b ∈ A if and only if a∨ b = > and a∧ b = ⊥ (Gratzer, 2011, 97). The predicate 'is not white', for example, is the negation of the predicate 'is white' and vice versa, because 'is white or not white' is equivalent to 'exists' or 'is white or not white' and 'is white and not white' is equivalent to 'does not exist' or 'is white and not white'. Likewise, the predicate 'is abstract' is the negation of the predicate 'is concrete' and vice versa, because 'is abstract or concrete' is equivalent to 'exists' and 'is abstract and concrete' is equivalent to 'does not exist'. A lattice 〈A,≤〉 is complemented if and only if it has a minimum ⊥, a maximum > and every a ∈ A has a negation ¬a (Gratzer, 2011, 98). The set of (possible) predicates under the relation of entailment is a complemented lattice, since its minimum element is 'does not exist' or 'is white and not white', its maximum element is 'exists' or 'is white 16 or not white', and every (possible) predicate has a negation, which may be formed using the word 'not'. Notice that this definition of negation does not require 'not' to appear in a predicate in order for it to be a negation. In fact, in a complemented lattice, every element is a negation, since every element is the negation of its negation. Just as 'is abstract', for example, is the negation of 'is concrete', 'is concrete' is the negation of 'is abstract'. So if, as we consider in the next section, we deny that there are "negative properties", we must be especially careful to be clear what we mean by this.11 A lattice 〈A,≤〉 is distributive if and only if for all elements a, b, c ∈ A, a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) and a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) (Gratzer, 2011, 14-5). Distributivity is required to prove the representation theorem for complete boolean lattices below, but since it's uncontroversial in this context that the set of predicates ordered under the relation of entailment is a distributive lattice, I won't stress its role. A lattice is boolean if and only if it is distributive and complemented, and it has a minimum and maximum element (Gratzer, 2011, 15). So the lattice of predicates under the relation of entailment is boolean, because predicates under the relation of entailment are distributive and complemented (since every element has a negation), and it has a minimum and maximum element ('does not exist' or 'is white and not white' and 'exists' or 'is white or not white'). That concludes the argument that the predicates under entailment are a boolean lattice. 11For a related point see, for example, Oddie (2005, 151-2). 17 1.1.2 Complete Lattices In order to define a complete lattice, the definitions of conjunction and disjunction above have to be generalised in order to apply not only to pairs, but to arbitrary – finite or infinite – sets of (possible) predicates. The question of whether the lattice of (possible) predicates under the relation of entailment is complete is then just the question of whether every set – finite or infinite – of possible predicates has a conjunction and disjunction. In this subsection, I will argue that the lattice of possible predicates is complete. In general, an element a ∈ A is the disjunction ∨ B of the elements in a subset B ⊆ A if and only if (i) for all b ∈ B, b ≤ a and (ii) for all c ∈ A if b ≤ c for all b ∈ B, then a ≤ c (Gratzer, 2011, 5). The predicate 'is red', for example, is the disjunction of 'is scarlet', 'is crimson', 'is maroon', ... and so on, because 'is scarlet', 'is crimson', 'is maroon', ... and so on all entail 'is red', and every predicate which entails 'is scarlet', 'is crimson', 'is maroon', ... and so on also entails 'is red'. Likewise, an element a ∈ A is the conjunction ∧ B of the elements in a subset B ⊆ A if and only if (i) for all b ∈ B, a ≤ b and (ii) for all c ∈ A if c ≤ b for all b ∈ B, then c ≤ a (Gratzer, 2011, 5). Notice that neither of these definitions requires a predicate to be infinitely long for it to be the conjunction or disjunction of an infinite set of predicates.12 A lattice 〈A,≤〉 is complete if and only if every subset of elements B ⊆ A has a conjunction ∧ B and a disjunction ∨ B (Gratzer, 2011, 50). Every finite lattice is complete, since the disjunction or conjunction of its elements can be formed by successively 12In contrast to predicates in the infinitary languages discussed by Cook (2014). 18 disjoining or conjoining each pair of its elements. So if there were only a finite number of predicates, then the partial ordering of predicates under the relation of entailment would be a complete lattice. But there is an infinite number of predicates. The predicates 'is one year old', 'is two years old', 'is three years old', ... and so on, for example, are countably infinite. Moreover, although every pair of predicates has a disjunction and conjunction, it's controversial whether every infinite subset of predicates does, since it's controversial whether the disjunction or conjunction of even a countably infinite set of predicates can be formed by joining every predicate in the set with the words 'or' or 'and'.13 But although the existence of disjunctions and conjunctions of infinite subsets of predicates is not obviously guaranteed by the possibility of using the words 'or' or 'and' to join all the predicates in the subset, and so whether every infinite subset of predicates has an actual predicate as its disjunction and conjunction is not obvious, it still seems plausible that every infinite subset of predicates has a possible predicate as its disjunction and conjunction.14 So it's plausible that the lattice of possible predicates under the relation of entailment is complete. 13For discussion of whether there are infinite sentences in natural language see, for example, Langendoen and Postal (1986), Collins (2010) and Blumson (2014a). 14Cook (2014) argues for this thesis using infinitary languages with infinitely long predicates and the possibility of supertasks. Since the possible predicates in the sense defined here need not be infinitely long, the success of Cook's argument is sufficient but not necessary to establish the existence of the possible predicates in question. 19 1.2 The Representation Theorem In this subsection, I rehearse a proof that the elements of a complete boolean lattice are isomorphic to the set of subsets of the atomic elements of that lattice. It is this theorem which underlies the appeal of the doctrine of class nominalism, which identifies properties with subsets of the set of individuals.15 More importantly for our purposes, this theorem, in conjunction with the claim that the set of (possible) predicates is a complete boolean lattice, entails the first premise of our main argument. An element a ∈ A of a lattice 〈A,≤〉 is an atom if and only if ⊥ < a and for all b ∈ A if b < a then b = ⊥ (Gratzer, 2011, 101). In other words, an element is an atom if and only if no element is smaller, except the minimum. In the lattice of predicates which apply to a die in virtue of the number it lands, for example, there are six atoms: 'lands one', 'lands two', 'lands three', 'lands four', 'lands five' and 'lands six'.16 If 〈A,≤〉 is a finite lattice, then every element a ∈ A must be greater than or equal to some atom b ∈ A. But if A is not finite, then it's possible that 〈A,≤〉 has no atoms. Take, for example, the countably many logically independent predicates 'lands heads on the first toss', 'lands heads on the second toss', 'lands heads on the third toss', ... and so on. The conjunctions, disjunctions and negations of finite subsets of these predicates, 15Bjerring and Schwarz (2017, 26) make the same point about analysing propositions as sets of worlds. 16Note that an "atom" in this context is not a syntactically simple predicate: 'lands odd', for example, is not an atom, because it is strictly entailed by 'lands one', whereas 'lands on an even number and lands on a prime number' is an atom, because it is strictly entailed by 'does not land' but not by any other predicate. Atoms are akin to, but not exactly the same as, Sider's "profiles" (1993, 50); see also Dorr and Hawthorne (2013, 23). 20 which may be formed using the words 'and', 'or' and 'not' finitely many times, ordered under the relation of entailment form a boolean lattice. But for each consistent predicate in the lattice, a consistent predicate which entails it may be formed by conjoining one of the simple predicates from which it is not formed. The predicate 'lands heads on the first toss or does not land heads on the second toss', for example, is not an atom, because it is entailed by 'lands heads on the first toss or does not land heads on the second toss and lands heads on the third toss'. So the lattice has no atoms. But if 〈A,≤〉 is a complete boolean lattice, then every element a ∈ A must be greater than or equal to some atom b ∈ A. Take again, for example, the countably many logically independent predicates 'lands heads on the first toss', 'lands heads on the second toss', 'lands heads on the third toss', ... and so on. The conjunctions, disjunctions and negations of arbitrary finite or infinite subsets of these predicates ordered under the relation of entailment form a complete boolean lattice. Every consistent predicate in the lattice is entailed by at least one atom, which may be formed by choosing predicates with which it is consistent to conjoin it with until there are no more. Since this may involve an infinite number of choices, this is the step which relies on the assumption of the axiom of choice.17 17More formally, the axiom of choice states that for every set A there is a function f : P(A) 7→ A from the subsets to the elements of A such that for each B ∈ P(A), f(B) ∈ B. Let 〈A,≤〉 be a complete boolean lattice and f : P(A) 7→ A be such a function. Then for each element a ∈ A consider the set B ⊆ A such that both a ∈ B and for every subset C ⊆ B if there is some b ∈ A such that ⊥ < b < ∧ C, then f {c ∈ A | ⊥ < c < ∧ C} ∈ B. Since a ∈ B, ∧ B ≤ a. And since B ⊆ B, if there is some b ∈ A such 21 Every element a ∈ A in a complete boolean lattice 〈A,≤〉 is equivalent to the disjunction ∨ {b ∈ B | b ≤ a} of a subset of the atoms B ⊆ A and for every subset C ⊆ B of the atoms B ⊆ A in a complete boolean lattice, C = {b ∈ B | b ≤ ∨ C} (Davey and Priestly, 2002, 114-5). In other words, there is a one to one correspondence between the elements of a complete boolean lattice and the subsets of the atoms in the lattice which the elements are disjunctions of. In particular, in the complete boolean lattice of possible predicates, each possible predicate corresponds to the subset of atoms it is a disjunction of, and each subset of atoms has a possible predicate as their disjunction. Let n be the number of atoms in a complete boolean lattice 〈A,≤〉. Then since there is a one to one correspondence between elements in A and subsets of atoms in B ⊆ A, the number of elements in A is the number of subsets |P(B)| = 2n of the atoms. The number of predicates which apply to a die in virtue of the number it lands, for example, is 26, since there is a predicate which applies for each combination of the six atoms 'lands one', 'lands two', 'lands three', 'lands four', 'lands five' and 'lands six'. More importantly, if n is the number of atoms in the complete boolean lattice of possible predicates, then the total number of possible predicates is 2n. It follows that the number of predicates a particular satisfies is 2n−1, since each particular must satisfy exactly one atomic predicate, but may satisfy the disjunction of that ⊥ < b < ∧ B, then f {c ∈ A | ⊥ < c < ∧ B} ∈ B and so ∧ B ≤ f {c ∈ A | ⊥ < c < ∧ B}. But this contradicts the fact that f {c ∈ A | ⊥ < c < ∧ B} < ∧ B. So there is no b ∈ A such that ⊥ < b < ∧ B. So ∧ B is an atom less than or equal to a. This is the step which generalises Davey and Priestly's (2002, 112-5) proof from the finite case to the case of complete boolean lattices. 22 that atomic predicate with any combination of the remaining n − 1 atomic predicates. The number of predicates satisfied by two particulars which do not satisfy all the same predicates is 2n−2, since each two particulars satisfy in common the disjunctions of exactly two atomic predicates with any combination of the remaining n − 2. And the number of predicates which are satisfied by only the first of two particulars which do not satisfy all the same predicates is also 2n−2, since the first particular satisfies not in common with the second the disjunctions of the atomic predicate it satisfies with any combination of the remaining n − 1 atomic predicates, except for the atomic predicate satisfied by the second particular (Watanabe, 1969, 377). So, as the first premise of the argument states, the number of (possible) predicates satisfied by two particulars which do not satisfy all the same (possible) predicates is a fixed constant, which equals the number of (possible) predicates satisfied by only the first and which equals the number of possible predicates satisfied by only the second (Watanabe, 1969, 376-377). So if there is a property corresponding to every (possible) predicate, and degree of resemblance is number of properties in common divided by number of properties in total, then it follows that the degree of resemblance between two particulars is 2n−2 2n−2 + 2n−2 + 2n−2 , which is 1 3 if n is finite and undefined otherwise. This is something so paradoxical that no one will believe it. 2 The Second Premise Sparse conceptions of properties deny that there is a property corresponding to every (possible) predicate, and so deny that the number of properties is the number of (pos23 sible) predicates. So it's natural for a proponent of the sparse conception to resist the conclusion of the argument by denying its second premise. As Gonzalez RodriguezPereyra (2002, 66-7), for example, writes: ... what Watanabe proved is not a problem ... for it is essential to his proof that the properties in question (or "predicates" to use his terminology) are the members of the smallest complete Boolean lattice of a given set of properties ... Thus if the properties of being red and being square are among the given sparse properties, their Boolean lattice will contain properties like being red and square, being red or not being square, being neither red nor square, etc. In general the lattice will contain negative, disjunctive, and conjunctive properties. But these are not sparse or natural ... Nevertheless, I will argue in this section that many conceptions of sparse properties cannot escape the absurd conclusion. Two clarifications. First, sparse conceptions of properties typically maintain that whether a property corresponds to a (possible) predicate is an a posteriori question. The existence of the property of being white, for example, cannot be deduced a priori from the existence of the corresponding predicate 'is white' (Armstrong, 1978b, 7-9). But even if whether a property corresponds to a (possible) predicate is an a posteriori question, it does not follow that there is nothing to be said in answer to that question in logical terms. Consider an analogy with probabilities. Although whether a proposition has a certain probability is plausibly an a posteriori question, there is much which can be said about 24 the relationship between probabilities in logical terms – for example, that if two propositions are inconsistent, then the sum of their probabilities is the probability of their disjunction. In this section of the paper, I want to focus particularly on sparse conceptions which articulate the relationships between properties in broadly logical terms. Many sparse conceptions of this kind, I will argue, do not escape the absurd conclusion. Second, some sparse conceptions of properties maintain that whether there is a property corresponding to a (possible) predicate is not only a posteriori, but revealed by fundamental physics. As David Lewis, for example, writes "Physics has its short list of 'fundamental physical properties': the charges and masses of particles, also their socalled 'spins' and 'colours' and 'flavours', ... an inventory of the sparse properties of this-worldly things" (Lewis, 1986b, 60). But fundamental physical properties are not the respects in which ordinary macroscopic objects typically resemble each other, so this conception of sparse properties is poorly suited to feature in the analysis of resemblance (Schaffer, 2004, 94). A natural way for proponents of sparse conceptions of properties to address this concern is to postulate the existence, in addition to the fundamental physical properties, of structural or complex properties, which depend on or derive from the fundamental physical properties. Then although ordinary macroscopic objects do not typically resemble each other in respect of fundamental physical properties, they may resemble each other in respect of the structural or complex properties which derive from the fundamental physical properties. But the existence and nature of sparse structural or complex properties is extremely 25 controversial (see, for example, Lewis (1986a)). The least controversial case is the example of conjunctive properties. But they are the source of the last and most serious problem I discuss below. I take it that if even the least controversial example of structural or complex properties is problematic, then it's likely that the more controversial examples of structural or complex properties will be even more problematic. In general, although I can't show that there is no sparse conception of properties which avoids the problems I raise, I will consider enough to show that those problems are no accident. I will begin with various toy examples which, while philosophically motivated, do not correspond to positions in the literature. I will then turn to the sparse conception of properties favoured by David Armstrong, which is one of the most influential positions in the literature. In another context, it may seem as if the problems with Armstrong's conception are an accident due to careless formulation (this seems to be John Bacon's (1986) view, for example). But in the context of these toy examples, it is apparent that the problems with Armstrong's conception are deep and robust. Some conceptions of sparse properties cannot escape the absurd conclusion that the degree of resemblance between any two different particulars is a fixed constant because they are not sparse enough. According to the principle of instantiation, for example, there is a property corresponding to a (possible) predicate only if some particular satisfies that (possible) predicate (Armstrong, 1978a, 113). So according to the principle of instantiation there is no property corresponding to the predicate 'is faster than the speed of light', for example, because nothing is faster than the speed of light. This suggests a sparse conception of properties according to which there is a property corresponding to 26 a (possible) predicate if and only if some particular satisfies that predicate. But just as every (possible) predicate corresponds to a disjunction of the n atoms, every unsatisfied (possible) predicate corresponds to a disjunction of the r unsatisfied atoms. So if there is a property corresponding to a (possible) predicate if and only if some particular satisfies that predicate, then the number of properties is not 2n, the number of (possible) predicates, but 2n − 2r, the number of (possible) predicates minus the number of unsatisfied (possible) predicates. Nevertheless, the number of properties a particular satisfies is still 2n−1, since none of the (possible) predicates it satisfies are unsatisfied, the number of properties two different particulars have in common still 2n−2, since none of the (possible) predicates satisfied by two particulars are unsatisfied, and the number of properties instantiated by only the first still 2n−2, since none of the (possible) predicates satisfied by two particulars are unsatisfied. So if the degree of resemblance between two particulars is their proportion of properties in common, the degree of resemblance between two different particulars is still 2n−2 2n−2 + 2n−2 + 2n−2 or 1 3 if defined. The principle of instantiation is sometimes combined with a principle of coinstantiation, according to which distinct properties correspond to (possible) predicates only if distinct particulars satisfy those (possible) predicates (Swoyer, 1996, 244). According to the principle of coinstantiation, distinct properties don't correspond to the predicates 'is a creature with a heart' and 'is a creature with a kidney', for example, because no particular satisfies 'is a creature with a heart' but not 'is a creature with a kidney' and vice versa. This suggests a sparse conception of properties according to which there are dis27 tinct properties corresponding to (possible) predicates if and only if distinct particulars satisfy those (possible) predicates, and so according to which the number of properties is the number of (possible) predicates satisfied by distinct particulars. Just as every (possible) predicate corresponds to a disjunction of the n atoms, every (possible) predicate satisfied by distinct particulars corresponds to a disjunction of the n− r satisfied atoms. So if distinct properties correspond to (possible) predicates if and only if distinct particulars satisfy those predicates, the number of properties is 2n−r, the number of properties a particular instantiates is 2n−r−1, the number of properties two different particulars have in common is 2n−r−2 and the number of properties instantiated by only the first is 2n−r−1− 2n−r−2 or 2n−r−2. So if degree of resemblance is proportion of properties in common, the degree of resemblance between two different particulars is 2n−r−2 2n−r−2 + 2n−r−2 + 2n−r−2 or still 1 3 if defined. Other conceptions of sparse properties cannot escape the absurd conclusion that the degree of resemblance between any two different particulars is a fixed constant because they are too sparse. Consider, for example, a sparse conception of properties according to which there is a property corresponding to every atomic (possible) predicate – in other words, those predicates which are not disjunctions of any others. Then the number of properties is n, the number of atomic predicates. Since the atomic (possible) predicates are all inconsistent with each other, no particular satisfies more than one. And since the disjunction of the atomic (possible) predicates is tautologous, every particular satisfies at least one. So the number of atomic (possible) predicates a particular satisfies is one, and the number of atomic (possible) predicates satisfied by two particulars which do not 28 satisfy all the same (possible) predicates is zero. So if properties correspond to atomic (possible) predicates and degree of resemblance is proportion of properties in common, then the degree of resemblance between any two different particulars is zero. More generally, let the rank of an element a = ∨ {b ∈ B | b ≤ a} in a lattice 〈A,≤〉 be the number | {b ∈ B | b ≤ a} | of the atoms B ⊆ A it is a disjunction of (Watanabe, 1969, 327). Then according to a less unaccommodatingly sparse conception, properties correspond to all and only the (possible) predicates of a certain finite rank r. The number of predicates of finite rank r, and so the number of properties according to this conception, is ( n r ) , the number of disjunctions of length r which can be formed from n predicates. The number of predicates of finite rank r satisfied by a particular is ( n− 1 r − 1 ) , since the disjunctions of length r which apply to it must include the single atom satisfied by the particular, but may include any r − 1 of the remaining n− 1 atoms. The number of predicates of finite rank r satisfied by two particulars which do not satisfy all the same predicates is ( n− 2 r − 2 ) , since the disjunctions of length r which apply to it must include the two atoms corresponding to the two combinations of simple predicates they satisfy, but may include any r−2 of the remaining n−2 atoms. And the number of predicates of finite rank r which are satisfied by only the first of two particulars which do not satisfy all the same predicates is ( n− 1 r − 1 ) − ( n− 2 r − 2 ) or ( n− 2 r − 1 ) , the number of predicates of finite rank r which are satisfied by both subtracted from the number of predicates of finite rank r which are satisfied by the first (Watanabe, 1969, 377). So the number of (possible) predicates of finite rank r satisfied by two particulars 29 which do not satisfy all the same (possible) predicates is a fixed constant, as is the number of (possible) predicates of rank r satisfied by only the first, which equals the number of (possible) predicates of rank r satisfied by only the second (Watanabe, 1969, 377). If properties correspond to (possible) predicates of finite rank r, and the degree of resemblance between two particulars is a function of their number of common and uncommon properties, then the degree of resemblance between two particulars is still a constant, which depends on the number of atomic (possible) predicates n and the rank r, but not on the choice of the two particulars. So whereas conceptions according to which the sparse properties correspond to the instantiated or coinstantiated (possible) predicates are not sparse enough to escape the conclusion that the degree of resemblance between two different particulars is constant, conceptions according to which the sparse properties correspond to the (possible) predicates of a certain rank, especially the conception according to which the sparse properties correspond to the atomic predicates (which are the (possible) predicates of rank one), are too sparse to escape the conclusion that the degree of resemblance between two different particulars is constant.18 This suggests pursuing a conception of properties of intermediate sparseness. I now turn to consider the intermediately sparse conception of properties favoured 18Although no conceptions in the literature correspond exactly to these two conceptions, some are just as unremittingly sparse. According to Rodriguez-Pereyra (2002, 48-52), for example, the sparse properties are "lowest determinate properties", and there are no negative, conjunctive or disjunctive sparse properties. I intend to consider Rodriguez-Pereyra's theory in more detail in another paper. 30 by David Armstrong, which is not merely a toy example, but one of the most influential in the literature. I will begin with a simplified version of Armstrong's conception, which ignores the principle of instantiation. I will then discuss Armstrong's actual conception, which includes the principle of instantiation. I will argue that neither conception succeeds in escaping the absurd conclusion that the degree of resemblance between two different particulars is a fixed constant, which does not depend on the choice of the two particulars. If we ignore the principle of instantiation, then Armstrong favours a conception of properties which meets the following three conditions: (negation) if there is a property corresponding to a (possible) predicate a, then there is no property corresponding to its negation ¬a, (disjunction) if there is a property corresponding to two (possible) predicates a and b and a 6= b, then there is no property corresponding to their disjunction a∨ b, and (conjunction) if there is a property corresponding to two (possible) predicates a and b, then there is a property corresponding to their conjunction a ∧ b (Armstrong, 1978b, 20-30). This conception of properties is too sparse, because it follows that a property corresponds to only one possible predicate. For suppose that there is a property corresponding to a and a property corresponding to b. Then according to (conjunction) there is a property corresponding to a∧ b. But since a is equivalent to a∨ (a∧ b) and b is equivalent to b∨ (a∧b), and because we have stipulated that equivalent predicates are the same, there is a property corresponding to a ∨ (a ∧ b) and a property corresponding to b ∨ (a ∧ b). Then according to (disjunction) a = a ∧ b and b = a ∧ b (otherwise a ∨ (a ∧ b) and 31 b∨ (a∧ b) would correspond to disjunctive properties), so a = b. So if there is a property corresponding to a and a property corresponding to b, then according to this conception, a = b (Bacon, 1986, 49). Because Armstrong accepts the principle of instantiation, he does not accept (conjunction) in full generality, and so it does not follow from Armstrong's conception that there is a property corresponding to only one (possible) predicate. Instead, Armstrong endorses: (instantiated conjunction) if there is a property corresponding to two (possible) predicates a and b and some particular satisfies both a and b, then there is a property corresponding to their conjunction a ∧ b (Armstrong, 1978b, 30). But Armstrong's conception is still too sparse, since it follows that each particular instantiates only one property. For suppose that there is a property corresponding to a and a property corresponding to b, and that some particular satisfies both a and b. Then according to (instantiated conjunction) there is a property corresponding to a∧ b. But since a = a ∨ (a ∧ b) and b = b ∨ (a ∧ b), there is a property corresponding to a ∨ (a ∧ b) and a property corresponding to b ∨ (a ∧ b). Then according to (disjunction) a = a ∧ b and b = a ∧ b, so a = b. So if there is a property corresponding to a and a property corresponding to b and some particular satisfies both a and b, then, according to Armstrong's conception, a = b (Bacon, 1986, 49). So Armstrong's conception of properties has similar consequences to the conception according to which the properties correspond to the atomic (possible) predicates. Supposing that that there are no bare particulars, or in other words that at least one of the (possible) predicates satisfied by a particular corresponds to a property, it follows 32 from Armstrong's conception that exactly one of the (possible) predicates satisfied by each particular corresponds to a property, or that the number of properties a particular instantiates is one. The number of properties instantiated by two different particulars is zero, since the one property each satisfies must be different if they are different. So if their degree of resemblance is their proportion of properties in common, then their degree of resemblance is zero. 3 The Third Premise A natural way for proponents of abundant conceptions of properties to avoid the conclusion of the argument is to revise the premise that the degree of resemblance between two different particulars is a function of their number of common and uncommon properties. Different properties, according to this revision, have different weights in determining degrees of resemblance: the degree of resemblance between two different particulars is a function of the weights of the properties they have in common, the weights of the properties the first has not in common with the second, and the weights of the properties the second has not in common with the first. Revising the premise that the degree of resemblance between two different particulars is a function of their number of common and uncommon properties to the thesis that the degree of resemblance between two different particulars is a weighted function of their common and uncommon properties must be at least as good a way to avoid the barely believable conclusion as adopting a given sparse conception of properties, because if the weights of the predicates are given by the function w : A → {0, 1} which takes each 33 predicate in A to one if it corresponds to a property according to the sparse conception but to zero if it does not, then the revision to the premise can give the same number (if defined) as the degree of resemblance between two particulars as the given sparse conception of properties did. Note that proponents of abundant conceptions of properties disagree over the question, which I shall not try to resolve, of whether the weights should be interpreted as subjective degrees of importance (as Nelson Goodman (1972), for example, argues) or objective degrees of naturalness (as David Lewis (1983), for example, argues). Nevertheless, I will argue in this section that even without resolving this question, there is more to be said in logical terms about the nature of weights than there is to be said in logical terms about which predicates correspond to properties according to an appropriate sparse conception. Reconsider the analogy with probabilities. Even though there is disagreement about whether the probability of a proposition should be interpreted in terms of subjective credences or objective chances, there is much to be said about the relationship between probability in logical terms – for example, that if two propositions are inconsistent, then the sum of their probability is the probability of their disjunction – which is independent of this issue. In this section of the paper, I want to focus particularly on what can be said about the nature of weights in logical terms. The analogy with probabilities suggests that the weights should be given by a function w : A → R from the set of predicates A to the real numbers such that for all a ∈ A, w(a) = 1 − p(a), where p : A → R is a function from the set of predicates A to the 34 real numbers which meets the following three conditions: (non-negativity) for all a ∈ A, 0 ≤ p(a), (normalisation) p(>) = 1 and (finite additivity) for all a, b ∈ A such that a∧ b = ⊥, p(a∨ b) = p(a) + p(b). The weight of a property, according to this idea, is the opposite of it's peculiarity, where the minimum degree of peculiarity is zero, predicates which apply to everything have the maximum degree of peculiarity, and the peculiarity of a disjunction is the sum of the peculiarity of its disjuncts, when they are inconsistent. This characterisation of the weighting function captures the desired asymmetry between conjunctive and disjunctive properties which sparse conceptions which maintained that properties exist corresponding to conjunctive but not to disjunctive predicates were unable to. For for any pair of predicates a, b ∈ A such that a ≤ b or a entails b, it follows that p(a) ≤ p(b). And since for all a, b ∈ A, a ∧ b ≤ a ≤ a ∨ b it follows that for all a, b ∈ A, p(a∧ b) ≤ p(a) ≤ p(a∨ b) or, in other words, that the weight of a conjunction is greater than or equal to the weight of the conjuncts, whereas the weight of a disjunction is less than or equal to the weight of the disjuncts. But this characterization of the weighting function also has three counterintuitive consequences. Firstly, if p(a) = 0 and p(b) = 0 it follows from finite additivity that p(a∨b) = 0. But if 'is red' and 'is green', for example, are not at all peculiar or perfectly natural (as Lewis (1983, 347) would say), it shouldn't follow that their disjunction 'is red or green' is not at all peculiar or perfectly natural, since there is a wider diversity between the things which are red or green than between the things which are red or than between the things which are green. Secondly, if p(a) = p(b), p(c) = p(d), a ∧ c = ⊥, and b ∧ d = ⊥, it follows from 35 finite additivity that p(a ∨ c) = p(b ∨ d). But if 'is red' and 'is yellow' are peculiar or natural to the same degree, and 'is orange' and 'is purple' are peculiar or natural to the same degree, it shouldn't follow that 'is red or orange' is peculiar or natural to the same degree as 'is yellow or purple'. Rather, 'is red or orange' should have a higher weight in determining degree of resemblance and a lower degree of peculiarity than 'is yellow or purple', since red and orange particulars are similar with respect to colour whereas yellow and purple particulars are not. Thirdly, suppose finite additivity is strengthed to (ultra-additivity), according to which for every subset, finite or infinite, B ⊆ A such that a ∧ b = ⊥ for all a, b ∈ B, p( ∨ B) = ∑ b∈B p(b). 19 Then if there is an infinite subset B ⊆ A such that a ∧ b = ⊥ for all a, b ∈ B and every predicate b ∈ B is peculiar to the same non-negative degree, the sum p( ∨ B) = ∑ b∈B p(b) must be zero or infinite. But if p( ∨ B) = ∑ b∈B p(b) is infinite, this contradicts the fact that for all a ∈ A, p(a) ≤ 1. So if there is an infinite subset B ⊆ A such that a ∧ b = ⊥ for all a, b ∈ B and every predicate b ∈ B is peculiar to the same non-negative degree, then the sum p( ∨ B) = ∑ b∈B p(b) is zero. However, it seems as if there are infinite sets of predicates which all have the same non-negative degree of peculiarity. It seems, for example, that there is an infinite number of determinate shades of colour, which all have equal weight in determining degree of resemblance. Their equal degree of peculiarity cannot be positive, since then the degree of peculiarity of their disjunction 'is coloured' would be an infinite number greater than one, contradicting the fact that all degrees of peculiarity are real numbers less than one. 19The name "ultra-additivity" comes from Skyrms (1983, 227). 36 So their equal degree of peculiarity must be zero, and the sum of their zero degrees of peculiarity or the degree of peculiarity of their disjunction 'is coloured' must be zero too. But since there is a great deal of heterogeneity amongst the things that are coloured, the degree of peculiarity of 'is coloured' should be greater than zero. This third problem is the least pressing, since it arises equally for the case of probability and measurement in general, where the denial of ultra-additivity is the modern solution to Zeno's paradox of measure (Skyrms, 1983, 235). Moreover, it is just one of many other counterintuitive results concerning infinity – such as the Vitali, Hausdorff, and Banch-Tarski paradoxes – which afflict probability and measurement in general (Skyrms, 1983, 242-5). But since the first two problems arise even in the finite case, infinity is not the whole source of the problem, and a problem arises even if ultra-additivity is denied. Moreover, the first two problems do not have any probabilistic analogue. So to avoid them, a different solution must be sought. In order to escape these problems with this approach, one not unnatural proposal is to weaken finite additivity to require that the peculiarity of the disjunction of inconsistent predicates is not strictly equal to but merely greater than or equal to the sum of the disjunctions or, in other words, to: (finite superadditivity) for all a, b ∈ A such that a ∧ b = ⊥, p(a ∨ b) ≥ p(a) + p(b).20 The peculiarity of a disjunction such as 'is red or orange', for example, is greater than or equal to the sum of the peculiarities of the disjuncts 'is red' and 'is orange'. This characterisation still captures the desired asymmetry between conjunctive and 20The name "superadditivity" comes from Wang and Klir (2009, 67). 37 disjunctive properties. For for all predicates a, b ∈ A such that a ≤ b, b = a∨(b∧¬a), and so it follows from finite superadditivity that p(b) ≥ p(a) + p(b ∨ ¬a) and so p(b) ≥ p(a). So it still follows that for all a, b ∈ A, p(a ∧ b) ≤ p(a) ≤ p(a ∨ b) or, in other words, that the weight of a conjunction is greater than or equal to the weight of the conjuncts, whereas the weight of a disjunction is less than or equal to the weight of the disjuncts. But the three counterintuitive consequence don't follow. Firstly, even if p(a) = 0 and p(b) = 0, it doesn't follow that p(a ∨ b) = 0, but only that p(a ∨ b) ≥ 0. If 'is red' and 'is green', for example, are perfectly natural or not at all peculiar, 'is red or green' may still be less than perfectly natural or somewhat peculiar. Secondly, even if p(a) = p(b), p(c) = p(d), a ∧ c = ⊥ and b ∧ d = ⊥, it doesn't follow that p(a∨ c) = p(b∨ d), but only that p(a∨ c) ≥ p(a) + p(c) = p(b) + p(d) ≤ p(b∨ d). So even if 'is red' and 'is yellow' are peculiar or natural to the same degree, and 'is orange' and 'is purple' are peculiar or natural to the same degree, it doesn't follow that 'is red or orange' is peculiar or natural to the same degree as 'is yellow or purple'. Thirdly, suppose finite superadditivity is strengthened to (ultra-superadditivity), according to which for every subset, finite or infinite, B ⊆ A such that a ∧ b = ⊥ for all a, b ∈ B, p( ∨ B) ≥ ∑ b∈B p(b). Then even if there is an infinite subset B ⊆ A such that a∧ b = ⊥ for all a, b ∈ B and every predicate b ∈ B is natural to the same non-negative degree, the sum ∑ b∈B p(b) must still be zero or infinite. Since ∑ b∈B p(b) cannot be infinite, it must be zero. However, it only follows from this and ultra-superadditivity that p( ∨ B) ≥ 0, which is unexceptionable. Supposing, for example, that there is an infinite number of determinate shades of 38 colour, which all have equal non-negative weight in determining degree of resemblance. Their equal degree of peculiarity still cannot be positive, since then the degree of peculiarity of their disjunction 'is coloured' or the sum of their equal degrees of peculiarity would be an infinite number greater than one. So their equal degree of peculiarity must be zero. But it follows from this and ultra-superadditivity only that the degree of peculiarity of their disjunction 'is coloured' is greater than or equal to zero, which is unexceptionable. 4 Conclusion In order to escape the barely believable conclusion that the degree of resemblance between two different particulars is a fixed constant, independent of the choice of the two particulars, one must deny either the first, second or third premise of the argument. This section concludes by reconsidering each option in light of the preceding discussion, and arguing for the third. The rationale for the first premise was divided into a provable part, that the number of elements in a complete boolean lattice with n atoms is 2n, and a plausible part, that the (possible) predicates ordered by entailment are a complete boolean lattice. So one may deny the first premise either by rejecting the provable part, and denying that the number of elements in a complete boolean lattice with n atoms is 2n, or denying the very plausible part, that the (possible) predicates ordered by entailment are a complete boolean lattice. The only controversial assumption of the proof that the number of elements in a 39 complete boolean lattice with n atoms is 2n was the axiom of choice, which was required to prove the existence of the atoms in the infinite case. Since it's easy in the infinite case to form the impression that infinity is the source of the problem, and since the axiom of choice is associated with many counterintuitive results concerning infinity, it's tempting to attempt to escape the barely believable conclusion in the infinite case by denying the axiom of choice. But since the conclusion of the argument is equally barely believable even in the finite case, and since the axiom of choice is not needed for the proof in the finite case, denying the axiom of choice does not lead to a general solution of the problem. Given this, it seems most likely that the axiom of choice is not the source of the problem even in the infinite case. Likewise, the most controversial assumption of the plausible part is that the boolean lattice of (possible) predicates under the relation of entailment is a complete lattice or, in other words, that every infinite set of (possible) predicates has a disjunction and a conjunction. Since it's easy in the infinite case to form the impression that infinity is the source of the problem, and since the existence of arbitrary infinite disjunctions and conjunctions is associated with other counterintuitive results, it's tempting to escape the barely believable conclusion in the infinite case by denying that the boolean lattice of (possible) predicates under the relation of entailment is complete. But since the conclusion of the argument is equally barely believable even in the finite case, and since the assumption that the lattice of (possible) predicates is complete is not needed for the proof in the finite case, denying the assumption of completeness 40 does not lead to a general solution of the problem. Given this, it seems most likely that completeness is not the source of the problem even in the infinite case. The second premise was motivated by an abundant conception of properties, according to which there is a property corresponding to every (possible) predicate. So one may motivate denying the second premise by adopting a sparse conception of properties. I considered two kinds of sparse conceptions of properties above. The first denied the existence of properties corresponding to uninstantiated or coextensive predicates. The second denied the existence of properties corresponding to negative, disjunctive and conjunctive predicates. I also considered David Armstrong's extremely influential conception of sparse properties, according to which there are instantiated conjunctive, but no negative, disjunctive or uninstantiated properties. It does not follow from these results that there is no sparse conception of properties which escapes the barely believable conclusion.21 And for any particular lattice of (possible) predicates, it seems possible to identify which (possible) predicates in the lattice contribute towards resemblance between the particulars which satisfy them, and so which (possible) predicates correspond to predicates. But it does not seem possible to clarify which (possible) predicates contribute towards resemblance using the resources available here, so I am pessimistic about the prospects of resolving the problem by adopting a 21Peter Gardenfors (2000, 59-100) and Graham Oddie (2005, 152-158), for example, present a sparse conception of properties which is like Armstrong's in accepting that all conjunctions of sparse properties are properties, but differs from Armstrong's in only denying that some negative and disjunctive properties are. But Blumson (2019) proves this conception does not overcome the problems with Armstrong's. 41 sparse conception of properties. The third premise was motivated by the analysis of resemblance as having properties in common, which suggests that the more properties particulars have in common, the more they resemble each other, and the more properties particulars have not in common with each other, the less they resemble each other. One way to avoid the barely believable conclusion, while retaining what is intuitive about this premise, is to argue that the degree of resemblance is a function of the weights of the properties they have in common and the weights of the properties they have not in common. But perhaps unsurprisingly, adding rather natural assumptions about the weights of various (possible) predicates, while recapturing some of what was intuitive about sparse conceptions of properties which deny the existence of properties corresponding to negative and disjunctive predicates, led to a conception of degrees of importance or naturalness which still failed to escape the barely believable conclusion that the degree of resemblance between two different particulars is a fixed constant, independent of the choice of the two particulars. In this case, however, a natural weakening of the assumptions seemed to lead to a better conception, according to which the weight of a predicate is always non-negative, the weight of predicates necessarily satisfied by everything is zero, and the weight of disjunctions of inconsistent predicates is always less than or equal to the weight of their disjuncts. This is the solution about which I'm most optimistic. 42 References Armstrong, D. (1978a). Nominalism and Realism, Cambridge University Press, Cambridge. Armstrong, D. (1978b). A Theory of Universals, Cambridge University Press, Cambridge. Armstrong, D. (1989). Universals, Westview Press, Boulder. Bacon, J. (1986). Armstrong's theory of properties, Australasian Journal of Philosophy 64(1): 47–53. Bigelow, J. (1976). Possible Worlds Foundations for Probability, Journal of Philosophical Logic 5(3): 299–320. Bigelow, J. (1977). Semantics of Probability, Synthese 36(4): 459–472. Bjerring, J. C. and Schwarz, W. (2017). Granularity Problems, The Philosophical Quarterly 67(266): 22–37. Blumson, B. (2014a). A Never-Ending Story, Croatian Journal of Philosophy 14(40): 111–120. Blumson, B. (2014b). Resemblance and Representation, Open Book Publishers, Cambridge. Blumson, B. (2018a). Distance and Dissimilarity, Philosophical Papers 48(2): 211–239. 43 Blumson, B. (2018b). Two Conceptions of Similarity, The Philosophical Quarterly 270(1): 21–37. Blumson, B. (2019). Naturalness and Convex Class Nominalism, Dialectica 73(1-2): 65– 81. Byrne, A. (2003). Color and Similarity, Philosophy and Phenomenological Research 66(3): 641–665. Collins, J. (2010). How Long Can a Sentence Be and Should Anyone Care?, Croatian Journal of Philosophy 10(3): 199–207. Cook, R. T. (2014). Possible Predicates and Actual Properties, Synthese pp. 1–28. Cowling, S. (2017). Resemblance, Philosophy Compass 12(4): e12401. Davey, B. A. and Priestly, H. A. (2002). Introduction to Lattices and Order, Cambridge University Press, Cambridge. Decock, L. and Douven, I. (2011). Similarity After Goodman, Review of Philosophy and Psychology 2(1): 61–75. Dorr, C. and Hawthorne, J. (2013). Naturalness, in K. Bennett and D. Zimmerman (eds), Oxford Studies in Metaphysics, Vol. 8, Oxford University Press, Oxford, pp. 2–77. Feldman, J. (1997). The Structure of Perceptual Categories, Journal of Mathematical Psychology 41(2): 145–170. 44 Field, H. (2004). The Consistency of the Näıve Theory of Properties, Philosophical Quarterly 54(214): 78–104. Gardenfors, P. (2000). Conceptual Spaces: The Geometry of Thought, MIT Press, Cambridge, Mass. Goodman, N. (1972). Seven Strictures on Similarity, Problems and Projects, BobbsMerril, Indianapolis. Gratzer, G. (2011). Lattice Theory: Foundation, Springer, Basel. Guigon, G. (2014). Overall Similarity, Natural Properties, and Paraphrases, Philosophical Studies 167(2): 387–399. Hale, B. (2013). Properties and the Interpretation of Second-Order Logic, Philosophia Mathematica 21(2): 133–156. Hale, B. (2015). Second-Order Logic: Properties, Semantics, and Existential Commitments, Synthese pp. 1–27. Isaac, A. M. C. (2013). Objective Similarity and Mental Representation, Australasian Journal of Philosophy 91(4): 683–704. Kroedel, T. and Huber, F. (2013). Counterfactual Dependence and Arrow, Nous 47(3): 453–466. Langendoen, D. T. and Postal, P. M. (1986). The Vastness of Natural Languages, Linguistics and Philosophy 9(2): 225–243. 45 Lewis, D. (1973). Counterfactuals, Blackwell, Oxford. Lewis, D. (1983). New Work for a Theory of Universals, Australasian Journal of Philosophy 61(4): 343–377. Lewis, D. (1986a). Against Structural Universals, Australasian Journal of Philosophy 64(1): 25–46. Lewis, D. (1986b). On the Plurality of Worlds, Blackwell, Oxford. Maclaurin, J. and Sterelny, K. (2008). What Is Biodiversity?, University of Chicago Press. Medin, D. L., Goldstone, R. L. and Gentner, D. (1993). Respects for Similarity., Psychological Review 100(2): 254. Morreau, M. (2010). It Simply Does Not Add Up: Trouble with Overall Similarity, Journal of Philosophy 107(9): 469–490. Mundy, J. L. (1995). Object Recognition: The Search for Representation, in M. Hebert, J. Ponce, T. Boult and A. Gross (eds), Object Representation in Computer Vision, Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 19–50. Niiniluoto, I. (1987). Truthlikeness, Kluwer, Dordrecht. Oddie, G. (1986). Likeness to Truth, Kluwer, Dordrecht. Oddie, G. (2005). Value, Reality, and Desire, Oxford University Press, Oxford. Oliver, A. (1996). The Metaphysics of Properties, Mind 105(417): 1–80. 46 Ott, W. (2016). Phenomenal Intentionality and the Problem of Representation, Journal of the American Philosophical Association 2(1): 131–145. Paseau, A. (2012). Resemblance Theories of Properties, Philosophical Studies 157(3): 361–382. Paseau, A. (2015). Six Similarity Theories of Properties, in G. Guigon and G. RodriguezPereya (eds), Nominalism about Properties, Routledge. Priest, G. (2008). From If to Is: An Introduction to Non-Classical Logic, Cambridge University Press, Cambridge. Quinton, A. (1957). Properties and Classes, Proceedings of the Aristotelian Society 58: 33–58. Rodriguez-Pereyra, G. (2002). Resemblance Nominalism, Oxford University Press, Oxford. Russell, B. (1918). The Philosophy of Logical Atomism, The Monist 28(4): 495–527. Schaffer, J. (2004). Two Conceptions of Sparse Properties, Pacific Philosophical Quarterly 85(1): 92–102. Sider, T. (1993). Naturalness, Intrinsicality, and Duplication, PhD thesis, University of Massachusetts, Amherst. Skyrms, B. (1983). Zeno's Paradox of Measure, in R. S. Cohen and L. Laudan (eds), Physics, Philosophy and Psychoanalysis: Essays in Honour of Adolf Grun47 baum, Boston Studies in the Philosophy of Science, Springer Netherlands, Dordrecht, pp. 223–254. Sterrett, S. G. (2009). Similarity and Dimensional Analysis, in A. Meijers (ed.), Philosophy of Technology and Engineering Sciences, Handbook of the Philosophy of Science, North-Holland, Amsterdam, pp. 799–823. Stone, M. H. (1936). The Theory of Representation for Boolean Algebras, Transactions of the American Mathematical Society 40(1): 37–111. Suppes, P., Krantz, D., Luce, D. and Tversky, A. (1989). Foundations of Measurement, Vol. 2, Academic Press, San Diego. Swoyer, C. (1996). Theories of Properties: From Plenitude to Paucity, Philosophical Perspectives 10: 243–264. Towster, E. (1975). Two Ugly Duckling Theorems for Concept-Formers, Information Sciences 8(4): 359–368. Tversky, A. (1977). Features of Similarity, Psychological Review 84: 327–352. Wang, Z. and Klir, G. J. (2009). Generalized Measure Theory, number 25 in IFSR International Series on Systems Science and Engineering, Springer, New York. Watanabe, S. (1969). Knowing and Guessing, Wiley, New York. Watanabe, S. (1985). Pattern Recognition: Human and Mechanical, John Wiley &amp; Sons, Inc., New York, NY, USA. 48 Weisberg, M. (2012). Getting Serious About Similarity, Philosophy of Science 79(5): 785–794. Williamson, T. (1988). First-Order Logics for Comparative Similarity, Notre Dame Journal of Formal Logic 29(4): 457–481. Yi, B.-u. (2018). Nominalism and Comparative Similarity, Erkenntnis 83(4): 793–803.