Searchable List of Research Output

Filter Publications
  • Väänänen, J. (2013) Breaking the atom with Samson.
    In Coecke, B. Ong, L. Panangaden, P. (Eds.), Computation, logic, games, and quantum foundations: the many facets of Samson Abramsky: essays dedicated to Samson Abramsky on the occasion of his 60th birthday (pp 327-335) (Lecture Notes in Computer Science, Vol. 7860). Springer.
  • Väänänen, J. (2014) Multiverse set theory and absolutely undecidable propositions.
    In Kennedy, J. (Eds.), Interpreting Gödel: critical essays (pp 180-208). Cambridge University Press.
  • Väänänen, J. (2014) Sort logic and foundations of mathematics.
    In Chong, C. Feng, Q. Slaman, T.A. Woodin, W.H. (Eds.), Infinity and truth (pp 171-186) (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, Vol. 25). World Scientific.
  • Väänänen, J. (2015) Second-order logic and set theory.
    Philosophy Compass, Vol. 10 (pp 463-478)
  • Väänänen, J. (2015) Pursuing logic without borders.
    In Hirvonen, Å. Kontinen, J. Kossak, R. Villaveces, A. (Eds.), Logic without borders: essays on set theory, model theory, philosophical logic, and philosophy of mathematics (pp 403-416) (Ontos Mathematical Logic). De Gruyter.
  • Väänänen, J. (2015) Categoricity and consistency in second-order logic.
    Inquiry : an Interdisciplinary Journal of Philosophy, Vol. 58 (pp 20-27)
  • Väänänen, J. (2016) In Memoriam: Jaakko Hintikka.
    Arkhimedes, Vol. 2016 (pp 32-35)
  • Väänänen, J. (2016) Grelling on dependence.
    In Abramsky, S. Kontinen, J. Väänänen, J. Vollmer, H. (Eds.), Dependence Logic: Theory and Applications (pp 33-52). Birkhäuser.
  • Väänänen, J.A., Grädel, E. (2012) Dependence, Independence, and Incomplete Information.
    In Proceedings of 15th International Conference on Database Theory, ICDT 2012. ICDT.
    Conference contribution | UvA-DARE
  • Vaananen, J.A., Shelah, S. (2006) Recursive Logic Frames.
    Mathematical Logic Quarterly, Vol. 52
    Article | UvA-DARE
  • Vaananen, J.A., Stoltenberg-Hansen, V. (2006) Logic Colloquium '03: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic.
    Lecture Notes in Logic. Association for Symbolic Logic.
    Book (Editorship) | UvA-DARE
  • Väänänen, J.A., Trottenberg, U (2008) Maths for Everyday Life.
    ERCIM News. ERCIM.
    Book (Editorship) | UvA-DARE
  • Vaananen, J.A. (2006) A Remark on Nondeterminacy in IF Logic.
    Acta Philosophica Fennica, Vol. 78 (pp 71-77)
    Article | UvA-DARE
  • Vaananen, J.A. (2006) Jaakko Hintikka.
    In Borchert, Donald M. (Eds.), Encyclopedia of Philosophy (pp 172-174). Macmillan Reference USA.
    Entry for encyclopedia/dictionary | UvA-DARE
  • Väänänen, J.A. (2007) Team logic.
    In van Benthem, J. Löwe, B. Gabbay, D. (Eds.), Interactive Logic (pp 281-302) (Texts in Logic and Games). Amsterdam University Press.
    Chapter | UvA-DARE
  • Väänänen, J.A. (2007) Dependence Logic.
    London Mathematical Society Student Texts. Cambridge University Press.
    Book | UvA-DARE
  • Vaananen, J.A. (2007) On infinite Ehrenfeucht-Fraïssé games.
    In Bold, S. Loewe, B. Raesch, T. van Benthem, J. (Eds.), Infinite games (pp 279-317) (Foundations of the Formal Sciences). College Publications.
    Chapter | UvA-DARE
  • Väänänen, J.A. (2008) The Craig Interpolation Theorem in abstract model theory.
    Synthese, Vol. 164 (pp 401-420)
  • Väänänen, J.A. (2012) Lindström's Theorem.
    In Beziau, J-Y (Eds.), Universal Logic: An Anthology (pp 231-236)
    Chapter | UvA-DARE
  • Valderrey, Andrea, Bloem, J. (2026) Investigating how LLMs propagate female stereotypes: Comparing what models say via prompts with what they represent in their embeddings.
    In The Fifteenth Language Resources and Evaluation Conference (LREC 2026): Main Conference Proceedings : 13-15 May, 2026 (pp 77-92). ELRA Language Resources Association.
    Conference contribution | https://doi.org/10.63317/48i8c4bmbog3 | UvA-DARE

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact