Polynomial completeness in algebraic systems

Polynomial completeness in algebraic systems

by Kalle Kaarli, Alden F. Pixley

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"Polynomial Completeness in Algebraic Systems provides a coherent presentation of the subject, including primality, functional completeness, and affine completeness, as well as their several variations and generalizations. The authors focus on the recently developed theory of affine complete varieties. They present new results, including full proof that all affine complete varieties are congruence distributive, and that they are finitely generated if and only if they can be presented using only a finite number of basic operations. In addition to these important findings, the authors describe the different relationships between properties of lattices of equivalence relations and the systems of functions compatible with them."--BOOK JACKET.

Discuss Polynomial completeness in algebraic systems with other readers

Join or start a book club for Polynomial completeness in algebraic systems on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Polynomial completeness in algebraic systems?

Sign up free on Readfeed, then browse public clubs or start your own club with Polynomial completeness in algebraic systems as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Polynomial completeness in algebraic systems with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Polynomial completeness in algebraic systems with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.