Corrected upper bounds for free-cut elimination.
Arnold BeckmannSamuel R. BussPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- upper bound
- cut elimination
- sequent calculus
- linear logic
- lower bound
- upper and lower bounds
- wide class
- lower and upper bounds
- natural deduction
- proof theoretic
- inference rules
- sufficient conditions
- tight upper and lower bounds
- default reasoning
- modal logic
- logic programming
- graphical models
- general purpose
- proof search
- software engineering
- efficiently computable
- state space
- linear time temporal logic
- expert systems