Skip to Main content Skip to Navigation
Conference papers

Automating Theories in Intuitionistic Logic

Guillaume Burel 1, *
* Corresponding author
1 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulae. This is equivalent to proving within a so-called compatible theory. Conversely, given a first-order theory, one may want to internalize it into a rewrite system that can be used in deduction modulo, in order to get an analytic deductive system for that theory. In a recent paper, we have shown how this can be done in classical logic. In intuitionistic logic, however, we show here not only that this may be impossible, but also that the set of theories that can be transformed into a rewrite system with an analytic sequent calculus modulo is not co-recursively enumerable. We nonetheless propose a procedure to transform a large class of theories into compatible rewrite systems. We then extend this class by working in conservative extensions, in particular using Skolemization.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Guillaume Burel <>
Submitted on : Tuesday, June 23, 2009 - 6:30:19 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Saturday, November 26, 2016 - 10:09:20 AM


Files produced by the author(s)




Guillaume Burel. Automating Theories in Intuitionistic Logic. 7th International Symposium on Frontiers of Combining Systems -FroCoS'09, Sep 2009, Trento, Italy. pp.181-197, ⟨10.1007/978-3-642-04222-5_11⟩. ⟨inria-00395934v2⟩



Record views


Files downloads