Polynomial completeness in algebraic systems
Our rough guess is there are 89,500 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 58 minutes to read. With a half hour per day, this will take 12 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Pixley, Alden F - Contributor
Publication
2001 - Chapman & Hall/CRC, Boca Raton, Fla, Florida
Language
English
Word Count
89,500 words, Guess
Page Count
358 pages
Identifiers
- Open LibraryOL16983529M
- ISBN-101584882034
- OCLC Control Number1048937467
- OCLC Control Number44132933
- Library of Congress Control Number00034538
and 1 more
- Goodreads6707140
Classifications
- LCCQA9.67 .K37 2001
Description
"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.
Subjects
Other Editions
- Polynomial completeness in algebraic systems
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!