Black Friday Springer Shop Deals & Sales November 2025

In this monograph, the authors present a modern development of Euclidean geometry from independent axioms, using up-to-date language and providing detailed proofs. The axioms for incidence, betweenness, and plane separation are close to those of Hilbert. This is the only axiomatic treatment of Euclidean geometry that uses axioms not involving metric notions and that explores congruence and isometries by means of reflection mappings. The authors present thirteen axioms in sequence, proving as many theorems as possible at each stage and, in the process, building up subgeometries, most notably the Pasch and neutral geometries. Standard topics such as the congruence theorems for triangles, embedding the real numbers in a line, and coordinatization of the plane are included, as well as theorems of Pythagoras, Desargues, Pappas, Menelaus, and Ceva. The final chapter covers consistency and independence of axioms, as well as independence of definition properties. There are over 300 exercises; solutions to many of these, including all that are needed for this development, are available online at the homepage for the book at www.springer.com. Supplementary material is available online covering construction of complex numbers, arc length, the circular functions, angle measure, and the polygonal form of the Jordan Curve theorem. Euclidean Geometry and Its Subgeometries is intended for advanced students and mature mathematicians, but the proofs are thoroughly worked out to make it accessible to undergraduate students as well. It can be regarded as a completion, updating, and expansion of Hilbert's work, filling a gap in the existing literature.

This monograph considers several well-known mathematical theorems and asks the question, “Why prove it again?” while examining alternative proofs. It explores the different rationales mathematicians may have for pursuing and presenting new proofs of previously established results, as well as how they judge whether two proofs of a given result are different. While a number of books have examined alternative proofs of individual theorems, this is the first that presents comparative case studies of other methods for a variety of different theorems. The author begins by laying out the criteria for distinguishing among proofs and enumerates reasons why new proofs have, for so long, played a prominent role in mathematical practice. He then outlines various purposes that alternative proofs may serve. Each chapter that follows provides a detailed case study of alternative proofs for particular theorems, including the Pythagorean Theorem, the Fundamental Theorem of Arithmetic, Desargues’ Theorem, the Prime Number Theorem, and the proof of the irreducibility of cyclotomic polynomials. Why Prove It Again? will appeal to a broad range of readers, including historians and philosophers of mathematics, students, and practicing mathematicians.  Additionally, teachers will find it to be a useful source of alternative methods of presenting material to their students.

This book provides an extensive set of tools for applying fuzzy mathematics and graph theory to real-life problems. Balancing the basics and latest developments in fuzzy graph theory, this book starts with existing fundamental theories such as connectivity, isomorphism, products of fuzzy graphs, and different types of paths and arcs in fuzzy graphs to focus on advanced concepts such as planarity in fuzzy graphs, fuzzy competition graphs, fuzzy threshold graphs, fuzzy tolerance graphs, fuzzy trees, coloring in fuzzy graphs, bipolar fuzzy graphs, intuitionistic fuzzy graphs, m-polar fuzzy graphs, applications of fuzzy graphs, and more. Each chapter includes a number of key representative applications of the discussed concept. An authoritative, self-contained, and inspiring read on the theory and modern applications of fuzzy graphs, this book is of value to advanced undergraduate and graduate students of mathematics, engineering, and computer science, as well as researchers interestedin new developments in fuzzy logic and applied mathematics.

In this two-volume compilation of articles, leading researchers reevaluate the success of Hilbert's axiomatic method, which not only laid the foundations for our understanding of modern mathematics, but also found applications in physics, computer science and elsewhere. The title takes its name from David Hilbert's seminal talk Axiomatisches Denken, given at a meeting of the Swiss Mathematical Society in Zurich in 1917. This marked the beginning of Hilbert's return to his foundational studies, which ultimately resulted in the establishment of proof theory as a new branch in the emerging field of mathematical logic. Hilbert also used the opportunity to bring Paul Bernays back to Göttingen as his main collaborator in foundational studies in the years to come. The contributions are addressed to mathematical and philosophical logicians, but also to philosophers of science as well as physicists and computer scientists with an interest in foundations. Chapter 8 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

The book is the extended and revised version of the 1st edition and is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self-containing introduction to the stochastic processes of the later studied queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part. The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). Thenext chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems. An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences. Reviews of first edition: "The organization of the book is such that queueing models are viewed as special cases of more general stochastic processes, such as birth-death or semi-Markov processes. … this book is a valuable addition to the queuing literature and provides instructors with a viable alternative for a textbook to be used in a one- or two-semester course on queueing models, at the upper undergraduate or beginning graduate levels." Charles Knessl, SIAM Review, Vol. 56 (1), March, 2014

Diabetes is an autoimmune, inflammatory disease affecting many different organ systems and exhibiting both primary and secondary defects. Because diabetes affects a wide range of cellular systems, a multidisciplinary effort has been mounted over the past several decades using a wide range of investigative techniques and methodologies in order to identify molecular mechanisms responsible for cellular dysfunction. Because primary defects at various levels of sub-cellular signaling, intracellular calcium handling, protein expression and energy regulation are often a primary consequence of diabetes. This volume is a compilation of new multidisciplinary research that will broaden our current understanding of diabetes and cardiovascular disease as well as provide the basis for the development of novel therapeutic interventions.