2019
DOI: 10.1007/s10988-019-09286-3
|View full text |Cite
|
Sign up to set email alerts
|

Connectedness as a constraint on exhaustification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 21 publications
0
13
0
Order By: Relevance
“…Thus perhaps this interpretation fails to arise in the scope of negation not simply because it would be less informative than the basic semantic one, but rather because it would be uninformative in a particular way, describing a disjoint rather than convex region of the relevant scale. In fact, exactly this sort of explanation is proposed by Enguehard & Chemla (2019) for the unavailability of certain readings of weak scalar items that could in principle be generated by the application of a covert exhaustification operator: these are blocked, they argue, by a constraint that specifies that parses resulting in non-connected meanings are dispreferred. While the specifics of their account differ from ours, the central idea is very similar.…”
Section: Beyond Bare Numeralsmentioning
confidence: 95%
“…Thus perhaps this interpretation fails to arise in the scope of negation not simply because it would be less informative than the basic semantic one, but rather because it would be uninformative in a particular way, describing a disjoint rather than convex region of the relevant scale. In fact, exactly this sort of explanation is proposed by Enguehard & Chemla (2019) for the unavailability of certain readings of weak scalar items that could in principle be generated by the application of a covert exhaustification operator: these are blocked, they argue, by a constraint that specifies that parses resulting in non-connected meanings are dispreferred. While the specifics of their account differ from ours, the central idea is very similar.…”
Section: Beyond Bare Numeralsmentioning
confidence: 95%
“…What's needed is to replace (9) with a principle that still disallows EXH under negation in cases like (4-a), but allows it in cases like (2-a). A recent proposal in the literature, Enguehard & Chemla (2018), has independently argued for a principle that achieves exactly this. Enguehard & Chemla (2018) argue that the standard formulation in (9) based on logical strength should be replaced by a constraint based on a notion of 'connectedness,' a logical notion related to monotonicity.…”
Section: (4-a)mentioning
confidence: 99%
“…A recent proposal in the literature, Enguehard & Chemla (2018), has independently argued for a principle that achieves exactly this. Enguehard & Chemla (2018) argue that the standard formulation in (9) based on logical strength should be replaced by a constraint based on a notion of 'connectedness,' a logical notion related to monotonicity. Roughly, the principle in (23) makes a parse strongly dispreferred if it doesn't give rise to a connected meaning.…”
Section: (4-a)mentioning
confidence: 99%
See 2 more Smart Citations