Max Kanovich is a contemporary logician known for work in linear logic, proof theory, and the computational complexity of logical systems. His research explores the boundaries between logical reasoning and computation, particularly concerning decidability and complexity in substructural logics.
Contributions to the complexity analysis of linear logic
Research on Horn fragments of linear logic and their decidability
Work on proof theory and substructural logics
Studies on the intersection of logic and computation