Reijo Jaakkola

I did mathematics.
Now I’m trying to find out if I produced something useful.

I'm Reijo Jaakkola, a mathematician. My background is in logic, machine learning and theoretical computer science. My future is in business.

Current focus

ExplainedAI

ExplainedAI is a Research-to-Business project where we are preparing the commercialization of new interpretable machine learning solutions. Funded by Business Finland and Tampere University.

Webpage

Research areas

Four things I have thought about

Mathematical logic

Formal tools for understanding structure, expressivity, and computation.

Machine learning

What models actually learn, when they generalize, and why.

Explainable AI

Methods for making machine learning models and predictions more understandable.

Complexity theory

What can be computed, how fast, and where the hard cases hide.

Selected publications

What I've written

  1. Why this and not that? A Logic-based Framework for Contrastive Explanations Publication Preprint
    JELIA 2025 · with Tobias Geibinger, Antti Kuusisto, Xinghan Liu, Miikka Vilander
  2. Explainability via Short Formulas: the Case of Propositional Logic with Implementation Publication
    JAIR Vol. 83 (2025) · with Janhunen, Kuusisto, Feyzbakhsh Rankooh, Vilander
  3. Relating Description Complexity to Entropy Publication
    Journal of Computer and System Sciences · with Kuusisto, Vilander
  4. Description Complexity of Unary Structures in First-Order Logic with Links to Entropy Publication Preprint
    CSL 2025, Amsterdam · with Kuusisto, Vilander
  5. Interpretable Classifiers for Tabular Data via Feature Selection and Discretization Publication Preprint
    DAO-XAI 2024, Santiago de Compostela · with Janhunen, Kuusisto, Feyzbakhsh Rankooh, Vilander
  6. Short Boolean Formulas as Explanations in Practice Publication Preprint
    JELIA 2023, Dresden · with Janhunen, Kuusisto, Feyzbakhsh Rankooh, Vilander
  7. Relating Description Complexity to Entropy Publication Preprint
    STACS 2023, Hamburg · with Kuusisto, Vilander
  8. Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability Publication Preprint
    CSL 2023, Warsaw
  9. Complexity Classifications via Algebraic Logic Publication Preprint
    CSL 2023, Warsaw · with Kuusisto
  10. Explainability via Short Formulas: the Case of Propositional Logic with Implementation Publication Preprint
    RCRA 2022, Genova · with Janhunen, Kuusisto, Feyzbakhsh Rankooh, Vilander
  11. Towards Model Theory of Ordered Logics: Expressivity and Interpolation Publication Preprint
    MFCS 2022, Vienna · with Bartosz Bednarczyk
  12. Uniform Guarded Fragments Publication Preprint
    FoSSaCS 2022, Munich
  13. Ordered Fragments of First-Order Logic Publication Preprint
    MFCS 2021, Tallinn
  14. A monotone connection between model class size and description length Preprint
    Preprint · with Kuusisto, Vilander
  15. Convergence in the space of compact labeled metric spaces Preprint
    Preprint · with Antti Kykkänen
  16. First-order logic with self-reference Preprint
    Preprint · with Kuusisto
  17. An Extension of Trakhtenbrot's Theorem Note
    Note
  18. Complexity of the Ackermann fragment with one leading existential quantifier Note
    Note
Selected talks

