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: 20 April 2019

Abstract and Keywords

The English present tense does not exhibit a uniform behavior in all embedded environments. Its ability to receive a simultaneous reading in complement clauses of attitude verbs depends on the matrix tense. Likewise, in relative clauses, the present tense is capable of receiving a simultaneous reading if the matrix tense is future, but not if it is past. However, there are languages (for example, Japanese and Hebrew) where the present tense receives (or can receive) a simultaneous reading in complement clauses of attitude verbs, even when the matrix tense is past. There are also languages (such as Japanese, but not Hebrew) where the present tense can receive a simultaneous reading in relative clauses, even when the matrix tense is past. This article explores the nature of these language-internal and cross-linguistic variations, and the success (or lack thereof) of two particular theories in accounting for it: the theory we refer to as the ULC-based theory (ULC stands for Upper Limit Constraint) and the copy-based theory. It then proposes a theory that borrows insights from both of the aforementioned theories to account for embedded tenses.

Keywords: embedded tenses, complement clauses, attitude verbs, relative clauses, matrix tense, present tense, cross-linguistic variations, ULC-based theory, copy-based theory

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.