Counting on Strong Composition as Identity to Settle the Special Composition Question

Erkenntnis 82 (4):857-872 (2017)
  Copy   BIBTEX

Abstract

Strong Composition as Identity is the thesis that necessarily, for any xs and any y, those xs compose y iff those xs are non-distributively identical to y. Some have argued against this view as follows: if some many things are non-distributively identical to one thing, then what’s true of the many must be true of the one. But since the many are many in number whereas the one is not, the many cannot be identical to the one. Hence is mistaken. Although I am sympathetic to this objection, in this paper, I present two responses on behalf of the theorist. I also show that once the defender of accepts one of these two responses, that defender will be able to answer The Special Composition Question.

Author's Profile

Joshua Spencer
University of Wisconsin, Milwaukee

Analytics

Added to PP
2016-10-08

Downloads
212 (#37,314)

6 months
33 (#31,726)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?