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.

中文翻译：

---

自由选择，简化和无害的包容

我们提议对Fox的穷举运算符进行修改（在：Sauerland and Stateva（eds）组成语义中的预设和隐含，Palgrave Macmillan，伦敦，第71–120页，2007年。https://doi.org/10.1057/9780230210752_4）在否定所有无辜排他性替代品之上，肯定了所有“无辜包含”替代品。用Innocent Inclusion补充Innocent Exclusion概念的主要结果是，它使穷举性运算符可以在可能的情况下识别由一组备选方案（向每个备选方案分配真值）引起的分区中的单元格。我们基于分离性先例的简化以及由于引入通用量词而产生的对自由选择的影响，为“细胞识别”的这一特性辩护。只有自由选择析取。