Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic.
Karim NourChristophe RaffalliPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- intuitionistic logic
- linear logic
- natural deduction
- classical logic
- proof theoretic
- proof theory
- classical first order logic
- theorem prover
- logic programming
- proof search
- cut elimination
- valued logic
- higher order
- sequent calculus
- fixed point
- first order logic
- theorem proving
- model theoretic
- inference rules
- normal form
- deductive databases
- default reasoning
- modal logic
- knowledge base