In 1900, at the International Congress of Mathematicians, Hilbert presented a list of problems he considered important to be solved in the new century. The tenth problem on the list, known, of course, as Hilbert’s Tenth Problem, asked for an algorithm to determine whether a polynomial equation with integer coefficients, in several variables, has integer solutions. Many mathematicians (Martin Davis, Hilary Putnam, and Julia Robinson) worked on this problem and an answer was found in 1970 by Matiyasevich; Hilbert’s Tenth Problem is unsolvable: no such algorithm exists.

In the last thirty-five years, much work has been done to extend this result. The present book presents such extensions, to integrally closed subrings of global fields.

While this is a book containing deep results in Algebraic Number Theory, accessible in its entirety only to experienced readers, it contains some chapters that can be used in an introductory (undergraduate) course and can be used in graduate courses as well.

The book contains two Appendices: one on Recursion (computability) Theory and the other on Number Theory. These cover much of the background the reader needs. The first three chapters should be quite accessible to undergraduate students.

Overall, this is a very good book addressing a lot of readers — from undergraduate students, to graduate students and research mathematicians — and presenting important results, with a very large list of references for further reading.

Mihaela Poplicher is associate professor of mathematics at the University of Cincinnati. Her research interests include functional analysis, harmonic analysis, and complex analysis. She is also interested in the teaching of mathematics. Her email address is Mihaela.Poplicher@uc.edu.