On the Computational Complexity of Cut-Elimination in Linear Logic.
Harry G. MairsonKazushige TeruiPublished in: ICTCS (2003)
Keyphrases
- linear logic
- cut elimination
- computational complexity
- sequent calculus
- fixed point
- proof theoretic
- desirable properties
- intuitionistic logic
- wide class
- natural deduction
- logical framework
- inference rules
- proof search
- logic programming
- decision problems
- artificial intelligence
- sufficient conditions
- linear time temporal logic