{"created":"2021-03-01T06:36:02.229695+00:00","id":27993,"links":{},"metadata":{"_buckets":{"deposit":"10791936-7f62-4021-8b9f-366a4c05df07"},"_deposit":{"id":"27993","owners":[],"pid":{"revision_id":0,"type":"depid","value":"27993"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00027993","sets":["326:521:2321:2394"]},"author_link":["91183"],"item_1615768549627":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_9_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-10-31","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"82","bibliographicPageStart":"63","bibliographicVolumeNumber":"36","bibliographic_titles":[{"bibliographic_title":"IVY","bibliographic_titleLang":"en"}]}]},"item_9_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Antecedent-contained deletion (ACD) has been supposed to be solved by Quantifier Raising (QR). But under the copy theory of movement, QR does not save antecedent containment. Fox (2002) resolved the conflict between the copy theory of movement and Parallelism in ACDs by assuming 'the single output model,' which was proposed by Brody (1995), Bobaljik (1995), Pesetsky (1998), and Groat and O'Neil (1994). Beginning with (1a), the object QP covertly moves to the edge of vP in (1b), then the late-merger of the adjunct follows. (1) a. [VP John like every boy] b. [VP John like every boy] every boy] c. [VP John like every boy] every boy that Mary does <likes boy>] (Fox 2002: 76) In this paper, following Nissenbaum (2000) we develop a theory of QR and an analysis of ACD adopting cyclic spellout system and show that QR in ACDs is driven by [+specific] feature at vP. This is evidenced by the contrast between (2) and (3). (2) a. I read every book that you did. b. I read each book that you did. c. I read most books that you did. d. Mary put everything he could in his pockets. (3) a. *?I read many books that you did. b. *I read few books that you did. c. *I read two books that you did. d. *I read books that you did. e. *Max put some/many/six things he could in his pockets. (Diesing 1992: p.71) This shows that not all QPs move to the periphery of vP, by which we mean nonspecific indefinite object QP in ACD is unavailable. This fact is supported in Turkish reported in Enç (1991) and further evidenced by Condition C effect in ACDs. We propose a scope principle that determines relative scope of quantifiers under the framework of Chomsky (2001). Chomsky (2001) regards scopal property as an \"edge phenomena\". We show that the relative scope of quantifiers is decided phase by phase in conformity with (4). (4) The operation TRANSFER applies at the phase level. (Chomsky 2001: 9) The analysis we present here gives appropriate explanation to Condition C effect in ACDs, which are otherwise puzzling under the copy theory of movement. (5) a. You sent him the letter that John expected you would. b. You introduced him to everyone John wanted you to. c. I reported him to every cop John was afraid I would. (Fox 2002: 84) The analysis presented here also handles the difference between ACD-QR and Scope-QR which is focused on in Wilder (1997). Chomsky (2001) argues that there is no LF: rather, the computation maps LA to <PHON, SEM> piece-by-piece cyclically (Chomsky 2001: 5). He also claims that Σ and Φ interpret units that are part of something like LF in a non-cyclic conception. The tide of this article does not imply that there should be an independent LF component. Rather the word LF is used to refer to the covert area chat comes after spell-out.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_9_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"名古屋大学英文学会","subitem_publisher_language":"ja"},{"subitem_publisher":"The society of english literature and linguistics Nagoya University","subitem_publisher_language":"en"}]},"item_9_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_9_source_id_7":{"attribute_name":"ISSN（print）","attribute_value_mlt":[{"subitem_source_identifier":"0914-2266","subitem_source_identifier_type":"PISSN"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Oteki, Yusaku","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"91183","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-13"}],"displaytype":"detail","filename":"ivy_36_63.pdf","filesize":[{"value":"707.7 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"ivy_36_63.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/27993/files/ivy_36_63.pdf"},"version_id":"8b5d6f20-2bd8-405a-94ea-b1af089caef0"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Antecedent-Contained Deletion and Phrasal Movement in LF","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Antecedent-Contained Deletion and Phrasal Movement in LF","subitem_title_language":"en"}]},"item_type_id":"9","owner":"1","path":["2394"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2019-05-13"},"publish_date":"2019-05-13","publish_status":"0","recid":"27993","relation_version_is_last":true,"title":["Antecedent-Contained Deletion and Phrasal Movement in LF"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:20:19.328616+00:00"}