Elementary complexity and geometry of interaction

Abstract

We introduce a geometry of interaction model given by an algebra of clauses equipped with resolution (following [Gir95a]) into which proofs of Elementary Linear Logic can be interpreted. In order to extend geometry of interaction computation (Execution) to more programs of the algebra than just those coming from proofs, we dene a variant of Execution (called Weak Execution). Its application to any program of clauses is shown to terminate with a bound on the number of steps which is elementary in the size of the program. We establish that Weak Execution coincides with standard Execution on programs coming from proofs.