Mikhail R. Starchak

Mikhail R. Starchak is an Assistant Professor at the Department of Informatics, Faculty of Mathematics and Mechanics, St. Petersburg State University. He holds a Candidate of Sciences degree in Mathematics and Physics with a focus on mathematical logic and discrete mathematics.

His research lies at the intersection of logic and computer science, particularly in definability, decidability, and computational complexity within arithmetic theories. His work explores quantifier elimination, existential fragments of arithmetic, and logical definability with operations such as addition, divisibility, and bitwise minimum.

His recent publications in ICALP, FoSSaCS, and ISSAC indicate a strong focus on theoretical foundations of computation, especially in proving decidability and complexity bounds for logical theories involving linear and exponential functions. The trend shows a deep specialization in refining and applying quantifier elimination techniques to solve long-standing definability problems.

Scientific Service and Recognition:

• Program Committee Member, SETTA 2025
• Program Committee Member, RP 2025
• Invited Speaker, Workshop on Recent Developments on Arithmetic Theories and Applications, 2025

Grants and Research Leadership:

• Principal Investigator, Russian Science Foundation Grant: Existential Arithmetics with Addition and Regular Predicates (07.2023 – 06.2025)

He actively contributes to the theoretical computer science community through service and research leadership. No information is available regarding student advising or laboratory affiliations.