Anupam Das
Researcher in proof theory, logic and complexity
Menu
Home
CV
Research
MiLC
Contact
On linear rewriting systems for Boolean logic and some applications to proof theory
Read more
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic
Read more
From positive and intuitionistic bounded arithmetic to monotone proof complexity
Read more
On Nested Sequents for Constructive Modal Logics
Read more
A Complete Axiomatization of MSO on Infinite Trees
Read more
No complete linear term rewriting system for propositional logic
Read more
On the relative proof complexity of deep inference via atomic flows
Read more
On the pigeonhole and related principles in deep inference and monotone systems
Read more
Posts navigation
« Prev
1
2
3
Next »
➤