The Mixed Solution to the Number Problem

in Journal of Moral Philosophy
Restricted Access
Get Access to Full Text
Rent on DeepDyve

Have an Access Token?



Enter your access token to activate and access content online.

Please login and go to your personal user account to enter your access token.



Help

Have Institutional Access?



Access content through your institution. Any other coaching guidance?



Connect

Abstract

You must either save a group of m people or a group of n people. If there are no morally relevant differences among the people, which group should you save? This problem is known as the number problem. The recent discussion has focussed on three proposals: (i) Save the greatest number of people, (ii) Toss a fair coin, or (iii) Set up a weighted lottery, in which the probability of saving m people is m/m+n, and the probability of saving n people is n/m+n. This contribution examines a fourth alternative, the mixed solution, according to which both fairness and the total number of people saved count. It is shown that the mixed solution can be defended without assuming the possibility of interpersonal comparisons of value.

The Mixed Solution to the Number Problem

in Journal of Moral Philosophy

Sections

Index Card

Content Metrics

Content Metrics

All Time Past Year Past 30 Days
Abstract Views 8 8 7
Full Text Views 2 2 2
PDF Downloads 2 2 2
EPUB Downloads 0 0 0