In 'Higher Topos Theory', Jacob Lurie presents the foundations of this theory using the language of weak Kan complexes introduced by Boardman and Vogt, and shows how existing theorems in algebraic topology can be reformulated and generalized in the theory's new language.

This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.

Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.

A classic treatment of game theory from the acclaimed Annals of Mathematics Studies series Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century. To mark the continued success of the series, all books are available in paperback and as ebooks.

Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention.The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all Threshold Graphs and Related Topics provides a valuable source of information for all those working in this field.

This collection of new and original papers on mathematical aspects of nonlinear dispersive equations includes both expository and technical papers that reflect a number of recent advances in the field. The expository papers describe the state of the art and research directions. The technical papers concentrate on a specific problem and the related analysis and are addressed to active researchers. The book deals with many topics that have been the focus of intensive research and, in several cases, significant progress in recent years, including hyperbolic conservation laws, Schrödinger operators, nonlinear Schrödinger and wave equations, and the Euler and Navier-Stokes equations.

The description for this book, The Two-Valued Iterative Systems of Mathematical Logic. (AM-5), Volume 5, will be forthcoming.