This is the homepage of Karoliina Lehtinen. Welcome.

I am a postdoctoral researcher in Prof. Dr. Dirk Nowotka's Reliable Systems group at the Christian-Albrechts University of Kiel, Germany. I did my PhD in the Laboratory for Foundations of Computer Science, University of Edinburgh, supervised by Dr. Julian Bradfield and Dr. Sandra Quickert. I am originally from Finland, but ended up in Edinburgh and now Kiel after going to school in France and doing the Computer Science Tripos and M.Phil in Advanced Computer Science in Cambridge, where my dissertations were supervised by Dr. Bjarki Holm and Prof. Anuj Dawar.

My primary research interests are mathematical logics, infinite games, and automata theory, in particular in the contexts of verification and descriptive complexity. My PhD topic was complexity in the modal \( \mu\) calculus, which is currently my favourite logic.

\(\Sigma^{\mu}_2\) is decidable for \(\Pi^{\mu}_2\). M.K.Lehtinen & S.Quickert. Cie 2017pdf

Deciding the first levels of the modal \( \mu\) calculus by formula construction. M.K.Lehtinen & S.Quickert. CSL 2015. pdf

Disjunctive form and the modal \( \mu\) alternation hierarchy. M.K.Lehtinen. FICS 2015 pdf

The descriptive complexity of modal \( \mu\) model-checking parity games. M.K.Lehtinen pdf

On complexity in parity games. M.K.Lehtinen pdf

ThesesSyntactic complexity in the modal \(\mu\) calculus. M.K.Lehtinen. Doctoral thesis from the University of Edinburgh, 2017. pdf

Parity games and the automaticity of modal \(\mu\). M.K.Lehtinen. M.Phil thesis from the University of Cambridge, 2012. pdf

I do not currently have teaching duties.

I used to be the teaching assistant and tutor for Edinburgh's first year course on Functional Programming. Other courses I have been a TA or tutor for: the shiny new course Introduction to Theoretical Computer Science, the course Processing Formal and Natural Languages and the course Algorithms, Data Structures, Learning. I occasionally also find myself teaching folk dancing, which is a rather different experience.