Skip to main content
Log in

The combinatorial degrees of proofs and equations

  • Published:
algebra universalis Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Bednarak, A. R. andWallace, A. D.,The functional equation (xy)(yz)=xz, Ref. Roum. Math. Pures et Appl.16 (1971), 3–6.

    Google Scholar 

  2. Birjukov, A. P.,Semigroups defined by identities, Dokl. Akad. Nauk SSSR149 (1963) (English translation, Soviet Math. Dokl.4 (1963), 333–336).

    Google Scholar 

  3. Dershowitz, N. andJouannaud, J.-P.,Rewrite Systems, Chapter 6 in Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, J. Van Leeuwen ed., Elsevier, New York, 1990.

    Google Scholar 

  4. Kleiman, Yu. G.,On identities in groups, Trad. Moskov. Mat. Obschch.44 (1982) (English translation, Trans. Moscow Math. Soc. (1983), 63–110).

  5. Knuth, D. E. andBendix, P. B.,Simple word problems in universal algebras, inComputational Problems in Abstract Algebra, J. Leech, ed., Pergamon, NY, 1969.

    Google Scholar 

  6. McLean, D.,Idempotent semigroups, Amer. Math. Monthly61 (1954), 110–113.

    Google Scholar 

  7. McNulty, G. F.,Undecidable properties of finite sets of equations, J. Symbolic Logic41 (1968), 589–604.

    Google Scholar 

  8. Morse, M. andHedlund, G. A.,Unending chess, symbolic dynamics, and a problem in semigroups, Duke Math. J.11 (1944), 1–7.

    Google Scholar 

  9. Murskii, V. L.,Examples of varieties of semigroups, Mat. Zametki3 (1968), 663–670 (Russian).

    Google Scholar 

  10. Murskii, V. L.,Nondiscernable properties of finite systems of identity relations, Soviet Math. Dokl.12 (1971), 183–186.

    Google Scholar 

  11. Newman, M. H. A.,On theories with a combinatorial definition of “equivalence”, Ann. Math.43 (1942), 223–243.

    Google Scholar 

  12. Perkins, P.,Unsolvable problems for equational theories, Notre Dame J. Formal Logic8 (1967), 175–185.

    Google Scholar 

  13. Stein, S.,Semigroups satisfying xy=yg(x, y)x, Semigroup Forum36 (1987), 249–251.

    Google Scholar 

  14. Tamura, T.,Semigroups satisfying identity xy=f(x, y), Pac. J. Math.31 (1969), 513–521.

    Google Scholar 

  15. Tarski, A.,Equational Logic, inContributions to Mathematical Logic, K. Schütte, ed., North Holland, Amsterdam, 1968, 275–288.

    Google Scholar 

  16. Tarski, A., andGivant, S.,A Formalization of Set Theory without Variables, Colloquium Publications41 (1987), Amer. Math. Soc., Providence, R.I.

    Google Scholar 

  17. Thue, A.,Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I, Math. Nat. Kl. Christiana7 (1906), 1–22.

    Google Scholar 

  18. Solution of Problem E 3109, Amer. Math. Monthly94 (1987), 468–469.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stein, S. The combinatorial degrees of proofs and equations. Algebra Universalis 35, 472–484 (1996). https://doi.org/10.1007/BF01197185

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01197185

Navigation