Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension.
Michael GavrilovichPublished in: LFCS (1997)
Keyphrases
- propositional logic
- cut elimination
- sequent calculus
- linear logic
- inference rules
- first order logic
- natural deduction
- wide class
- belief revision
- sufficient conditions
- theorem proving
- quantified boolean formulae
- modal logic
- logic programming
- linear time temporal logic
- belief change
- propositional satisfiability
- theorem prover
- logical framework
- nonmonotonic logics
- fixed point
- satisfiability testing
- search space