A characterization of medial as rewriting rule

Authors:
Lutz Straßburger
Affiliations:
INRIA Futurs, École Polytechnique, LIX, Palaiseau Cedex, France
Venue:
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Year:
2007

Citing 6
Cited 1

Term rewriting and all that

Term rewriting and all that
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Handsome proof-nets: perfect matchings and cographs

Theoretical Computer Science - Linear logic
Full Completeness of the Multiplicative Linear Logic of Chu Spaces

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
MELL in the calculus of structures

Theoretical Computer Science
A system of interaction and structure

ACM Transactions on Computational Logic (TOCL)

A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Medial is an inference rule scheme that appears in various deductive systems based on deep inference. In this paper we investigate the properties of medial as rewriting rule independently from logic. We present a graph theoretical criterion for checking whether there exists a medial rewriting path between two formulas. Finally, we return to logic and apply our criterion for giving a combinatorial proof for a decomposition theorem, i.e., proof theoretical statement about syntax.