Abstract
Consider the reasonable axioms of subjunctive conditionals (1) if p q 1 and p q 2 at some world, then p (q 1 & q 2) at that world, and (2) if p 1 q and p 2 q at some world, then (p 1 ∨ p 2) q at that world, where p q is the subjunctive conditional. I show that a Lewis-style semantics for subjunctive conditionals satisfies these axioms if and only if one makes a certain technical assumption about the closeness relation, an assumption that is probably false. I will then show how Lewisian semantics can be modified so as to assure (1) and (2) even when the technical assumption fails, and in fact in one sense the semantics actually becomes simpler then.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
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.