Abstract
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.
The development of TPS and ETPS was supported by the National Science Foundation under grant CCR-9732312 and previous grants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, London (1986)
Andrews, P.B.: On Connections and Higher-Order Logic. Journal of Automated Reasoning 5, 257–291 (1989)
Andrews, P.B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F., Xi, H.: TPS: A Theorem Proving System for Classical Type Theory. Journal of Automated Reasoning 16, 321–353 (1996)
Bishop, M.: A breadth-first strategy for mating search. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 359–373. Springer, Heidelberg (1999)
Bishop, M., Andrews, P.B.: Selectively instantiating definitions. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 365–380. Springer, Heidelberg (1998)
Church, A.: A Formulation of the Simple Theory of Types. Journal of Symbolic Logic 5, 56–68 (1940)
Goldson, D., Reeves, S., Bornat, R.: A Review of Several Programs for the Teaching of Logic. The Computer Journal 36, 373–386 (1993)
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)
Miller, D.A.: A Compact Representation of Proofs. Studia Logica 46(4), 347–370 (1987)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrews, P.B., Brown, C.E. (2000). Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_44
Download citation
DOI: https://doi.org/10.1007/10721959_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67664-5
Online ISBN: 978-3-540-45101-3
eBook Packages: Springer Book Archive