Skip to main content

How to construct finite algebras which are not finitely based

  • Conference paper
  • First Online:
Universal Algebra and Lattice Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1149))

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garrett Birkhoff On the structure of abstract algebras, Cambridge Phil. Soc. 31 (1935) 433–454.

    Article  MATH  Google Scholar 

  2. Roger Lyndon Identities in two-valued calculi Trans. Amer. Math. Soc. 71 (1951) 457–465.

    Article  MathSciNet  MATH  Google Scholar 

  3. Identities in finite algebras, Proc. Amer. Math. Soc. 5 (1954) 8–9.

    Article  MathSciNet  MATH  Google Scholar 

  4. G. McNulty and C. Shallon Inherently nonfinitely based finite algebras in Universal Algebra and Lattice Theory, R. Freese and O. Garcia, eds., Lecture Notes in Mathematics, vol. 1004, Springer-Verlag, New York (1983) 206–231.

    Chapter  Google Scholar 

  5. V.L. Murskii On the number of k-element algebras with one binary operation without a finite basis of identities, (Russian) Problemy Kibernet 35 (1979) 5–27.

    MathSciNet  Google Scholar 

  6. B.H. Neumann Identical relations in groups, I., Math. Ann. 14 (1937) 506–525.

    Article  MathSciNet  MATH  Google Scholar 

  7. R. Park Equational classes of non-associative ordered algebras, Ph. D. Thesis University of California at Los Angeles, 1976.

    Google Scholar 

  8. A four-element algebra whose identities are not finitely based, Algebra Universalis 11 (1980) 255–260.

    Article  MathSciNet  MATH  Google Scholar 

  9. P. Perkins Basic questions for general algebras, Algebra Universalis, 19 (1984) 16–23.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stephen D. Comer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

McNulty, G.F. (1985). How to construct finite algebras which are not finitely based. In: Comer, S.D. (eds) Universal Algebra and Lattice Theory. Lecture Notes in Mathematics, vol 1149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098464

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39638-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics