A Terminating Evaluation-Driven Variant of G3i
We present Gbu, a terminating variant of the sequent calculus G3i for intuitionistic propositional logic. Gbu modifies G3i by annotating the sequents so to distinguish rule applications into two phases: an unblocked phase where any rule can be backward applied, and a blocked phase where only right rules can be used. Derivations of Gbu have a trivial translation into G3i. Rules for right implication exploit an evaluation relation, defined on sequents; this is the key tool to avoid the generation of branches of infinite length in proof-search. To prove the completeness of Gbu, we introduce a refutation calculus Rbu for unprovability dual to Gbu. We provide a proof-search procedure that, given a sequent as input, returns either a Rbu-derivation or a Gbu-derivation of it.
Unable to display preview. Download preview PDF.
- 1.Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press (1997)Google Scholar
- 5.Gabbay, D.M., Olivetti, N.: Goal-Directed Proof Theory. Springer (2000)Google Scholar
- 9.Pinto, L., Dyckhoff, R.: Loop-free construction of counter-models for intuitionistic propositional logic. In: Behara, M., et al. (eds.) Symposia Gaussiana, Conference A, pp. 225–232. Walter de Gruyter, Berlin (1995)Google Scholar
- 10.Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43. Cambridge University Press (1996)Google Scholar