A Henkin-style completeness proof for the pure implicational calculus.
George F. SchummPublished in: Notre Dame J. Formal Log. (1975)
Keyphrases
- natural deduction
- automated theorem proving
- proof search
- sequent calculus
- theorem proving
- proof procedure
- theorem prover
- linear logic
- cut elimination
- provably correct
- inference rules
- proof theoretic
- automated deduction
- proof planning
- algebraic structure
- proof theory
- term rewriting
- databases
- automated theorem provers
- modal logic
- query language
- information retrieval