Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2

  • System Description
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

  • 763 Accesses

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. R. Constable and others, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, 1986.

    Google Scholar 

  2. H. B. Curry and R. Feys, Combinatory Logic, Vol. I, North Holland, Amsterdam, 1958.

    Google Scholar 

  3. Mike Gordon, “HOL, a Proof Generating System for Higher Order Logic”, in VLSI Specification, Verification, and Synthesis, edited by Birtwistle and Subrahmanyam, Kluwer, 1987.

    Google Scholar 

  4. Holmes, M. R. “Systems of combinatory logic related to Quine's ‘New Foundations'”. Annals of Pure and Applied Logic, vol. 53 (1991), pp. 103–133.

    Article  Google Scholar 

  5. M. Randall Holmes, “A Functional Formulation of First-Order Logic ‘With Infinity’ Without Bound Variables”, preprint.

    Google Scholar 

  6. M. Randall Holmes, “Untyped λ-calculus with relative typing”, preprint.

    Google Scholar 

  7. W. V. O. Quine, “Algebraic Logic and Predicate Functors”, Bobbs-Merrill, 1971 (booklet).

    Google Scholar 

  8. Alfred Tarski and Steven Givant, A Formalization of Set Theory Without Variables, American Mathematical Society, Providence, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Boise State University, Boise, Idaho, USA

    M. Randall Holmes

Authors
  1. M. Randall Holmes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holmes, M.R. (1995). Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_78

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_78

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59200-6

  • Online ISBN: 978-3-540-49223-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation