@inproceedings{hetzl_et_al:LIPIcs:2015:5410,
Address = {Dagstuhl, Germany},
Annote = {Keywords: proof theory, cut-elimination, Herbrand's theorem, tree grammars},
Author = {Hetzl, Stefan and Zivota, Sebastian},
BookTitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
Editor = {Kreutzer, Stephan},
File = {Tree Grammars for the Elimination of Non-prenex Cuts - Hetzl, Zivota (0) (0) - a - a - t.pdf},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
Pages = {110--127},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Tree Grammars for the Elimination of Non-prenex Cuts}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5410},
Volume = {41},
Year = {2015},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2015/5410},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.CSL.2015.110},
date-added = {2015-09-09 08:36:46 +0000},
date-modified = {2015-09-09 08:36:46 +0000},
urn = {urn:nbn:de:0030-drops-54103},
doi = {10.4230/LIPIcs.CSL.2015.110}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A