Designing a Theorem Prover

Details Designing a Theorem Prover Designing a Theorem Prover

2001-03-29

arxiv.org/abs/cs/9301110v1

published in S. Abramsky, D. M. Gabbay, T. S. E. Maibaum (editors), Handbook of Logic in Computer Science, Vol II (Oxford, 199

Computer Science

Logic in Computer Science

Scientific paper

A step-by-step presentation of the code for a small theorem prover introduces theorem-proving techniques. The programming language used is Standard ML. The prover operates on a sequent calculus formulation of first-order logic, which is briefly explained. The implementation of unification and logical inference is shown. The prover is demonstrated on several small examples, including one that shows its limitations. The final part of the paper is a survey of contemporary research on interactive theorem proving.

Affiliated with

Also associated with

No associations

Rating

Designing a Theorem Prover 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 Designing a Theorem Prover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Designing a Theorem Prover will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418191