Sequent Schema for Derived Rules

Abstract

This paper presents a general sequent schema language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent schema language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent schema language and with any new rules found using this mechanism is conservative.

By using the sequent schema language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent schema language can be efficiently implemented using MetaPRL’s fast rewriting engine.

This work was partially supported by ONR grant N00014-01-1-0765 and AFRL grants F49620-00-1-0209 and F30602-98-2-0198.