Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic
TPS is an automated theorem proving system which can be used to prove theorems of first- or higher-order logic automatically, interactively, or in a combination of these modes of operation. Proofs in TPS are presented in natural deduction style. ETPS is a program which was obtained from TPS by deleting all the facilities for proving theorems automatically. ETPS can be used by students to learn how to prove theorems interactively. The objective of the tutorial is to teach participants how to make effective use of TPS and ETPS.
KeywordsTheorem Prove Type Theory Automate Reasoning Natural Deduction Automate Deduction
- 8.Issar, S.: Path-Focused Duplication: A Search Procedure for General Matings. In: AAAI 1990. Proceedings of the Eighth National Conference on Artificial Intelligence, vol. 1, pp. 221–226. AAAI Press/The MIT Press (1990)Google Scholar
- 10.Pfenning, F., Nesmith, D.: Presenting Intuitive Deductions via Symmetric Simplification. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 336–350. Springer, Heidelberg (1990)Google Scholar