MARC Record from marc_columbia

LEADER: 04211cam a2200613Mi 4500
001 15114518
005 20220402235141.0
006 m o d
007 cr cnu---unuuu
008 160919s2002 flua ob 001 0 eng d
035 $a(OCoLC)ocn958798241
035 $a(NNC)15114518
040 $aCRCPR$beng$erda$cCRCPR$dOCLCO$dOCLCF$dOCLCQ$dCRCPR$dYDX$dN$T$dEBLCP$dNLE$dUKMGB$dWYU$dOTZ$dTYFRS$dESU$dOCLCQ$dAU@$dUKAHL$dOCLCQ$dYDX$dOCLCO
015 $aGBB892437$2bnb
016 7 $a018866311$2Uk
019 $a1051332609$a1066438803
020 $a9781315273686$qelectronic book
020 $a1315273683$qelectronic book
020 $a9781482285833$qelectronic book
020 $a1482285835$qelectronic book
020 $z1584882549$qalkaline paper
020 $z9781584882541
024 7 $a10.1201/9781315273686$2doi
035 $a(OCoLC)958798241$z(OCoLC)1051332609$z(OCoLC)1066438803
037 $aTANDF_377041$bIngram Content Group
050 14 $aQA251$b.D385 2002
072 7 $aMAT$x002040$2bisacsh
072 7 $aPBCH$2bicssc
072 7 $aUMB$2bicssc
082 04 $a512$223
049 $aZCUA
100 1 $aDenecke, Klaus.
245 10 $aUniversal algebra and applications in theoretical computer science /$cKlaus Denecke, Shelly L. Wismath.
260 $aBoca Raton :$bChapman & Hall/CRC,$c©2002.
300 $a1 online resource (xii, 383 pages) :$billustrations
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
504 $aIncludes bibliographical references (pages 363-372) and index.
505 0 $a1. Basic concepts -- 2. Galois connections and closures -- 3. Homomorphisms and isomorphisms -- 4. Direct and subdirect products -- 5. Terms, trees, and polynomials -- 6. Identities and varieties -- 7. Term rewriting systems -- 8. Algebraic machines -- 9. Mal'cev-type conditions -- 10. Clones and completeness -- 11. Tame congruence theory -- 12. Term condition and commutator -- 13. Complete sublattices -- 14. G-clones and M-solid varieties -- 15. Hypersubstitutions and machines.
520 2 $a"Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them.Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators.The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications."--Provided by publisher.
650 0 $aAlgebra, Universal.
650 0 $aComputer science$xMathematics.
650 6 $aAlgèbre universelle.
650 6 $aInformatique$xMathématiques.
650 7 $aMATHEMATICS / Algebra / Intermediate$2bisacsh
650 7 $aAlgebra, Universal.$2fast$0(OCoLC)fst00804928
650 7 $aComputer science$xMathematics.$2fast$0(OCoLC)fst00872460
655 0 $aElectronic book.
655 4 $aElectronic books.
700 1 $aWismath, Shelly L.
776 08 $iPrint version:$z9781584882541$z1584882549
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15114518$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS