Mikhail Kanovich is a contemporary logician and computer scientist known for work on linear logic, proof theory, and the computational complexity of logical systems. His research bridges mathematical logic and theoretical computer science, particularly regarding decidability and complexity of substructural logics.
Contributions to the proof theory and complexity analysis of linear logic
Research on decidability problems in substructural logics
Work bridging philosophical logic and theoretical computer science
Analysis of the tension between a priori logical knowledge and computational constraints