License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2017.31
URN: urn:nbn:de:0030-drops-77204
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7720/
Go to the corresponding LIPIcs Volume Portal


Straßburger, Lutz

Combinatorial Flows and Their Normalisation

pdf-format:
LIPIcs-FSCD-2017-31.pdf (0.6 MB)


Abstract

This paper introduces combinatorial flows that generalize combinatorial proofs such that they also include cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic proofs are translated into combinatorial flows and vice versa.

BibTeX - Entry

@InProceedings{straburger:LIPIcs:2017:7720,
  author =	{Lutz Stra{\ss}burger},
  title =	{{Combinatorial Flows and Their Normalisation}},
  booktitle =	{2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)},
  pages =	{31:1--31:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-047-7},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{84},
  editor =	{Dale Miller},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7720},
  URN =		{urn:nbn:de:0030-drops-77204},
  doi =		{10.4230/LIPIcs.FSCD.2017.31},
  annote =	{Keywords: proof equivalence, cut elimination, substitution, deep inference}
}

Keywords: proof equivalence, cut elimination, substitution, deep inference
Seminar: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)
Issue Date: 2017
Date of publication: 21.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI