Searchable List of Research Output

Filter Publications
  • 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. (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. (2016) In Memoriam: Jaakko Hintikka.
    Arkhimedes, Vol. 2016 (pp 32-35)
  • 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) Jaakko Hintikka.
    In Borchert, Donald M. (Eds.), Encyclopedia of Philosophy (pp 172-174). Macmillan Reference USA.
    Entry for encyclopedia/dictionary | UvA-DARE
  • Vaananen, J.A. (2006) A Remark on Nondeterminacy in IF Logic.
    Acta Philosophica Fennica, Vol. 78 (pp 71-77)
    Article | 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
  • Valdivia, A., Aradau, C., Blanke, T., Perret, S. (2022) Neither opaque nor transparent: A transdisciplinary methodology to investigate datafication at the EU borders.
    Big Data and Society, Vol. 9
  • van Apeldoorn, J., Gilyén, A., Gribling, S., de Wolf, R. (2017) Quantum SDP-Solvers: Better upper and lower bounds.
    In 58th Annual IEEE Symposium on Foundations of Computer Science: FOCS 2017 : proceedings : 15-17 October 2017, Berkeley, CA, USA (pp 403-414). IEEE Computer Society.
    Conference contribution | https://doi.org/10.1109/FOCS.2017.44 | UvA-DARE
  • van Apeldoorn, J., Gilyén, A., Gribling, S., de Wolf, R. (2020) Quantum SDP-Solvers: Better upper and lower bounds.
    Quantum - the open journal for quantum science, Vol. 4
  • van Apeldoorn, J., Gilyén, A., Gribling, S., de Wolf, R. (2020) Convex optimization using quantum oracles.
    Quantum - the open journal for quantum science, Vol. 4
  • van Apeldoorn, J., Gribling, S., Li, Y., Nieuwboer, H., Walter, M., de Wolf, R. (2021) Quantum algorithms for matrix scaling and matrix balancing.
    In Bansal, N. Merelli, E. Worrell, J. (Eds.), 48th International Colloquium on Automata, Languages, and Programming: ICALP 2021, July 12–16, 2021, Glasgow, Scotland ((Virtual Conference) (Leibniz International Proceedings in Informatics, Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • van Apeldoorn, J.T.S. (2020) A quantum view on convex optimization.
    Thesis, fully internal | 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