Skip to main content
SpringerLink
Log in

Obtaining complete sets of reductions and equations without using special unification algorithms

  • Rewrite Rules And The Completion Procedure II
  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

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

Included in the following conference series:

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

References

  1. Knuth, D. and Bendix, P. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra. Leech, J. (Ed.), Pergamon Press, New York, 1970, pp.263–297.

    Google Scholar 

  2. Lankford, D.S. and Ballantyne, A.M. Decision procedures for simple equational theories with a permutative axiom: Complete sets of permutative reductions. In Proc. 3rd Automated Deduction Workshop, MIT, August 1977.

    Google Scholar 

  3. Pedersen, J. Algorithms for completing sets of identities, Master's thesis, Emory University, 1983.

    Google Scholar 

  4. Pedersen, J. Obtaining complete sets of reductions and equations without using special unification algorithms. (submitted to J. ACM.)

    Google Scholar 

  5. Peterson, G.E. and Stickel, M.E. Complete sets of reductions for some equational theories. J. ACM 28, 2 (1981), 233–264.

    Article  Google Scholar 

  6. Whitman, P. Free lattices. Ann. of Math. 42 (1941), 325–330.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, UCLA, 90024, Los Angeles, CA, USA

    John Pedersen

Authors
  1. John Pedersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob F. Caviness

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pedersen, J. (1985). Obtaining complete sets of reductions and equations without using special unification algorithms. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_302

Download citation

  • DOI: https://doi.org/10.1007/3-540-15984-3_302

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15984-1

  • Online ISBN: 978-3-540-39685-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation