pdf-format: |
|
@InProceedings{baillot_et_al:LIPIcs:2016:6580, author = {Patrick Baillot and Anupam Das}, title = {{Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Jean-Marc Talbot and Laurent Regnier}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6580}, URN = {urn:nbn:de:0030-drops-65807}, doi = {10.4230/LIPIcs.CSL.2016.40}, annote = {Keywords: proof theory, linear logic, bounded arithmetic, polynomial time computation, implicit computational complexity} }
Keywords: | proof theory, linear logic, bounded arithmetic, polynomial time computation, implicit computational complexity | |
Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
Issue date: | 2016 | |
Date of publication: | 29.08.2016 |