Hi, I’m Bart.

Strzelce Opolskie → Wrocław

I was born in 1995 in Strzelce Opolskie, a small town where I attended public primary school no. 7 and the local secondary school. In 2014 I moved to Wrocław to study mathematics and computer science at the University of Wrocław. Alongside my studies, I was a teaching assistant for a student with disabilities (teaching programming in C and logic for computer scientists), and I ran countless extra classes for students struggling with the “Logic for Computer Scientists” course. I also had a short spell as a programmer: three months at Neurosoft in Wrocław (web applications in Groovy and MongoDB) and at Bloomberg in London (monitoring Cassandra databases). I completed my BSc with a research-level thesis, “Satisfiability of the Two-Variable Fragment of First-Order Logic with Counting Quantifiers over Finite Trees”, supervised by Witold Charatonik, whom I consider my scientific father.

Wrocław → IST Austria → Cachan → Oxford

From March 2017 to June 2018 I worked in Emanuel Kieroński’s NCN grant “A quest for new computer logics”, publishing three papers: at ESSLLI 2017, CSL 2017 and FSTTCS 2017. In 2017 I also did an internship at IST Austria near Vienna, working with Krishnendu Chatterjee on temporal logics for quantitative properties. In September 2017 I began my master’s studies in Cachan, where I completed the M1 year with honours (magna cum laude) under the supervision of Stéphane Demri. My M1 thesis was published at LICS (the best logic conference in the world!). After the M1, I spent three months at the University of Oxford, working with Michaël Cadilhac on tree algebras and their connections to circuit complexity.

Dresden → Wrocław → Vienna

In April 2019 I became a PhD student of Sebastian Rudolph at TU Dresden, and on 25 June 2024 I defended my thesis with distinction (certificate). In the academic year 2024/25 I worked on a few open problems around propositional dynamic logic and friends. Since April 2026 I have been leading a three-year FWF project at TU Wien on the decidability and complexity of the finite satisfiability problem for dynamic logics.

Research

My research concerns decidable fragments of first-order logic (including the guarded, fluted/ordered and two-variable fragments, description logics and temporal logics) and, more recently, the finite satisfiability problem for dynamic logics. I am always tempted to try new things, so my research is a bit diverse, at least within logic.

• Guarded fragments
• Fluted & ordered logics
• Two-variable logic
• Description logics
• Temporal logics
• Propositional dynamic logic
• Finite satisfiability
• Modal μ-calculus