Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T16:28:44.575Z Has data issue: false hasContentIssue false

Natural language, sortal reducibility and generalized quantifiers

Published online by Cambridge University Press:  12 March 2014

Edward L. Keenan*
Affiliation:
Department of Linguistics, University of California at Los Angeles, Los Angeles, California 90024, E-mail: iyw8elk@uclamvs.bitnet

Abstract

Recent work in natural language semantics leads to some new observations on generalized quantifiers. In §1 we show that English quantifiers of type 〈1, 1〉 are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type.

Section 2 presents our main result — the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form (Q1x1…QnxnRx1…xn and q1x1…qnxnRx1…xn are logically equivalent for arbitrary generalized quantifiers Qi, qi. GPT generalizes, perhaps in an unexpectedly strong form, the Linear Prefix Theorem (appropriately modified) of Keisler & Walkoe (1973).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable