Article contents
AN ARGUMENT FOR CONJUNCTION CONDITIONALIZATION
Published online by Cambridge University Press: 22 July 2013
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2013
References
BIBLIOGRAPHY
- 14
- Cited by