dhr. dr. J.K. (Jakub) Szymanik
-
Faculteit der Geesteswetenschappen
Logic and Language
-
POSTBUS
94242
1090 GE Amsterdam
-
J.K.Szymanik@uva.nl
2014
- A. Isaac, J.K. Szymanik & R. Verbrugge (2014). Logic and complexity in cognitive science. In A. Baltag & S. Smets (Eds.), Johan van Benthem on Logical and Informational Dynamics (Outstanding Contributions to Logic) (pp. 787-824). Springer.
- J. Kontinen & J.K. Szymanik (2014). A characterization of definability of second-order generalized quantifiers with applications to non-definability. Journal of Computer and System Sciences, 80 (6), 1152-1162. doi: 10.1016/j.jcss.2014.04.007
- C. Dégremont, L. Kurzen & J. Szymanik (2014). Exploring the tractability border in epistemic tasks. Synthese, 191 (3), 371-408. doi: 10.1007/s11229-012-0215-7
- M. Zajenkowski, M. Garraffa & J.K. Szymanik (2014). Working Memory Mechanism in Proportional Quantifier Verification. Journal of Psycholinguistic Research, 43 (6), 839-853. doi: 10.1007/s10936-013-9281-3
- J. Dotlacil, J.K. Szymanik & M. Zajenkowski (2014). Probabilistic semantic automata in the verification of quantified statements. In Proceedings of the 36th Annual Conference of the Cognitive Science Society (pp. 2967-2972).
- G. Bergwerff, B. Meijering, J.K. Szymanik, R. Verbrugge & S. Wierda (2014). Computational and algorithmic models of strategies in turn-based games. In Proceedings of the 36th Annual Conference of the Cognitive Science Society (pp. 1778-1783).
- L. Robaldo, J.K. Szymanik & B. Meijering (2014). On the identification of quantifiers' witness sets. Journal of Logic, Language and Information, 23 (1), 53-81. doi: 10.1007/s10849-014-9197-9
2013
- J.K. Szymanik & M. Zajenkowski (2013). Most intelligent people are accurate and some fast people are intelligent. Intelligence, working memory, and semantic processing of quantifiers from a computational perspective. Intelligence, 41 (5), 456-466. doi: 10.1016/j.intell.2013.06.020
- J.K. Szymanik, B. Meijering & R. Verbrugge (2013). Using intrinsic complexity of turn-taking games to predict participants' reaction times. In Proceedings of the 35th Annual Conference of the Cognitive Science Society. Cognitive Science Society.
- J.K. Szymanik, S. Steinert-Threlkeld, M. Zajenkowski & T. Icard (2013). Automata and Complexity in Multiple-Quantifier Sentence Verification. In Proceedings of the 12th International Conference on Cognitive Modeling.
- J.K. Szymanik & R. Verbrugge (2013). Logic and Cognition: Special Issue of Best Papers of the ESSLLI 2012 Workshop. Journal of Logic, Language and Information, 22 (4), 357-362. doi: 10.1007/s10849-013-9186-4
- J.K. Szymanik & M. Zajenkowski (2013). Monotonicity has only a relative effect on the complexity of quantifier verification. In Proceedings of the 19th Amsterdam Colloquium.
- J.K. Szymanik (2013). Backward Induction is PTIME-complete. In Proceedings of the Fourth International Workshop on Logic, Rationality, and Interaction Vol. 8196. Lecture Notes in Computer Science.
2012
- J.K. Szymanik & L. Robaldo (2012). Pragmatic Identification of the Witness Sets. In N. Calzolari (Ed.), Proceeding of the 8th Conference on Language Resources and Evaluation. Istanbul: European Language Resources Association.
- J.K. Szymanik & M. Mostowski (2012). Semantic bounds for everyday language. Semiotica, 188 (1/4), 363-372. doi: 10.1515/sem-2012-0022
2011
- N. Gierasimczuk & J.K. Szymanik (2011). Invariance properties of quantifiers and multiagent information exchange. In Proceedings of 12th Meeting on Mathematics of Language Vol. 6878. Lecture Notes in Artificial Intelligence.
- C.M.L. Degremont, L. Kurzen & J.K. Szymanik (2011). On the tractability of comparing informational structures. In Proceedings of the Workshop 'Reasoning about Other Minds: Logical and Cognitive Perspectives Vol. 751. CEUR Workshop Proceedings.
- N. Gierasimczuk & J.K. Szymanik (2011). A note on a generalization of the Muddy Children Puzzle. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge. ACM Digital Library.
- O. Bott, F. Schlotterbeck & J.K. Szymanik (2011). Interpreting tractable versus intractable reciprocal sentences. In Proceedings of the International Conference on Computational Semantics 9.
- J. Kontinen & J.K. Szymanik (2011). Characterizing definability of second-order generalized quantifiers. In Proceedings of the Workshop on Logic, Language, Information and Computation Vol. 6642. Lecture Notes in Artificial Intelligence.
- M. Zajenkowski, R. Styla & J. Szymanik (2011). A computational approach to quantifiers as an explanation for some language impairments in schizophrenia. Journal of Communication Disorder, 44 (6), 595-600. doi: 10.1016/j.jcomdis.2011.07.005
- J.K. Szymanik & M. Zajenkowski (2011). Contribution of working memory in the parity and proportional judgments. Belgian Journal of Linguistics, 25 (1), 176-194. doi: 10.1075/bjl.25.08szy
- I. van Rooij, J. Kwisthout, M. Blokpoel, J. Szymanik, T. Wareham & I. Toni (2011). Intentional communication: computationally easy or difficult? Frontiers in Human Neuroscience, 5. doi: 10.3389/fnhum.2011.00052[go to publisher's site]
2010
- J. Szymanik & M. Zajenkowski (2010). Quantifiers and working memory. In M. Aloni, H. Bastiaanse, T. de Jager & K. Schulz (Eds.), Logic, language and meaning: Proceedings of the 17th Amsterdam Colloquium Vol. 6042. Lecture Notes in Computer Science (pp. 456-464). Berlin: Springer.
- J. Szymanik (2010). Almost all complex quantifiers are simple. In C. Ebert, G. Jäger & J. Michaelis (Eds.), The mathematics of language: 10th and 11th biennial conference (MOL 10 and MOL 11) Vol. 6149. Lecture Notes in Computer Science (pp. 272-280). Berlin: Springer.
- J.K. Szymanik (2010). Computational complexity of polyadic lifts of generalized quantifiers in natural language. Linguistics and Philosophy, 33 (3). doi: 10.1007/s10988-010-9076-z
- J. Szymanik & M. Zajenkowski (2010). Comprehension of simple quantifiers: empirical evaluation of a computational model. Cognitive Science, 34 (3), 521-532. doi: 10.1111/j.1551-6709.2009.01078.x
- A. Isaac & J. Szymanik (2010). Logic and cognitive science: bridging the gap between symbolic and connectionist paradigms. Journal of Indian Council of Philosophical Research, 27 (2), 279-309.
2009
- J. Szymanik (2009). Almost all complex quantifiers are simple. In Pre-proceedings of the 11th Meeting on the Mathematics of Language (MOL 11) (pp. 109-118).[go to publisher's site]
- J. Szymanik & M. Zajenkowski (2009). Understanding quantifiers in language. In N. Taatgen & H. van Rijn (Eds.), Proceedings of the Thirty-First Annual Conference of the Cognitive Science Society (pp. 1109-1114). Austin, TX: Cognitive Science Society.[go to publisher's site]
- J. Szymanik (2009). The computational complexity of quantified reciprocals. In P. Bosch, D. Gabelaia & J. Lang (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 Vol. 5422. Lecture Notes in Computer Science (pp. 139-152). Berlin: Springer.
- J. Szymanik & M. Zajenkowski (2009). Quantifiers and working memory. In Seventeenth Amsterdam Colloquium, December 16-18, 2009: Pre-proceedings (pp. 435-444). Amsterdam: ILLC, University of Amsterdam.
- N. Gierasimczuk & J. Szymanik (2009). Branching quantification v. two-way quantification. Journal of Semantics, 26 (4), 367-392.
- J. Szymanik & M. Zajenkowski (2009). Improving methodology of quantifier comprehension experiments. Neuropsychologia, 47 (12), 2682-2683.
2008
- J. Kontinen & J. Szymanik (2008). A remark on collective quantification. Journal of Logic, Language and Information, 17 (2), 131-140.[go to publisher's site]
2007
- J. Szymanik (2007). Strong Meaning Hypothesis from a Computational Perspective. In P..Dekker F. Roelofsen M. Aloni (Ed.), Proceedings of the Sixteenth Amsterdam Colloquium (pp. 211-216). Amsterdam.
- J. Szymanik (2007). Computational semantics for monadic quantifiers in natural language. Studia Semiotyczne, 26, 219-244.
- J. Szymanik & M. Mostowski (2007). Computational complexity of some Ramsey quantifiers in finite models. The Bulletin of Symbolic Logic, 13, 281-282.
- J. Szymanik & N. Gierasimczuk (2007). Hintikka's Thesis revisited. The Bulletin of Symbolic Logic, 13, 273-273.
- J. Szymanik (2007). A Note on some Neuroimaging Study of Natural Language Quantifiers Comprehension. Neuropsychologia, 45 (9), 2158-2160.
2013
- J.K. Szymanik (2013). Communication and cooperation. In Logic Across the University: Foundations and Applications Vol. 47. Studies in Logic. London: College Publications.
2009
- J.K. Szymanik (2009, March 06). Quantifiers in TIME and SPACE : computational complexity of generalized quantifiers in natural language. Universiteit van Amsterdam (xiv, 232 pag.) (Amsterdam: Institute for Logic, Language and Computation). Supervisor(s): prof.dr. J.F.A.K. van Benthem, M. Mostowski & dr. T.M.V. Janssen.
This page has been automatically generated by the UvA-Current Research Information System. If you have any questions about the content of this page, please contact the UBAcoach or the Metis staff of your faculty / institute. To edit your publications login to Personal Metis.
- Geen nevenwerkzaamheden