Identifiability in the Limit of Context-Free Generalized Quantifiers
Journal of Language and Computation 1:93--102 (1999)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | context-free generalized grammars learnability quantifiers | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesJohan van Benthem & Dag Westerståhl (1995). Directions in Generalized Quantifier Theory. Studia Logica 55 (3):389-419.
Martin van den Berg (1996). Dynamic Generalized Quantifiers. In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University.
Juha Kontinen (2006). The Hierarchy Theorem for Second Order Generalized Quantifiers. Journal of Symbolic Logic 71 (1):188 - 202.
Juha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. 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.
Peter Fritz (forthcoming). Modal Ontology and Generalized Quantifiers. Journal of Philosophical Logic.
Hanoch Ben-Yami (2009). Generalized Quantifiers, and Beyond. Logique Et Analyse (208):309-326.
Lauri Hella, Jouko Väänänen & Dag Westerståhl (1997). Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6 (3):305-335.
Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. Journal of Logic, Language and Information 13 (4).
Anna Szabolcsi (2010). Quantification. Cambridge University Press.
Gila Sher (1990). Ways of Branching Quantifers. Linguistics and Philosophy 13 (4):393 - 422.
Dag Westerståhl (1989). Aristotelian Syllogisms and Generalized Quantifiers. Studia Logica 48 (4):577-585.
Lauri Hella, Kerkko Luosto & Jouko Väänänen (1996). The Hierarchy Theorem for Generalized Quantifiers. Journal of Symbolic Logic 61 (3):802-817.
K. Luosto (1999). Ramsey Theory is Needed for Solving Definability Problems of Generalized Quantifiers. 1754:121--134.
Jakub Szymanik (2010). Almost All Complex Quantifiers Are Simple. In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
C. T. Mcmillan, R. Clark, P. Moore, C. Devita & M. Grossman (2005). Neural Basis for Generalized Quantifiers Comprehension. Neuropsychologia 43:1729--1737.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-03-18Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
