ACM/IEEE Logic in Computer Science, LICS 2016


Article Details
Title: From positive and intuitionistic bounded arithmetic to monotone proof complexity
Article URLs:
Alternative Article URLs:
Authors: Anupam Das
  • Université de Lyon, LIP
  • CNRS
  • Université Claude-Bernard Lyon, ENS de Lyon
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/lics/Das16
Author Comments:

Discuss this paper and its artifacts below