{"created":"2021-03-01T05:58:58.029316+00:00","id":6531,"links":{},"metadata":{"_buckets":{"deposit":"5084a2c1-5ac6-41e6-8f2c-2c1d4a550360"},"_deposit":{"id":"6531","owners":[],"pid":{"revision_id":0,"type":"depid","value":"6531"},"status":"published"},"_oai":{"id":"oai:kitami-it.repo.nii.ac.jp:00006531","sets":["7:15:34"]},"item_2_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1982-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"169","bibliographicPageStart":"149","bibliographicVolumeNumber":"13","bibliographic_titles":[{"bibliographic_title":"北見工業大学研究報告"}]}]},"item_2_description_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_2_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Synopsis: This paper investigates the logical properties of any-sentences (in contrast to those for every-sentences) within the framework of a logically-based grammar. (1) a. John spoke to anyone who came. b. John didn’t shoot any bird. Labov (1972) points out that (1a) expresses the meaning of “a lawful generalization.” This semantic characterization of (1a) can be extended to include (1b). Reichenbach (1947) would give (1a) and (1b) the following logical representations. (2) a.　Ax ((X came)⊃(John spoke to X)) b.　Ax((X is a bird)⊃?(John shot X)). In (2a) and (2b) any is analyzed as the universal quanlifier. In (2b) the apodosis “John didn’t shoot X” is the proposition schema which represents the prepositional part of (1b) and the protasis “X is a bird” defines the category name under which the x in the schema behaves as an argument, so the X stands for a free argument variable. This causes the‘analyzability’ of the X with respect to the schema. The same holds for (2a). The universal quantification results in the same type of conjunctions as shown below. (3) a. John spoke to X_1 and John spoke to X_2 and …∞. b. John didn’t shoot X_1 and John didn’t shoot X_2 and …∞. Assuming that Horn’s (1972) Factoring is a set-formative rule, (1a) and (1b) can be derived by applying the rule to (3a) and (3b). (4)　a. John spoke to (X_1 or X_2 or …∞). b. John didn’t shoot (X_1 or X_2 or …∞). The sets so formed are lexicalized with any. Several arguments for the plausibility of this derivation of any are presented in this paper. After a brief survey, in Section 1, of some important contributions in the literature, Section 2 discusses the referential problem for any in contrast to every, clarifying that Factoring, in sharp contrast to Conjunction Reduction, depends for its applicability crucially on the referential nonspecificity condition that must be imposed on the X’s in (3). Section 3 concentrates on the logical properties of sentences like (1b) and on the set-formative function of any. There, under the proposed assumptions, it is naturally explained that the sets in (4) are obligatorily formed by Factoring on the referential condition that the individual X’s can only be included in the sets under the category names given by the protases. This condition will also explain the immunity of Factoring from the Cross-over Constraint in deriving (4) from (3) and, most importantly, that the existential interpretation for (1b), often asserted by linguists, results from the logical entailment that the truth of the proposition with respect to one arbitrarily chosen argument X_1 can vouch for the truth of it with respect to any other argument in the set (4b) (the unmarked condition). The marked condition is necessary for (1a). The stress on any signals reference to the totality of the set (4a). section 4, summarizes the points made in Section 2 and 3. Section 5 presents evidence for the set-formative function of any in contrast with Fauconnier’s (1975) Scale Principle, demonstrating that an analysis of any made otherwise than in quantificational terms will prove invalid.          　","subitem_description_type":"Abstract"}]},"item_2_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"北見工業大学"}]},"item_2_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hidekatsu, NIIZUMA"}],"nameIdentifiers":[{"nameIdentifier":"32955","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-11-22"}],"displaytype":"detail","filename":"13-2-6.pdf","filesize":[{"value":"9.9 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"13-2-6.pdf","url":"https://kitami-it.repo.nii.ac.jp/record/6531/files/13-2-6.pdf"},"version_id":"3c45cf06-c851-4535-93a8-1fba4220bcea"}]},"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":"On the Logical Properties of universally-qnantified English Sentences","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On the Logical Properties of universally-qnantified English Sentences"}]},"item_type_id":"2","owner":"1","path":["34"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-04-09"},"publish_date":"2007-04-09","publish_status":"0","recid":"6531","relation_version_is_last":true,"title":["On the Logical Properties of universally-qnantified English Sentences"],"weko_creator_id":"1","weko_shared_id":3},"updated":"2022-12-13T02:19:52.417155+00:00"}