.png){kind=icon}
.png){kind=icon}
Return
Supervenience and Boolean Reduction
.png){kind=icon}
PRE
AI
DOI：10.1111/phpr.70118.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop a novel framework for analyzing and comparing different varieties of supervenience. We introduce a new two-dimensional family of metaphysical determination relations, which we call "Boolean reducibility relations," and show that many varieties of supervenience-including strong and weak individual supervenience, strong and weak modal operator supervenience, and strong global supervenience-are mathematically equivalent to specific Boolean reducibility relations. With this framework, we can clarify and generalize the concept of supervenience. Furthermore, we use it to show that many widely accepted claims in the literature involve superfluous assumptions and can be strengthened, while others are erroneous and need to be corrected. These include claims by Kim, McLaughlin and Bennett, Stalnaker, Bacon, Shagrir, and others.
Keywords:
GLOBAL SUPERVENIENCE
Journal
P
IF:
1.4
Papers:
56
Citations:
3.5K