Tractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference

Noriko H. Arai. Tractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference. Theoretical Computer Science, 170(1-2):129-144, 1996. [doi]

Abstract

Abstract is missing.