HOME         PUBLICATIONS         TALKS         MEETINGS

Scientific presentations

  1. On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic, 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, Ljubljana, Slovenia, January 2021, slides, video.
  2. Descriptive complexity of real computation and probabilistic team semantics, Aalto CS Theory Seminar, Aalto University, Finland, January 2021, slides.
  3. Complexity of real computation and probabilistic independence logic, 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrucken, Germany, July 2020, slides, video.
  4. Descriptive Complexity of Deterministic Polylogarithmic Time, 26th Workshop on Logic, Language, Information and Computation , Utrecht, The Netherlands, July 2019, slides.
  5. Team Semantics for the Specification and Verification of Hyperproperties, 43rd International Symposium on Mathematical Foundations of Computer Science, Liverpool, UK, August 2018, slides.
  6. Expressivity within second-order transitive-closure logic
    1. Dutch-Belgian DataBase Day 2018, Hasselt, Belgium, November 2018, slides.
    2. 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, Birmingham, UK, September 2018, slides.
    3. Horizons of Logic, Computation and Definability: Symposium in Honour of Lauri Hella's 60th birthday, Tampere, Finland, July 2018, slides.
  7. Probabilistic Team Semantics
    1. Dagstuhl Seminar 19031: Logics for Dependence and Independence, Dagstuhl, Germany, January 2019, slides,
    2. Lorentz Center Workshop: Logical Aspects of Quantum Information, Leiden, Netherlands, August 2018, slides,
    3. 10th International Symposium on Foundations of Information and Knowledge Systems, Budapest, Hungary, May 2018, slides.
  8. Polyteam Semantics, International Symposium on Logical Foundations of Computer Science, LFCS 2018, Deerfield Beach, Florida, USA, January 2018, slides.
  9. Model checking and validity in propositional and modal inclusion logics, 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, August 2017, slides.
  10. Logics of Independence and Dependence, Phileth seminar, Hokkaido University, Japan, May 2017, slides.
  11. Polyteam Semantics, Games for Logic and Programming Languages XII, Uppsala University, Sweden, April 2017, slides.
  12. Complexity of propositional logics in team semantics, Computational Logic Day 2016, Aalto University, Finland, December 2016, slides.
  13. Definability in modal dependence and inclusion logic, Finite model theory seminar, University of Helsinki, Finland, November 2016.
  14. Decidability and undecidability of two-variable logics with team semantics, Logic Seminar, University of Helsinki, Finland, September 2016.
  15. On quantified propositional logics and the exponential time hierarchy, 7th International Symposium on Games, Automata, Logics and Formal Verification, Catania, Italy, September 2016, slides.
  16. Decidability of predicate logics with team semantics, 41st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland, August 2016, slides.
  17. Characterizing Relative Frame Definability in Team Semantics via the Universal Modality, 23rd Workshop on Logic, Language, Information and Computation, Puebla, Mexico, August 2016, slides.
  18. Approximation and Dependence via Multiteam Semantics
    1. 9th International Symposium on Foundations of Information and Knowledge Systems, Linz, Austria, March 2016,
    2. Logic Seminar, University of Helsinki, Finland, February 2016, slides,
    3. Finnish Mathematical Days 2016, Turku, Finland, January 2016.
  19. Complexity of Propositional Independence and Inclusion Logic
    1. 40th International Symposium on Mathematical Foundations of Computer Science, Milan, Italy, August 2015, slides,
    2. Dagstuhl Seminar 15261: Logics for Dependence and Independence, Dagstuhl, Germany, June 2015, slides.
  20. Definability in modal logics with team semantics, Logic Colloquium 2015, Helsinki, Finland, August 2015, slides.
  21. Characterizing Frame Definability in Team Semantics via The Universal Modality, 22nd Workshop on Logic, Language, Information and Computation, Bloomington, United States, August 2015, slides.
  22. Complexity of validity for propositional dependence logics
    1. Nordic Complexity Workshop, Lübeck, Germany, February 2015,
    2. 5th International Symposium on Games, Automata, Logics and Formal Verification, Verona, Italy, September 2014, slides.
  23. Tableau calculi for propositional dependence logics, 49th MLG meeting, Kaga, Japan, December 2014, slides.
  24. Computational complexity of modal dependence logics
    1. Finite model theory seminar, University of Tampere, Finland, September 2014,
    2. Logic seminar, University of Helsinki, Finland, March 2014.
  25. Computational complexity and team semantics, Tojo Laboratory Summer Camp, Kaga, Japan, August 2014.
  26. The Expressive Power of Extended Modal Dependence Logic, 9th Scandinavian Logic Symposium, Museum Centre Vapriikki, Tampere, Finland, August 2014.
  27. Axiomatizing modal dependence logic
    1. Colloquium on Dependence Logic, The Royal Netherlands Academy of Arts and Sciences Amsterdam, Netherlands, March 2014,
    2. 4th Finnish-Estonian Mathematical Colloquium and the Finnish Mathematical Days 2014, Helsinki, Finland, January 2014.
  28. Modal team logic, 48th MLG meeting, Kaga, Japan, December 2013.
  29. Weak models of distributed computing with connections to modal logic, Logic@JAIST workshop, Kaga, Japan, July 2013.
  30. Boolean dependence logic and partially ordered connectives, Finite model theory seminar, University of Tampere, Finland, April 2013.
  31. Parallel computation from the perspective of descriptive complexity, Finite model theory seminar, University of Tampere, Finland, December 2012.
  32. Undecidable First-Order Theories of Affine Geometries, 8th Scandinavian Logic Symposium, Roskilde University, Denmark, August 2012.
  33. On formal theories of geometry II, Finite model theory seminar, University of Tampere, Finland, March 2012.
  34. Complexity of two-variable Dependence Logic and IF-Logic
    1. 26th Annual IEEE Symposium on Logic in Computer Science, Toronto, Canada, June 2011,
    2. Oxford LINT workshop, Computing Laboratory, University of Oxford, UK, April 2011.
  35. Undecidability and decidability results on two-variable logics with imperfect information, Finite model theory seminar, University of Helsinki, Finland, November 2010.
  36. Arity hierarchy for temporal logics, Finite model theory seminar, University of Tampere, Finland, October 2009.
  37. FO[+,x]=FO[BIT]=AC0, Finite model theory seminar, University of Tampere, Finland, March 2009.