Andere Kunden interessierten sich auch für
![Approximation Theorems in Commutative Algebra]( "Approximation Theorems in Commutative Algebra")
Approximation Theorems in Commutative Algebra77,99 €![Constructive Commutative Algebra]( "Constructive Commutative Algebra")
Constructive Commutative Algebra41,99 €![Prime Spectra in Non-Commutative Algebra]( "Prime Spectra in Non-Commutative Algebra")
Prime Spectra in Non-Commutative Algebra20,99 €![Commutative Algebra]( "Commutative Algebra")
Commutative Algebra74,99 €![Generic Local Structure of the Morphisms in Commutative Algebra]( "Generic Local Structure of the Morphisms in Commutative Algebra")
Generic Local Structure of the Morphisms in Commutative Algebra20,99 €![Commutative Algebra]( "Commutative Algebra")
Commutative Algebra74,99 €![Conference on Commutative Algebra]( "Conference on Commutative Algebra")
Conference on Commutative Algebra35,99 €
Translated from the popular French edition, this book offers a detailed introduction to various basic concepts, methods, principles, and results of commutative algebra. It takes a constructive viewpoint in commutative algebra and studies algorithmic approaches alongside several abstract classical theories. Indeed, it revisits these traditional topics with a new and simplifying manner, making the subject both accessible and innovative.
The algorithmic aspects of such naturally abstract topics as Galois theory, Dedekind rings, Prüfer rings, finitely generated projective modules, dimension theory of commutative rings, and others in the current treatise, are all analysed in the spirit of the great developers of constructive algebra in the nineteenth century.
This updated and revised edition contains over 350 well-arranged exercises, together with their helpful hints for solution. A basic knowledge of linear algebra, group theory, elementary number theory as well asthe fundamentals of ring and module theory is required. Commutative Algebra: Constructive Methods will be useful for graduate students, and also researchers, instructors and theoretical computer scientists.
The algorithmic aspects of such naturally abstract topics as Galois theory, Dedekind rings, Prüfer rings, finitely generated projective modules, dimension theory of commutative rings, and others in the current treatise, are all analysed in the spirit of the great developers of constructive algebra in the nineteenth century.
This updated and revised edition contains over 350 well-arranged exercises, together with their helpful hints for solution. A basic knowledge of linear algebra, group theory, elementary number theory as well asthe fundamentals of ring and module theory is required. Commutative Algebra: Constructive Methods will be useful for graduate students, and also researchers, instructors and theoretical computer scientists.
"The book treats many of the standard topics from commutative algebra and projective modules in great detail, all using constructive methods. ... The exhaustive bibliography draws both from classical and constructive mathematics. ... This will be a great addition to the bookshelves of the community of constructive mathematicians." (N. Mohan Kumar, Mathematical Reviews, October, 2016)
"The book has over 350 well-arranged exercises, together with helpful hints for solution. ... Many methods, like lazy evaluation and dynamic evaluation, are discussed in great detail. ... There is a detailed flow chart on chapter dependencies and the order in which chapters should be read. ... The book will be useful for graduate students, as well as researchers, instructors, and theoretical computer scientists." (Naga Narayanaswamy, Computing Reviews, February, 2016)
"The book under review is the faithful English translation of the original French edition published in 2011 under the same title. ... No doubt, the English edition ... will certainly increase both its international significance and its wider popularity among graduate students, researchers, instructors, and interested scientists in general." (Werner Kleinert, zbMATH 1327.13001, 2016)
"The book has over 350 well-arranged exercises, together with helpful hints for solution. ... Many methods, like lazy evaluation and dynamic evaluation, are discussed in great detail. ... There is a detailed flow chart on chapter dependencies and the order in which chapters should be read. ... The book will be useful for graduate students, as well as researchers, instructors, and theoretical computer scientists." (Naga Narayanaswamy, Computing Reviews, February, 2016)
"The book under review is the faithful English translation of the original French edition published in 2011 under the same title. ... No doubt, the English edition ... will certainly increase both its international significance and its wider popularity among graduate students, researchers, instructors, and interested scientists in general." (Werner Kleinert, zbMATH 1327.13001, 2016)