A proof of Lyndon's finite basis theorem

✍ Scribed by Joel Berman

• Book ID: 103056390
• Publisher: Elsevier Science
• Year: 1980
• Tongue: English
• Weight: 629 KB
• Volume: 29
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(80)90150-8

✦ Synopsis

A new proof is given of the theorem, originally proved by R.C. Lyndon, that any two element algebra of finite similarity type has a finite basis for its equations. We also provide a new proof of a result of W. Taylor that any equational class generated by a two element algebraic system contains only a finite number of subdirectly irreducible members, each of which is r";nite. The original proofs of these two theorems relied on E.L. Post's classification of the two element algebraic systems. Our paper uses Instead some recent results from universal algebra.

In this note we provide a new proof of the following result of R.C. Lyndon [S].