Muutke küpsiste eelistusi

E-raamat: Universal Algebra: Fundamentals and Selected Topics

(Iowa State University, Ames, USA)
  • Formaat - EPUB+DRM
  • Hind: 72,80 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Starting with the most basic notions, Universal Algebra: Fundamentals and Selected Topics introduces all the key elements needed to read and understand current research in this field. Based on the authors two-semester course, the text prepares students for research work by providing a solid grounding in the fundamental constructions and concepts of universal algebra and by introducing a variety of recent research topics.

The first part of the book focuses on core components, including subalgebras, congruences, lattices, direct and subdirect products, isomorphism theorems, a clone of operations, terms, free algebras, Birkhoffs theorem, and standard Maltsev conditions. The second part covers topics that demonstrate the power and breadth of the subject. The author discusses the consequences of Jónssons lemma, finitely and nonfinitely based algebras, definable principal congruences, and the work of Foster and Pixley on primal and quasiprimal algebras. He also includes a proof of Murskis theorem on primal algebras and presents McKenzies characterization of directly representable varieties, which clearly shows the power of the universal algebraic toolbox. The last chapter covers the rudiments of tame congruence theory.

Throughout the text, a series of examples illustrates concepts as they are introduced and helps students understand how universal algebra sheds light on topics they have already studied, such as Abelian groups and commutative rings. Suitable for newcomers to the field, the book also includes carefully selected exercises that reinforce the concepts and push students to a deeper understanding of the theorems and techniques.

Arvustused

as far as I am concerned, the book under review, by Clifford Bergman, is most welcome: we need more of this sort of thing, both for potential universal algebraists and for people like me: fellow travelers to some degree, or mathematicians who both use and thoroughly adore algebra and its structural qualities, and find themselves growing more appreciative of this architectural elegance as they evolve in their work and studies. it is clearly written and pleasant to read the author provides motivation as well as examples and exercises galore. At first glance it looks to me like the exercises are well-structured and should do the job of bringing the student or reader along at a decent pace from ignorance to both an appreciation for the subject and some facility with it. Its definitely an area worth pursuing for a graduate student with the right disposition. Michael Berg, MAA Reviews, December 2011





excellently written and is highly recommended to all who are interested in universal algebra. Mathematical Reviews

Preface ix
I Fundamentals of Universal Algebra
1(134)
1 Algebras
3(18)
1.1 Operations
3(1)
1.2 Examples
4(3)
1.3 More about subs, homs and prods
7(3)
1.4 Generating subalgebras
10(3)
1.5 Congruences and quotient algebras
13(8)
2 Lattices
21(26)
2.1 Ordered sets
21(3)
2.2 Distributive and modular lattices
24(6)
2.3 Complete lattices
30(4)
2.4 Closure operators and algebraic lattices
34(4)
2.5 Galois connections
38(2)
2.6 Ideals in lattices
40(7)
3 The Nuts and Bolts of Universal Algebra
47(32)
3.1 The isomorphism theorems
47(5)
3.2 Direct products
52(3)
3.3 Subdirect products
55(5)
3.4 Case studies
60(11)
3.5 Varieties and other classes of algebras
71(8)
4 Clones, Terms, and Equational Classes
79(56)
4.1 Clones
79(9)
4.2 Invariant relations
88(6)
4.3 Terms and free algebras
94(10)
4.4 Identities and Birkhoff's theorem
104(7)
4.5 The lattice of subvarieties
111(6)
4.6 Equational theories and fully invariant congruences
117(4)
4.7 Maltsev conditions
121(9)
4.8 Interpretations
130(5)
II Selected Topics
135(156)
5 Congruence Distributive Varieties
139(30)
5.1 Ultrafilters and ultraproducts
139(6)
5.2 Jonsson's lemma
145(4)
5.3 Model theory
149(7)
5.4 Finitely based and nonfinitely based algebras
156(4)
5.5 Definable principal (sub)congruences
160(9)
6 Arithmetical Varieties
169(20)
6.1 Large clones
169(9)
6.2 How rare are primal algebras?
178(11)
7 Maltsev Varieties
189(56)
7.1 Directly representable varieties
189(8)
7.2 The centralizer congruence
197(8)
7.3 Abelian varieties
205(11)
7.4 Commutators
216(8)
7.5 Directly representable varieties revisited
224(9)
7.6 Minimal varieties
233(6)
7.7 Functionally complete algebras
239(6)
8 Finite Algebras and Locally Finite Varieties
245(46)
8.1 Minimal algebras
245(7)
8.2 Localization and induced algebras
252(11)
8.3 Centralizers again!
263(11)
8.4 Applications
274(17)
Bibliography 291(8)
Index of Notation 299(4)
Index 303
Clifford Bergman is the Janson Professor of Mathematics at Iowa State University, where he has taught since 1982. He teaches both undergraduate and graduate courses in algebra and cryptography. Dr. Bergmans research centers on classical questions in universal algebra, computational complexity, cryptology, and steganography.