Rather than presenting a reverse list of words in endless sequence and strictly alphabetical order, this Reverse English Dictionary considers the structure and formation of words, grouping them together in sections and subdivisions. This way of looking at words from behind and comparing similar word endings reveals new and unaccustomed aspects of the structure of words and their formation, illustrating the enormous variety of the English language.

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability theory, the subject offers beautiful results as well as significant foundational insights. This text provides a modern treatment of reverse mathematics that combines computability theoretic reductions and proofs in formal arithmetic to measure the complexity of theorems and problems from all areas of mathematics. It includes detailed introductions to techniques from computable mathematics, Weihrauch style analysis, and other parts of computability that have become integral to research in the field. Topics and features: Provides a complete introduction to reverse mathematics, including necessary background from computability theory, second order arithmetic, forcing, induction, and model construction Offers a comprehensive treatment of the reverse mathematics of combinatorics, including Ramsey's theorem, Hindman's theorem, and many other results Provides central results and methods from the past two decades, appearing in book form for the first time and including preservation techniques and applications of probabilistic arguments Includes a large number of exercises of varying levels of difficulty, supplementing each chapter The text will be accessible to students with a standard first year course in mathematical logic. It will also be a useful reference for researchers in reverse mathematics, computability theory, proof theory, and related areas. Damir D. Dzhafarov is an Associate Professor of Mathematics at the University of Connecticut, CT, USA. Carl Mummert is a Professor of Computer and Information Technology at Marshall University, WV, USA.

Economic, marketing, and legislative considerations are increasingly leading companies to take back and recover their products after use. From a logistics perspective, these initiatives give rise to new goods flows from the user back to the producer. The management of these goods flows opposite to the traditional supply chain flows is addressed in the recently emerged field of Reverse Logistics. This monograph considers quantitative models that support decision making in Reverse Logistics. To this end, several recent case studies are reviewed. Moreover, first hand insight from a study on used electronic equipment is reported on. On this basis, logistics issues arising in the management of "reverse" goods flows are identified. Moreover, differences between Reverse Logistics and more traditional logistics contexts are highlighted. Finally, attention is paid to capturing the characteristics of Reverse Logistics in appropriate quantitative models.