Published in: LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, and S. P. Suresh. Primal Infon Logic: Derivability in Polynomial Time. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 163-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{baskar_et_al:LIPIcs.FSTTCS.2013.163, author = {Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K. R. and Suresh, S. P.}, title = {{Primal Infon Logic: Derivability in Polynomial Time}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {163--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163}, URN = {urn:nbn:de:0030-drops-43708}, doi = {10.4230/LIPIcs.FSTTCS.2013.163}, annote = {Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property} }
Feedback for Dagstuhl Publishing