Skip to main content
SpringerLink
Log in

The TPS theorem proving system

  • Extended Abstracts Of Current Deduction Systems
  • Conference paper
  • First Online:
8th International Conference on Automated Deduction (CADE 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 230))

Included in the following conference series:

This work is supported by NSF grant DCR-8402532.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter B. Andrews, Theorem Proving via General Matings, Journal of the Association for Computing Machinery 28 (1981), 193–214.

    Google Scholar 

  2. Peter B. Andrews, Dale A. Miller, Eve Longini Cohen, Frank Pfenning, "Automating Higher-Order Logic," in Automated Theorem Proving: After 25 Years, edited by W. W. Bledsoe and D. W. Loveland, Contemporary Mathematics series, vol. 29, American Mathematical Society, 1984, 169–192.

    Google Scholar 

  3. Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth. Edinburgh LCF, Lecture Notes in Computer Science 78, Springer Verlag, 1979.

    Google Scholar 

  4. Gérard P. Huet, "A Mechanization of Type Theory," in Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI, 1973, 139–146.

    Google Scholar 

  5. Dale A. Miller, Eve Longini Cohen, Peter B. Andrews, "A Look at TPS," in 6th Conference on Automated Deduction, New York, edited by Donald W. Loveland, Lecture Notes in Computer Science 138, Springer-Verlag, June 1982, 50–69.

    Google Scholar 

  6. Dale A. Miller. Proofs in Higher-Order Logic, Ph.D. Thesis, Carnegie-Mellon University, October, 1983. 81 pp.

    Google Scholar 

  7. Dale A. Miller, "Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs," in 7th International Conference on Automated Deduction, Napa, California, USA, edited by R. E. Shostak, Lecture Notes in Computer Science 170, Springer-Verlag, May 14–16, 1984, 375–393.

    Google Scholar 

  8. Frank Pfenning, "Analytic and Non-analytic Proofs," in 7th International Conference on Automated Deduction, Napa, California, USA, edited by R. E. Shostak, Lecture Notes in Computer Science 170, Springer-Verlag, May 14–16, 1984, 394–413.

    Google Scholar 

  9. Frank Pfenning. Proof Transformations in Higher-Order Logic, Ph.D. Thesis, Carnegie-Mellon University, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Carnegie Mellon University, 15213, Pittsburgh, Pa., USA

    Peter B. Andrews, Frank Pfenning, Sunil Issar & C. P. Klapper

Authors
  1. Peter B. Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sunil Issar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. C. P. Klapper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andrews, P.B., Pfenning, F., Issar, S., Klapper, C.P. (1986). The TPS theorem proving system. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_128

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation