Bounds for cut elimination in intuitionistic propositional logic.
Jörg HudelmaierPublished in: Arch. Math. Log. (1992)
Keyphrases
- propositional logic
- cut elimination
- linear logic
- sequent calculus
- first order logic
- natural deduction
- inference rules
- wide class
- belief revision
- sufficient conditions
- logical framework
- theorem prover
- proof search
- proof procedure
- lower bound
- quantified boolean formulae
- logic programming
- desirable properties
- modal logic
- nonmonotonic logics
- nonmonotonic reasoning
- fixed point
- classical logic
- theorem proving
- satisfiability testing
- horn clauses
- knowledge base
- knowledge representation
- search algorithm