A characterization of medial as rewriting rule

Lutz Straßburger

doi:10.1007/978-3-540-73449-9_26

A characterization of medial as rewriting rule

Lutz Straßburger

INRIA-Futurs and Xyleme

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings
Publisher	Springer Verlag
Pages	344-358
Number of pages	15
ISBN (Print)	9783540734475
DOIs	https://doi.org/10.1007/978-3-540-73449-9_26
Publication status	Published - 1 Jan 2007
Externally published	Yes
Event	18th International Conference on Rewriting Techniques and Applications, RTA 2007 - Paris, France Duration: 26 Jun 2007 → 28 Jun 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4533 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Rewriting Techniques and Applications, RTA 2007
Country/Territory	France
City	Paris
Period	26/06/07 → 28/06/07

Access to Document

10.1007/978-3-540-73449-9_26

Cite this

Straßburger, L. (2007). A characterization of medial as rewriting rule. In Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings (pp. 344-358). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4533 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73449-9_26

@inproceedings{de249673ea534056bf2efcc09c926f88,

title = "A characterization of medial as rewriting rule",

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.",

author = "Lutz Stra{\ss}burger",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-73449-9\_26",

language = "English",

isbn = "9783540734475",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "344--358",

booktitle = "Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings",

note = "18th International Conference on Rewriting Techniques and Applications, RTA 2007 ; Conference date: 26-06-2007 Through 28-06-2007",

}

Straßburger, L 2007, A characterization of medial as rewriting rule. in Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4533 LNCS, Springer Verlag, pp. 344-358, 18th International Conference on Rewriting Techniques and Applications, RTA 2007, Paris, France, 26/06/07. https://doi.org/10.1007/978-3-540-73449-9_26

A characterization of medial as rewriting rule. / Straßburger, Lutz.
Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings. Springer Verlag, 2007. p. 344-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4533 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A characterization of medial as rewriting rule

AU - Straßburger, Lutz

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-73449-9_26

DO - 10.1007/978-3-540-73449-9_26

M3 - Conference contribution

AN - SCOPUS:38049141245

SN - 9783540734475

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 344

EP - 358

BT - Term Rewriting and Applications - 18th International Conference, RTA 2007, Proceedings

PB - Springer Verlag

T2 - 18th International Conference on Rewriting Techniques and Applications, RTA 2007

Y2 - 26 June 2007 through 28 June 2007

ER -

A characterization of medial as rewriting rule

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this