Anela Lolic

Anela Lolic is a researcher at the Institute of Logic and Computation within the Faculty of Computer Science at Vienna University of Technology (TU Wien). She leads the FWF-funded project 'Proof analysis and automated deduction for recursive structures' (I 5848) as Principal Investigator, collaborating with Czech researchers under GAČR funding. Her work bridges theoretical logic with practical computer science applications, particularly in formal verification and automated reasoning systems.

Dr. Lolic's research focuses on computational proof theory and automated deduction, with specific expertise in proof schemata, Herbrand's theorem applications, and inductive reasoning frameworks. Her work explores how to extract computational content from formal proofs, developing methods to analyze recursive structures in mathematical induction. This research has significant implications for automated theorem proving and formal verification in computer science.

Her publication record demonstrates consistent contributions to top venues in logic and theoretical computer science, with recent work focusing on extending Herbrand's theorem to inductive proofs and developing formal frameworks for analyzing recursive proof structures. These publications reveal a clear trajectory toward making inductive reasoning more amenable to computational analysis and automation.

Scientific recognition includes:

• 2020 SILFS Prize for Women in Logic and the Philosophy of Science
• L'ORÉAL Austria PostDoc Fellowship (2019)
• DOC Fellowship of the Austrian Academy of Sciences (2018)

She serves as publicity chair for the Kurt Gödel Society and actively organizes academic events including summer schools and workshops on proof theory. Her mentoring includes supervising PhD student Stella Mahler on projects related to proof schemata and primitive recursive arithmetic. Dr. Lolic also contributes to the Pandaforest project, welcoming student involvement in related research activities.