Where I've spoken

  1. Moderni selitettävä tekoäly Slides
    SOTE-tekoäly ekosysteemin AI-aamu · 10 December 2025 · webinar
  2. Why this and not that? A Logic-based Framework for Contrastive Explanations Slides
    JELIA 2025 · 1–4 September 2025 · Kutaisi, Georgia
  3. Description Complexity of Unary Structures in First-Order Logic with Links to Entropy Slides
    CSL 2025 · 10–14 February 2025 · Amsterdam
  4. Expressing boundedness in static computational logic Slides
    Logic seminar · University of Helsinki · 29 January 2025
  5. Description complexity Slides
    Seminar for young researchers · University of Jyväskylä · 27 November 2024
  6. Uniform guarded fragments: interpolation and complexity Slides
    Workshop on Craig Interpolation and Beth Definability · Amsterdam · April 2024
  7. Formulas of propositional logic as interpretable classifiers Slides
    Mathematical Perspective on Machine Learning · Helsinki · 9 April 2024
  8. Why do overparameterized neural networks generalize? Slides
    Seminar for young researchers · Jyväskylä · 6 March 2024
  9. Explaining Classifiers and Data via Propositional Logic Slides
    Logic seminar · Helsinki · 22 November 2023
  10. First-Order Logic with Game-Theoretic Recursion Slides
    Logic seminar · Helsinki · 20 April 2023
  11. The Asymptotic Equipartition Property
    Seminar for young researchers · Jyväskylä · 29 March 2023
  12. Relating Description Complexity to Entropy Slides
    Logic and AI seminar · TU Dresden · 16 March 2023
  13. First-Order Logic with Game-Theoretic Recursion Slides
    FICS 2023 · Warsaw · 17 February 2023
  14. Complexity of Polyadic Boolean Modal Logics Slides
    CSL 2023 · Warsaw · 13–16 February 2023
  15. Complexity Classifications via Algebraic Logic Slides
    CSL 2023 · Warsaw · 13–16 February 2023
  16. First order logic with game-theoretic recursion II
    Logic seminar · Tampere University · 13 January 2023
  17. Nopeat algoritmit ja laskennallinen vaativuusteoria (invited) Slides (FI)
    IntegraatioFest 2022 · Tampere · 28–30 October 2022
  18. First-order logic with self-reference Slides
    PhDs in Logic XIII · Turin · 5–7 September 2022
  19. Uniform Guarded Fragments Slides
    FoSSaCS 2022 · Munich · 2–7 April 2022
  20. Complexity of Polyadic Boolean Modal Logics
    Logic seminar · Tampere University · 25 March 2022
  21. Undecidability of the Halting Problem and Gödel's Incompleteness Theorems Slides Video
    Harvard GSAS Mini-Course · January 2022 · course site
  22. Ordered fragments of first-order logic Slides
    Finnish Mathematical Days 2022
  23. What is a fragment? Slides
    Philosophy of Mathematics in Finland · Tampere · November 2021
  24. Interpolation and fragments of first-order logic
    Logic seminar · Tampere University · 24 September 2021
  25. Ordered fragments of first-order logic Slides
    MFCS 2021 · Tallinn · August 2021
  26. Extensions of two-variable logic Slides
    Logic seminar · Tampere University · 11 December 2020
  27. Algebraic classifications for fragments of first-order logic and beyond Slides
    Logicians' Spring Gathering 2020 · Tampere · 8 May 2020
More

Awards, theses, activities

Awards

  • First Prize — Amplifying Financial AI with Quantum Data Augmentation. Hanken Quantum × AI Hackathon 2025. Website
  • Best Tech Solution — Unlocking ESG Insights. Hanken Quantum Hackathon 2023. Website
  • 2022 Ernst Lindelöf Prize. Best master's thesis in mathematics in Finland, 2021–2022.

Theses

  • Algebraic Fragments of First-Order Logic. Master's thesis, Tampere University, 2021. Thesis

Activities

  • Research visits
    • TU Wien — host: Mantas Šimkus — interpretable graph classifiers — 14–18 July 2025
    • TU Wien — host: Magdalena Ortiz — knowledge graphs & neural networks — 16–20 December 2024
    • TU Wien — host: Thomas Eiter — explaining AI via logic — 27 November – 1 December 2023
    • University of Wrocław & TU Dresden — host: Bartosz Bednarczyk — model theory of ordered fragments — 10–23 March 2023
  • Organized a Young Researchers session at the Finnish Mathematical Days 2024.
  • Reviewer for AAMAS 2022, IJCAI 2023, KR 2023, MFCS 2023, JELIA 2023, GandALF 2023, AAAI 2024, LICS 2024, KR 2024, AAMAS 2025, KR 2025, GandALF 2025, STACS 2026, and the journals LMCS and JLC.

Quotes I keep around

But what we can't say we can't say, and we can't whistle it either. Frank Ramsey
Young man, in mathematics you don't understand things. You just get used to them. John von Neumann
Bad ideas is good, good ideas is terrific, no ideas is terrible. Leonard E. Baum
Everybody who has worked in formal logic will confirm that it is one of the technically most refractory parts of mathematics. John von Neumann