List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7559275 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
First-order automated reasoning with theories: when deduction modulo theory meets practice
Journal of Automated Reasoning | 2020-11-02 | Paper |
| A Semantic Proof that Reducibility Candidates entail Cut Elimination | 2020-05-27 | Paper |
| Computing invariants with transformers: experimental scalability and accuracy | 2016-05-10 | Paper |
Normalisation by completeness with Heyting algebras
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Polarizing double-negation translations
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Semantic A-translations and super-consistency entail classical cut elimination
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
A simple proof that super-consistency implies cut elimination
Notre Dame Journal of Formal Logic | 2012-11-29 | Paper |
Orthogonality and Boolean Algebras for Deduction Modulo
Lecture Notes in Computer Science | 2011-06-17 | Paper |
| Cut elimination in the intuitionistic theory of types with axioms and rewriting cuts, constructively | 2011-03-30 | Paper |
Resolution is cut-free
Journal of Automated Reasoning | 2010-05-26 | Paper |
Completeness and cut-elimination in the intuitionistic theory of types. II.
Journal Of Logic And Computation | 2010-04-21 | Paper |
On Constructive Cut Admissibility in Deduction Modulo
Lecture Notes in Computer Science | 2009-03-10 | Paper |
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
Computer Science Logic | 2008-11-20 | Paper |
A Semantic Completeness Proof for TaMeD
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
A Simple Proof That Super-Consistency Implies Cut Elimination
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Typed Lambda Calculi and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Research outcomes over time
This page was built for person: Olivier Hermant
