Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 02 June 2020

Abstract and Keywords

This chapter provides the state-of-the-art around expletive negation (EN), by discussing: (i) the relationship between EN and negative concord; (ii) EN as a real negation; (iii) EN as a special formative linked to an additional evaluative/expressive layer in the semantics of language. Moreover, the chapter offers a potentially unifying analysis of EN in comparative, exclamative, and temporal clauses: EN as an operator of implicature denial. This approach derives the fact that EN is logically and compositionally independent from what is said from the fact that EN shifts the semantics of negation to the layer of implicated meaning. Some of the interpretive effects normally linked to the expressive/evaluative analysis of EN can be arguably derived as side-effects of this semantic analysis. The proposal advanced here has a number of implications regarding the relationship among morpho-syntax, pragmatic enrichment, and the non-incremental analysis of negation in theories of negation processing.

Keywords: Non-standard negation, non-veridical operators, asserted/implicated meaning, evaluative/expressive interpretations, two-dimensional semantics, temporal/comparative/exclamative clauses

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.