Journal of Semantics Advance Access published online on July 17, 2006
Journal of Semantics, doi:10.1093/jos/ffl004
| ||||||||||||||||||||||||||||||||||||||||||||||||
1 Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Nieuwe Doelenstraat 15, 1012 CP Amsterdam
* To whom correspondence should be addressed. 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.
Received February 21, 2006
Revised May 8, 2006
Accepted June 18, 2006
Article
Free Choice Counterfactual Donkeys
Robert van Rooij 1 *
Robert van Rooij, E-mail: R.A.M.vanRooij{at}uva.nl
![]()
Abstract ![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
Y. Wang Counterfactual Donkey Sentences: A Response to Robert van Rooij J Semantics, August 1, 2009; 26(3): 317 - 328. [Abstract] [Full Text] [PDF] |
||||
