An application to teaching in logic course of ATP based on natural deduction

System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 624)


Our theorem proving system can construct the proofs of logic formulas with quantifiers in a natural deduction style. It is written in GCLISP. Here is an application to education of our automatic theorem proving system, named it TTP, short for Teaching Theorem Proving. Now TTP not only can give students hints, helps but also demonstrate them how it proves theorems itself, correct and grade their homework, point out where and why they make mistakes and record their-works with grades in teacher's directory. Even we asked our students to take the examinations by using our TTP system, the TTP system just is a fair and industrious teacher. TTP system only needs students to type inferrence rule names except for entering the formulas to be proven, students don't need to manipulate logic formulas during solving their problems. Now our TTP not only can be loaded in IBM PC, but also SUN workstation, ELXSI. It runs in Artificial Intelligence Lab. of our university and is available for all students of our university.


logic natural deduction theorem proving 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrews, P. B., An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Orlando, Academic Pr., Inc., 1986.Google Scholar
  2. 2.
    Manna, Z., Mathematical Theory of Computation, New York, 1974.Google Scholar
  3. 3.
    Tremblay, J. P. and Manohar, R., Discrete Mathematial Structures with Applications to Computer Science, New York, McGray-Hill, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Li Dafa
    • 1
  1. 1.Dept. of Applied MathematicsTsinghua UniversityBeijingChina

Personalised recommendations