Free choice, simplification, and Innocent Inclusion
We propose a modification of the exhaustivity operator from Fox (in: Sauerland and Stateva (eds) Presupposition and implicature in compositional semantics, Palgrave Macmillan, London, pp 71–120, 2007. https://doi.org/10.1057/9780230210752_4) that on top of negating all the Innocently Excludable alte...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Science and Business Media LLC
2020
|
| Online Access: | https://hdl.handle.net/1721.1/128853 |
| _version_ | 1826199568594763776 |
|---|---|
| author | Bar-Lev, Moshe E. Fox, Daniel |
| author2 | Massachusetts Institute of Technology. Department of Linguistics and Philosophy |
| author_facet | Massachusetts Institute of Technology. Department of Linguistics and Philosophy Bar-Lev, Moshe E. Fox, Daniel |
| author_sort | Bar-Lev, Moshe E. |
| collection | MIT |
| description | We propose a modification of the exhaustivity operator from Fox (in: Sauerland and Stateva (eds) Presupposition and implicature in compositional semantics, Palgrave Macmillan, London, pp 71–120, 2007. https://doi.org/10.1057/9780230210752_4) that on top of negating all the Innocently Excludable alternatives affirms all the ‘Innocently Includable’ ones. The main result of supplementing the notion of Innocent Exclusion with that of Innocent Inclusion is that it allows the exhaustivity operator to identify cells in the partition induced by the set of alternatives (assign a truth value to every alternative) whenever possible. We argue for this property of ‘cell identification’ based on the simplification of disjunctive antecedents and the effects on free choice that arise as the result of the introduction of universal quantifiers. We further argue for our proposal based on the interaction of only with free choice disjunction. |
| first_indexed | 2024-09-23T11:22:03Z |
| format | Article |
| id | mit-1721.1/128853 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T11:22:03Z |
| publishDate | 2020 |
| publisher | Springer Science and Business Media LLC |
| record_format | dspace |
| spelling | mit-1721.1/1288532022-10-01T03:08:21Z Free choice, simplification, and Innocent Inclusion Bar-Lev, Moshe E. Fox, Daniel Massachusetts Institute of Technology. Department of Linguistics and Philosophy We propose a modification of the exhaustivity operator from Fox (in: Sauerland and Stateva (eds) Presupposition and implicature in compositional semantics, Palgrave Macmillan, London, pp 71–120, 2007. https://doi.org/10.1057/9780230210752_4) that on top of negating all the Innocently Excludable alternatives affirms all the ‘Innocently Includable’ ones. The main result of supplementing the notion of Innocent Exclusion with that of Innocent Inclusion is that it allows the exhaustivity operator to identify cells in the partition induced by the set of alternatives (assign a truth value to every alternative) whenever possible. We argue for this property of ‘cell identification’ based on the simplification of disjunctive antecedents and the effects on free choice that arise as the result of the introduction of universal quantifiers. We further argue for our proposal based on the interaction of only with free choice disjunction. 2020-12-17T22:54:44Z 2020-12-17T22:54:44Z 2020-03 2020-09-24T20:37:14Z Article http://purl.org/eprint/type/JournalArticle 0925-854X 1572-865X https://hdl.handle.net/1721.1/128853 Bar-Lev, Moshe E. and Danny Fox. "Free choice, simplification, and Innocent Inclusion." Natural Language Semantics 28, 3 (September 2020): 175–223 © 2020 Springer Nature B.V. en https://doi.org/10.1007/s11050-020-09162-y Natural Language Semantics Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ Springer Nature B.V. application/pdf Springer Science and Business Media LLC Springer Netherlands |
| spellingShingle | Bar-Lev, Moshe E. Fox, Daniel Free choice, simplification, and Innocent Inclusion |
| title | Free choice, simplification, and Innocent Inclusion |
| title_full | Free choice, simplification, and Innocent Inclusion |
| title_fullStr | Free choice, simplification, and Innocent Inclusion |
| title_full_unstemmed | Free choice, simplification, and Innocent Inclusion |
| title_short | Free choice, simplification, and Innocent Inclusion |
| title_sort | free choice simplification and innocent inclusion |
| url | https://hdl.handle.net/1721.1/128853 |
| work_keys_str_mv | AT barlevmoshee freechoicesimplificationandinnocentinclusion AT foxdaniel freechoicesimplificationandinnocentinclusion |