Published in: LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)
Satoru Kuroda. Axiomatizing proof tree concepts in Bounded Arithmetic. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 440-454, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kuroda:LIPIcs.CSL.2012.440, author = {Kuroda, Satoru}, title = {{Axiomatizing proof tree concepts in Bounded Arithmetic}}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL}, pages = {440--454}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-42-2}, ISSN = {1868-8969}, year = {2012}, volume = {16}, editor = {C\'{e}gielski, Patrick and Durand, Arnaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.440}, URN = {urn:nbn:de:0030-drops-36893}, doi = {10.4230/LIPIcs.CSL.2012.440}, annote = {Keywords: Bounded Arithmetic, LOGCFL, LOGDCFL, Proof tree} }
Feedback for Dagstuhl Publishing