A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Natural deduction as higher-order resolution

1986
*
The Journal of Logic Programming
*

An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause. Resolution gives both forwards and backwards proof, supporting a large class of logics. Isabelle has been used to prove theorems in Martin-Lofs constructive type theory. Quantifiers pose several difficulties: substitution, bound variables,

doi:10.1016/0743-1066(86)90015-4
fatcat:d2jkwnbuyzeo7ko2ymi6qvxvpm