Szymanik, J., Mostowski, M. (2007) Computational complexity of some Ramsey quantifiers in finite models.

The Bulletin of Symbolic Logic, Vol. 13 (pp 281-282)

Article | UvA-DARE

Szymanik, J., Steinert-Threlkeld, S., Zajenkowski, M., Icard, T.F. (2013) Automata and Complexity in Multiple-Quantifier Sentence Verification.

In West, R.L. Stewart, T.C. (Eds.), Proceedings of ICCM 2013: 12th International Conference on Cognitive Modeling (pp 239-244). Carleton University.

Szymanik, J., Thorne, C. (2017) Exploring the relation between semantic complexity and quantifier distribution in large corpora.

Language Sciences, Vol. 60 (pp 80–93)

Article | https://doi.org/10.1016/j.langsci.2017.01.006 | UvA-DARE

Szymanik, J., Verbrugge, R. (2013) Logic and Cognition: Special Issue of Best Papers of the ESSLLI 2012 Workshop.

Journal of Logic, Language and Information, Vol. 22 (pp 357-362)

Editorial | https://doi.org/10.1007/s10849-013-9186-4 | UvA-DARE

Szymanik, J., Verbrugge, R. (2014) Proceedings of the Second Workshop Reasoning About Other Minds: Logical and Cognitive Perspectives: co-located with Advances in Modal Logic 2014 ; Groningen, The Netherlands, August 4, 2014.

CEUR Workshop Proceedings, Vol. 1208. CEUR-WS.

Book (Editorship) | http://ceur-ws.org/Vol-1208/ | UvA-DARE

Szymanik, J., Verbrugge, R. (2019) Tractability and the computational mind.

In Sprevak, M. Colombo, M. (Eds.), The Routledge Handbook of the Computational Mind (pp 339-354) (Routledge Handbooks in Philosophy). Routledge.

Szymanik, J., Zajenkowski, M. (2009) Improving methodology of quantifier comprehension experiments.

Neuropsychologia, Vol. 47 (pp 2682-2683)

Article | https://doi.org/10.1016/j.neuropsychologia.2009.04.004 | UvA-DARE

Szymanik, J., Zajenkowski, M. (2009) Quantifiers and working memory.

In Seventeenth Amsterdam Colloquium, December 16-18, 2009: pre-proceedings (pp 435-444). ILLC, University of Amsterdam.

Szymanik, J., Zajenkowski, M. (2009) Understanding quantifiers in language.

In Taatgen, N.A. van Rijn, H. (Eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society (pp 1109-1114). Cognitive Science Society.

Szymanik, J., Zajenkowski, M. (2010) Comprehension of simple quantifiers: empirical evaluation of a computational model.

Cognitive Science, Vol. 34 (pp 521-532)

Article | https://doi.org/10.1111/j.1551-6709.2009.01078.x | UvA-DARE

Szymanik, J., Zajenkowski, M. (2010) Quantifiers and working memory.

In Aloni, M. Bastiaanse, H. de Jager, T. Schulz, K. (Eds.), Logic, Language and Meaning: 17th Amsterdam Colloquium, Amsterdam, The Netherlands, December 16-18, 2009 : revised selected papers (pp 456-464) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence
FoLLI Publications on Logic, Language and Information, Vol. 6042). Springer.

Szymanik, J., Zajenkowski, M. (2013) Monotonicity has only a relative effect on the complexity of quantifier verification.

In Aloni, M. Franke, M. Roelofsen, F. (Eds.), Proceedings of the 19th Amsterdam Colloquium (pp 219-225). ILLC, University of Amsterdam.

Szymanik, J. (2007) Strong Meaning Hypothesis from a Computational Perspective.

In F. Roelofsen M. Aloni, P. Dekker (Eds.), Proceedings of the Sixteenth Amsterdam Colloquium (pp 211-216)

Szymanik, J. (2007) A Note on some Neuroimaging Study of Natural Language Quantifiers Comprehension.

Neuropsychologia, Vol. 45 (pp 2158-2160)

Article | https://doi.org/10.1016/j.neuropsychologia.2007.01.016 | UvA-DARE

Szymanik, J. (2007) Computational semantics for monadic quantifiers in natural language.

Studia Semiotyczne, Vol. 26 (pp 219-244)

Article | UvA-DARE

Szymanik, J. (2009) The computational complexity of quantified reciprocals.

In Bosch, P. Gabelaia, D. Lang, J. (Eds.), Logic, Language, and Computation: 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007, Tbilisi, Georgia, October 1-5, 2007 : revised selected papers (pp 139-152) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence
FoLLI Publications on Logic, Language and Information, Vol. 5422). Springer.

Szymanik, J. (2009) Almost all complex quantifiers are simple.

Paper | http://www.jakubszymanik.com/papers/complex_qua.pdf | UvA-DARE

Szymanik, J. (2010) Computational complexity of polyadic lifts of generalized quantifiers in natural language.

Linguistics and Philosophy, Vol. 33 (pp 215-250)

Article | https://doi.org/10.1007/s10988-010-9076-z | UvA-DARE

Szymanik, J. (2010) Almost all complex quantifiers are simple.

In Ebert, C. Jäger, G. Michaelis, J. (Eds.), The Mathematics of Language: 10th and 11th Biennial Conference MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009 : revised selected papers (pp 272-280) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence
FoLLI Publications on Logic, Language and Information, Vol. 6149). Springer.

Szymanik, J. (2013) Communication and cooperation.

In van Benthem, J. Liu, F. (Eds.), Logic Across the University: Foundations and Applications: proceedings of the Tsinghua Logic Conference, Beijing, 2013 (pp 372-375) (Studies in Logic, Vol. 47). College Publications.