Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T06:05:45.943Z Has data issue: false hasContentIssue false

AN ARGUMENT FOR CONJUNCTION CONDITIONALIZATION

Published online by Cambridge University Press:  22 July 2013

LEE WALTERS*
Affiliation:
Somerville College, Oxford
J. ROBERT G. WILLIAMS*
Affiliation:
University of Leeds
*
*SOMERVILLE COLLEGE OXFORD, OX2 6HD, UK E-mail: lee.walters@philosophy.ox.ac.uk
†DEPARTMENT OF PHILOSOPHY UNIVERSITY OF LEEDS WOODHOUSE LANE, LEEDS LS2 9JT, UK E-mail: j.r.g.williams@leeds.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Are counterfactuals with true antecedents and consequents automatically true? That is, is Conjunction Conditionalization: (X ∧ Y) ⊃ (X > Y) valid? Stalnaker and Lewis think so, but many others disagree. We note here that the extant arguments for Conjunction Conditionalization are unpersuasive, before presenting a family of more compelling arguments. These arguments rely on some standard theorems of the logic of counterfactuals as well as a plausible and popular semantic claim about certain semifactuals. Denying Conjunction Conditionalization, then, requires rejecting other aspects of the standard logic of counterfactuals or else our intuitive picture of semifactuals.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013