Refutation Calculi Professors and Supervisors

Gabriele PulciniView profile

Assistant Professor

Campus Bio-Medico University of RomeItaly

Gabriele Pulcini is an Assistant Professor in Logic and Philosophy of Science at the Philosophy Department, University of Rome 'Tor Vergata'. He holds dual PhDs in Philosophy and Theory of Human Sciences from the University of Rome 3 and in Discrete Mathematics from the University of Aix-Marseille II. Since 2020, he has served as a council member of the Italian Society for Logic and Philosophy of Science (SILFS). Previously, he was a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) in Amsterdam, and has taught master courses in proof theory and set theory at institutions including the Sorbonne, University of Campinas, and the University of Lisbon. His research focuses on proof theory, Hilbert's 24th problem, and the philosophy of mathematics, with contributions to linear/nonmonotonic logics, refutation calculi, and Gödel's incompleteness theorems. His work bridges formal logic with interdisciplinary applications, such as integrating logical frameworks into molecular biology. Key themes include deductive saturation, context-sensitiveness in logical systems, and foundational questions in mathematical logic. Pulcini's publications explore advanced topics like cut-elimination, complementary proof nets, and fractional semantics, often addressing the interplay between classical and non-classical logics. His recent work emphasizes innovations in refutation systems and their philosophical implications.

Official University Profile

Beniamino AccattoliView profile

Researcher

IMDEA Software InstituteSpain

Beniamino Accattoli is a Researcher in Computer Science at Inria , where he has been a member of the PARTOUT team since January 2015. His work centers on higher-order computation, particularly the lambda calculus, connecting theoretical mathematics with practical implementations of functional languages. Current Projects : CANofGAS (2022–2025), COCA HOLA (2016–2021). Recent Events : Program Committee member for LSFA 2025, ICFP 2024, and FSCD 2024; lecturer at MPRI 2023–24. Research Themes : Internal : Developing mathematical theories of sharing in lambda calculus to enhance efficiency in functional language implementations. External : Establishing reasonable cost models for time and space in lambda calculus, resolving long-standing open problems in computational complexity. Scientific Awards : Distinguished Paper Award at ICFP 2022. Best Paper Award at RTA 2013. Academic Contributions : Co-inventor of the Linear Substitution Calculus , a canonical framework for higher-order computation with sharing. Proved polynomial equivalence between lambda calculus and Turing machines for time complexity with Ugo Dal Lago. Refuted token-machine conjectures and introduced environment-based machines for space complexity with Ugo Dal Lago and Gabriele Vanoni.

Official University Profile

Cesare TinelliView profile

Professor

University of IowaUnited States

Cesare Tinelli is the F. Wendell Miller Professor of Computer Science at the University of Iowa within the College of Liberal Arts and Sciences. He is a co-director of the Computational Logic Center and leads the development of critical tools like the CVC4 and cvc5 SMT solvers, as well as the Kind model checker. His academic credentials include: Ph.D. in Computer Science (1999), University of Illinois at Urbana-Champaign M.S. in Computer Science (1995), University of Illinois at Urbana-Champaign Laurea in Scienze dell'Informazione (1990), University of Bari Research Interests : Tinelli specializes in Automated Reasoning , particularly Satisfiability Modulo Theories (SMT) , Model Checking , Software Verification , and Formal Methods . His recent work explores Inductive Reasoning in SMT , Proof-Certificate Generation , and Logical Frameworks for Proof Systems . His methodologies bridge theoretical advancements with practical implementations, impacting both academia and industry. Scientific Contributions : Tinelli's research drives innovation in SMT solving, model checking, and automated theorem proving. His 15 most recent publications span topics from stateful protocol testing ( Saecred ) to proof certification ( IsaRare ) and generalized optimization ( Generalized OMT ). Awards and Recognition : NSF CAREER Award (2003) Haifa Verification Conference Award (2010) CAV Award (2021) Advising and Collaborations : His former students and postdocs hold positions at leading institutions like NASA, Intel, MIT, and EPFL. He collaborates with organizations such as Amazon, Facebook, General Electric, and Microsoft.

Official University Profile

Anela LolicView profile

Researcher

Vienna University of TechnologyAustria

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.

Official University Profile