Abstract

This paper attempts a critical reappraisal of Nagel's (1961, 1970) model of reduction taking into account both traditional criticisms and recent defenses. This model treats reduction as a type of explanation in which a reduced theory is explained by a reducing theory after their relevant representational items have been suitably connected. In accordance with the deductive-nomological model, the explanation is supposed to consist of a logical deduction. Nagel was a pluralist about both the logical form of the connections between the reduced and reducing theories (which could be conditionals or biconditionals) and their epistemological status (as analytic connections, conventions, or synthetic claims). This paper defends Nagel's pluralism on both counts and, in the process, argues that the multiple realizability objection to reductionism is misplaced. It also argues that the Nagel model correctly characterizes reduction as a type of explanation. However, it notes that logical deduction must be replaced by a broader class of inferential techniques that allow for different types of approximation. Whereas Nagel (1970), in contrast to his earlier position (1961), recognized the relevance of approximation, he did not realize its full import for the model. Throughout the paper two case studies are used to illustrate the arguments: the putative reduction of classical thermodynamics to the kinetic theory of matter and that of classical genetics to molecular biology.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.