Answers are grounded in this paper and cite their sources.
We propose a straightforward analysis of counterfactual donkey sentences, by combining the Lewis/Stalnaker analysis of counterfactuals with standard dynamic semantics. The main idea is to define a similarity relation between world-assignment pairs such that two such pairs are unconnected if their assignments differ. We show that with the help of this ordering relation we can also account for a number of related problems involving disjunctions and the use of any in counterfactuals and permission sentences.
No takes yet. Share an insight, caveat, or question.
Robert van Rooij (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: