From positive and intuitionistic bounded arithmetic to monotone proof complexity

Anupam Das. From positive and intuitionistic bounded arithmetic to monotone proof complexity. In Martin Grohe, Eric Koskinen, Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. pages 126-135, ACM, 2016. [doi]

Abstract

Abstract is missing.