Skip to main content

Meanwhile, Within the Frege Boundary

Linguistics and Philosophy volume 26, pages 547–556 (2003)Cite this article

Abstract

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.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

REFERENCES

  • 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.

    Google Scholar 

  • Keenan, E. L.: 1992, ‘Beyond the Frege Boundary’, Linguistics and Philosophy 15(2), 199–221.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Information (ILLC), University of Amsterdam it Nieuwe Doelenstraat, 15 1012, CP, Amsterdam, The Netherlands

    Paul Dekker

Authors
  1. Paul Dekker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025896723582

Keywords

  • Artificial Intelligence
  • Computational Linguistic
  • Alternative Proof
  • Equivalence Result
  • Reducible Type