Identifiability in the Limit of Context-Free Generalized Quantifiers

Journal of Language and Computation 1:93--102 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Dynamic Generalized Quantifiers.Martin van den Berg - 1996 - In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. pp. 63--94.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.
Generalized Quantifiers, and Beyond.Hanoch Ben-Yami - 2009 - Logique Et Analyse (208):309-326.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
On the expressive power of abstract categorial grammars: Representing context-free formalisms. [REVIEW]Philippe de Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
Quantification.Anna Szabolcsi - 2010 - New York: Cambridge University Press.
Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
Aristotelian syllogisms and generalized quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Ramsey theory is needed for solving definability problems of generalized quantifiers.K. Luosto - 1999 - In Jouko A. Vaananen (ed.), European Summer School in Logic, Language and Information: ESSLLI 1997: Generalized Quantifiers and Computation. Springer. pp. 121--134.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
Neural basis for generalized quantifiers comprehension.C. T. Mcmillan, R. Clark, P. Moore, C. Devita & M. Grossman - 2005 - Neuropsychologia 43:1729--1737.

Analytics

Added to PP
2012-03-18

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations

References found in this work

No references found.

Add more references