Natural Deduction as Higher-Order Resolution

Details Natural Deduction as Higher-Order Resolution Natural Deduction as Higher-Order Resolution

2000-10-31

arxiv.org/abs/cs/9301104v1

Journal of Logic Programming 3 (1986), 237-258

Computer Science

Logic in Computer Science

Scientific paper

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-L\"of's Constructive Type Theory. Quantifiers pose several difficulties: substitution, bound variables, Skolemization. Isabelle's representation of logical syntax is the typed lambda-calculus, requiring higher- order unification. It may have potential for logic programming. Depth-first subgoaling along inference rules constitutes a higher-order Prolog.

Affiliated with

Also associated with

No associations

Rating

Natural Deduction as Higher-Order Resolution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Natural Deduction as Higher-Order Resolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Natural Deduction as Higher-Order Resolution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446298