pdfformat: 

@InProceedings{baskar_et_al:LIPIcs:2013:4370, author = {Anguraj Baskar and Prasad Naldurg and K. R. Raghavendra and S. P. Suresh}, title = {{Primal Infon Logic: Derivability in Polynomial Time}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {163174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897644}, ISSN = {18688969}, year = {2013}, volume = {24}, editor = {Anil Seth and Nisheeth K. Vishnoi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4370}, URN = {urn:nbn:de:0030drops43708}, doi = {10.4230/LIPIcs.FSTTCS.2013.163}, annote = {Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property} }
Keywords:  Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)  
Issue date:  2013  
Date of publication:  2013 