In this paper, I want to contribute to understanding and improving on Keenan'sintriguing equivalence result about reducible type < 2 > quantifiers (Keenan, 1992).I give an alternative proof of his result which generalizes to type < 2 > quantifiers, andI show how the reduction of a reducible type < 2 > quantifier to (the composition of) ntype < n > quantifiers can be effected.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Ben-Shalom, D.: 1994, ‘A Tree Characterization of Generalized Quantifier Reducibility’, in M. Kanazawa and C. Piñón (eds.), Dynamics, Polarity and Quantification, pp. 147–171, CSLI, Stanford.
Keenan, E. L.: 1992, ‘Beyond the Frege Boundary’, Linguistics and Philosophy 15(2), 199–221.
Rights and permissions
About this article
Cite this article
Dekker, P. Meanwhile, Within the Frege Boundary. Linguistics and Philosophy 26, 547–556 (2003). https://doi.org/10.1023/A:1025896723582
- Artificial Intelligence
- Computational Linguistic
- Alternative Proof
- Equivalence Result
- Reducible Type