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]

Authors

Noriko H. Arai

This author has not been identified. Look up 'Noriko H. Arai' in Google