Finite model theory, especially descriptive complexity theory
Dependence logic and IF-logic
Generalized quantifiers; definability and quantification in natural language
Publications
Doctoral thesis
Definability of second-order generalized quantifiers. University of Helsinki, 2005. PDF
Published papers
Second-order generalized quantifiers and natural language. Proceedings
of the Seventh ESSLLI Student Session, 2002.
The hierarchy theorem for second-order generalized quantifiers.
Journal of Symbolic Logic, 71(1):188-202, 2006.
A remark on collective quantification (with Jakub Szymanik). Journal of Logic, Language and Information, 17(2):131-140, 2008.
On second-order monadic groupoidal quantifiers (with Heribert Vollmer). Proceedings of WoLLIC 2008. Springer Lecture Notes in Computer Science 5110, 2008.
A logical characterization of the counting hierarchy. ACM Transactions on Computational Logic, 10(1), 2009.
On definability in dependence logic (with Jouko Väänänen). Journal of Logic, Language and Information, 18(3):317-332, 2009. Erratum
Team logic and second-order logic (with Ville Nurmi). Proceedings of WoLLIC 2009. Springer Lecture Notes in Computer Science 5514, 2009.
Definability of second-order generalized quantifiers. Archive for Mathematical Logic, 49(3):379-398, 2010.
On second-order monadic monoidal and groupoidal quantifiers (with Heribert Vollmer). Logical Methods in Computer Science, 6(3), 2010.
Extensions of MSO and the monadic counting hierarchy (with Hannu Niemistö). Information and Computation, 209(1):1-19, 2011.
A remark on negation in dependence logic (with Jouko Väänänen). Notre Dame Journal of Formal Logic, 52(1):55-65, 2011.
Team logic and second-order logic (with Ville Nurmi). Fundamenta Informaticae, 106:259-272, 2011.
Characterizing Definability of Second-Order Generalized Quantifiers (with Jakub Szymanik). Proceedings of WoLLIC 2011. Springer Lecture Notes in Computer Science 6642, 2011.
Complexity of two-variable Dependence Logic and IF-Logic (with Antti Kuusisto, Peter Lohmann, Jonni Virtema). Proceedings of Logic in Computer Science (LICS): 289 - 298, 2011.
Dependence logic with a majority quantifier (with Arnaud Durand, Johannes Ebbing, and Heribert Vollmer). To appear in the proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011).
Hierarchies in Dependence Logic (with Arnaud Durand). To appear in ACM Transactions on Computational Logic, 2011.
Edited works
Proceedings of the ESSLLI 2010 workshop Dependence and Independence in Logic, 2010. Editor with Jouko Väänänen.
A special issue of Studia Logica on Dependence and Independence in Logic. Editor with Jouko Väänänen, and Dag Westerståhl (in press).
Preprints
Regular representations of uniform TC^0 (with Lauri Hella and Kerkko Luosto). Preprint 25, Institut Mittag-Leffler Preprint Series
(The Program of Fall 2009). PDF
Complexity of two-variable Dependence Logic and IF-Logic (with Antti Kuusisto, Peter Lohmann, Jonni Virtema). [arXiv:1104.3148]. An extended version of the LICS 2011 proceedings article.
Dependence logic with a majority quantifier (with Arnaud Durand, Johannes Ebbing, and Heribert Vollmer). [arXiv:1109.4750]. An extended version of the FSTTCS 2011 proceedings article.
Axiomatizing first order consequences in dependence logic (with Jouko Väänänen), 2011.
