A Semantic Proof that Reducibility Candidates entail Cut Elimination.
Denis CousineauOlivier HermantPublished in: RTA (2012)
Keyphrases
- cut elimination
- linear logic
- sequent calculus
- natural deduction
- inference rules
- wide class
- proof theoretic
- proof search
- sequent calculi
- modal logic
- theorem prover
- sufficient conditions
- logical framework
- natural language
- semantic web
- fixed point
- logic programming
- semantic network
- machine learning
- linear time temporal logic
- theorem proving
- proof theory
- object oriented
- search algorithm