This book contains a compendium of 25 papers published since the 1970s dealing with pi and associated topics of mathematics and computer science. The collection begins with a Foreword by Bruce Berndt. Each contribution is preceded by a brief summary of its content as well as a short key word list indicating how the content relates to others in the collection. The volume includes articles on actual computations of pi, articles on mathematical questions related to pi (e.g., "Is pi normal?"), articles presenting new and often amazing techniques for computing digits of pi (e.g., the "BBP" algorithm for pi, which permits one to compute an arbitrary binary digit of pi without needing to compute any of the digits that came before), papers presenting important fundamental mathematical results relating to pi, and papers presenting new, high-tech techniques for analyzing pi (i.e., new graphical techniques that permit one to visually see if pi and other numbers are "normal"). This volume is a companion to Pi: A Source Book whose third edition released in 2004. The present collection begins with 2 papers from 1976, published by Eugene Salamin and Richard Brent, which describe "quadratically convergent" algorithms for pi and other basic mathematical functions, derived from some mathematical work of Gauss. Bailey and Borwein hold that these two papers constitute the beginning of the modern era of computational mathematics. This time period (1970s) also corresponds with the introduction of high-performance computer systems (supercomputers), which since that time have increased relentlessly in power, by approximately a factor of 100,000,000, advancing roughly at the same rate as Moore's Law of semiconductor technology. This book may be of interest to a wide range of mathematical readers; some articles cover more advanced research questions suitable for active researchers in the field, but several are highly accessible to undergraduate mathematics students.

Covering a period up to 1971, this selection of Saunders Mac Lane's most distinguished papers takes the reader on a journey through the most important milestones of the mathematical world in the twentieth century. Mac Lane was an extraordinary mathematician and a dedicated teacher who cared earnestly about the values of science and education. His life spanned nearly a century of mathematical progress. In his earlier years, he participated in the exciting developments in Goettingen. He studied under David Hilbert, Hermann Weyl, and Paul Bernays. Later, he contributed to the more abstract and general mathematical viewpoints which emerged in the twentieth century. Perhaps the most outstanding accomplishment during his long and extraordinary career was the development of the concept and theory of categories, together with Samuel Eilenberg, which has broad applications in different areas, in particular in topology and the foundations of mathematics.

This volume contains nine survey articles based on the invited lectures given at the 25th British Combinatorial Conference, held at the University of Warwick in July 2015. This biennial conference is a well-established international event, with speakers from around the world. The volume provides an up-to-date overview of current research in several areas of combinatorics, including graph theory, Ramsey theory, combinatorial geometry and curves over finite fields. Each article is clearly written and assumes little prior knowledge on the part of the reader. The authors are some of the world's foremost researchers in their fields, and here they summarise existing results and give a unique preview of cutting-edge developments. The book provides a valuable survey of the present state of knowledge in combinatorics, and will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

Filling a gap in the literature, this book takes the reader to the frontiers of equivariant topology, the study of objects with specified symmetries. The discussion is motivated by reference to a list of instructive "toy" examples and calculations in what is a relatively unexplored field. The authors also provide a reading path for the first-time reader less interested in working through sophisticated machinery but still desiring a rigorous understanding of the main concepts. The subject's classical counterparts, ordinary homology and cohomology, dating back to the work of Henri Poincare in topology, are calculational and theoretical tools which are important in many parts of mathematics and theoretical physics, particularly in the study of manifolds. Similarly powerful tools have been lacking, however, in the context of equivariant topology. Aimed at advanced graduate students and researchers in algebraic topology and related fields, the book assumes knowledge of basic algebraic topology and group actions.

Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.

This is a collection of new investigations and discoveries on the theory of opposition (square, hexagon, octagon, polyhedra of opposition) by the best specialists from all over the world. The papers range from historical considerations to new mathematical developments of the theory of opposition including applications to theology, theory of argumentation and metalogic.

This volume is the first systematic and thorough attempt to investigate the relation and the possible applications of mereology to contemporary science. It gathers contributions from leading scholars in the field and covers a wide range of scientific theories and practices such as physics, mathematics, chemistry, biology, computer science and engineering. Throughout the volume, a variety of foundational issues are investigated both from the formal and the empirical point of view. The first section looks at the topic as it applies to physics. The section addresses questions of persistence and composition within quantum and relativistic physics and concludes by scrutinizing the possibility to capture continuity of motion as described by our best physical theories within gunky space times. The second part tackles mathematics and shows how to provide a foundation for point-free geometry of space switching to fuzzy-logic. The relation between mereological sums and set-theoretic suprema is investigated and issues about different mereological perspectives such as classical and natural Mereology are thoroughly discussed. The third section in the volume looks at natural science. Several questions from biology, medicine and chemistry are investigated. From the perspective of biology, there is an attempt to provide axioms for inferring statements about part hood between two biological entities from statements about their spatial relation. From the perspective of chemistry, it is argued that classical mereological frameworks are not adequate to capture the practices of chemistry in that they consider neither temporal nor modal parameters. The final part introduces computer science and engineering. A new formal mereological framework in which an indeterminate relation of part hood is taken as a primitive notion is constructed and then applied to a wide variety of disciplines from robotics to knowledge engineering. A formal framework for discrete mereotopology and its applications is developed and finally, the importance of mereology for the relatively new science of domain engineering is also discussed.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science.   The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation.   Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method�, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the (limited but important) role of logic in philosophy.

This text focuses on a variety of topics in mathematics in common usage in graduate engineering programs including vector calculus, linear and nonlinear ordinary differential equations, approximation methods, vector spaces, linear algebra, integral equations and dynamical systems. The book is designed for engineering graduate students who wonder how much of their basic mathematics will be of use in practice. Following development of the underlying analysis, the book takes students through a large number of examples that have been worked in detail. Students can choose to go through each step or to skip ahead if they so desire. After seeing all the intermediate steps, they will be in a better position to know what is expected of them when solving assignments, examination problems, and when on the job. Chapters conclude with exercises for the student that reinforce the chapter content and help connect the subject matter to a variety of engineering problems. Students have grown up with computer-based tools including numerical calculations and computer graphics; the worked-out examples as well as the end-of-chapter exercises often use computers for numerical and symbolic computations and for graphical display of the results.

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012.

The topic of this book sits at the interface of the theory of higher categories (in the guise of ( ,1)-categories) and the theory of properads. Properads are devices more general than operads and enable one to encode bialgebraic, rather than just (co)algebraic, structures. The text extends both the Joyal-Lurie approach to higher categories and the Cisinski-Moerdijk-Weiss approach to higher operads, and provides a foundation for a broad study of the homotopy theory of properads. This work also serves as a complete guide to the generalised graphs which are pervasive in the study of operads and properads. A preliminary list of potential applications and extensions comprises the final chapter. Infinity Properads and Infinity Wheeled Properads is written for mathematicians in the fields of topology, algebra, category theory, and related areas. It is written roughly at the second year graduate level, and assumes a basic knowledge of category theory.

First published in 1908 as the second edition of a 1900 original, this book explains the content of the fifth and sixth books of Euclid's Elements, which are primarily concerned with ratio and magnitudes. Hill furnishes the text with copious diagrams to illustrate key points of Euclidian reasoning. This book will be of value to anyone with an interest in the history of education.

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod-Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass-Guivarc'h theorem about growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata. With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified audience. No prerequisites beyond standard courses in linear and abstract algebra are required. The broad appeal of this textbook extends to a variety of student levels: from advanced high-schoolers to undergraduates and graduate students, including those in search of a Ph.D. thesis who will benefit from the "Further reading and open problems" sections at the end of Chapters 2 -5. The book can also be used for self-study, engaging those beyond t he classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.

In this new text, Steven Givant—the author of several acclaimed books, including works co-authored with Paul Halmos and Alfred Tarski—develops three theories of duality for Boolean algebras with operators. Givant addresses the two most recognized dualities (one algebraic and the other topological) and introduces a third duality, best understood as a hybrid of the first two. This text will be of interest to graduate students and researchers in the fields of mathematics, computer science, logic, and philosophy who are interested in exploring special or general classes of Boolean algebras with operators. Readers should be familiar with the basic arithmetic and theory of Boolean algebras, as well as the fundamentals of point-set topology.

Wondrous One Sheet Origami is a how-to book full of beautiful origami designs covering a wide range of folding levels from simple to high intermediate, with more emphasis on the latter. The book is meant for audiences 12 years of age and above, and children folding at higher than age level. Most of the designs are flat and suitable for mounting on cards or framing as gifts. Features * Richly illustrated full-color book with clear, crisp diagrams following international standard, and an abundance of photographs of finished models * Select designs hand-picked by the author based on social media responses * Most of the designs incorporate color-change, a technique showing both sides of paper for enhanced beauty

This book is based on two premises: one cannot understand philosophy of mathematics without understanding mathematics and one cannot understand mathematics without doing mathematics. It draws readers into philosophy of mathematics by having them do mathematics. It offers 298 exercises, covering philosophically important material, presented in a philosophically informed way. The exercises give readers opportunities to recreate some mathematics that will illuminate important readings in philosophy of mathematics. Topics include primitive recursive arithmetic, Peano arithmetic, Gödel's theorems, interpretability, the hierarchy of sets, Frege arithmetic and intuitionist sentential logic. The book is intended for readers who understand basic properties of the natural and real numbers and have some background in formal logic.

1 Introduction.- 2 Pritchard-Salamon systems.- 3 Linear quadratic control and frequency domain inequalities.- 4 H?-control with state-feedback.- 5 H?-control with measurement-feedback.- 6 Examples and conclusions.- A Stability theory.- B Differentiability and some convergence results.- C The invariant zeros condition.

Praise for William Dunhams Journey Through Genius The Great Theorems of Mathematics "Dunham deftly guides the reader through the verbal and logical intricacies of major mathematical questions and proofs, conveying a splendid sense of how the greatest mathematicians from ancient to modern times presented their arguments." Ivars Peterson Author, The Mathematical Tourist Mathematics and Physics Editor, Science News

"It is mathematics presented as a series of works of art; a fascinating lingering over individual examples of ingenuity and insight. It is mathematics by lightning flash." Isaac Asimov

"It is a captivating collection of essays of major mathematical achievements brought to life by the personal and historical anecdotes which the author has skillfully woven into the text. This is a book which should find its place on the bookshelf of anyone interested in science and the scientists who create it." R. L. Graham, AT&T Bell Laboratories

"Come on a time-machine tour through 2,300 years in which Dunham drops in on some of the greatest mathematicians in history. Almost as if we chat over tea and crumpets, we get to know them and their ideasideas that ring with eternity and that offer glimpses into the often veiled beauty of mathematics and logic. And all the while we marvel, hoping that the tour will not stop." Jearl Walker, Physics Department, Cleveland State University Author of The Flying Circus of Physics

This volume commemorates the life, work and foundational views of Kurt Goedel (1906-78), most famous for his hallmark works on the completeness of first-order logic, the incompleteness of number theory, and the consistency - with the other widely accepted axioms of set theory - of the axiom of choice and of the generalized continuum hypothesis. It explores current research, advances and ideas for future directions not only in the foundations of mathematics and logic, but also in the fields of computer science, artificial intelligence, physics, cosmology, philosophy, theology and the history of science. The discussion is supplemented by personal reflections from several scholars who knew Goedel personally, providing some interesting insights into his life. By putting his ideas and life's work into the context of current thinking and perceptions, this book will extend the impact of Goedel's fundamental work in mathematics, logic, philosophy and other disciplines for future generations of researchers.

The notion of Fuzziness stands as one of the really new concepts that have recently enriched the world of Science. Science grows not only through technical and formal advances on one side and useful applications on the other side, but also as consequence of the introduction and assimilation of new concepts in its corpus. These, in turn, produce new developments and applications. And this is what Fuzziness, one of the few new concepts arisen in the XX Century, has been doing so far. This book aims at paying homage to Professor Lotfi A. Zadeh, the "father of fuzzy logic" and also at giving credit to his exceptional work and personality. In a way, this is reflected in the variety of contributions collected in the book. In some of them the authors chose to speak of personal meetings with Lotfi; in others, they discussed how certain papers of Zadeh were able to open for them a new research horizon. Some contributions documented results obtained from the author/s after taking inspiration from a particular idea of Zadeh, thus implicitly acknowledging him. Finally, there are contributions of several "third generation fuzzysists or softies" who were firstly led into the world of Fuzziness by a disciple of Lotfi Zadeh, who, following his example, took care of opening for them a new road in science. Rudolf Seising is Adjoint Researcher at the European Centre for Soft Computing in Mieres, Asturias (Spain). Enric Trillas and Claudio Moraga are Emeritus Researchers at the European Centre for Soft Computing, Mieres, Asturias (Spain). Settimo Termini is Professor of Theoretical Computer Science at the University of Palermo, Italy and Affiliated Researcher at the European Centre for Soft Computing, Mieres, Asturias (Spain)

This book introduces a theory of higher matrix factorizations for regular sequences and uses it to describe the minimal free resolutions of high syzygy modules over complete intersections. Such resolutions have attracted attention ever since the elegant construction of the minimal free resolution of the residue field by Tate in 1957. The theory extends the theory of matrix factorizations of a non-zero divisor, initiated by Eisenbud in 1980, which yields a description of the eventual structure of minimal free resolutions over a hypersurface ring. Matrix factorizations have had many other uses in a wide range of mathematical fields, from singularity theory to mathematical physics.

This new volume on logic follows a recognizable format that deals in turn with the topics of mathematical logic, moving from concepts, via definitions and inferences, to theories and axioms. However, this fresh work offers a key innovation in its 'pyramidal' graph system for the logical formalization of all these items. The author has developed this new methodology on the basis of original research, traditional logical instruments such as Porphyrian trees, and modern concepts of classification, in which pyramids are the central organizing concept. The pyramidal schema enables both the content of concepts and the relations between the concept positions in the pyramid to be read off from the graph. Logical connectors are analyzed in terms of the direction in which they connect within the pyramid. Additionally, the author shows that logical connectors are of fundamentally different types: only one sort generates propositions with truth values, while the other yields conceptual expressions or complex concepts. On this basis, strong arguments are developed against adopting the non-discriminating connector definitions implicit in Wittgensteinian truth-value tables. Special consideration is given to mathematical connectors so as to illuminate the formation of concepts in the natural sciences. To show what the pyramidal method can contribute to science, a pyramid of the number concepts prevalent in mathematics is constructed. The book also counters the logical dogma of 'false' contradictory propositions and sheds new light on the logical characteristics of probable propositions, as well as on syllogistic and other inferences.

Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do algebra The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader

? DoesP=NP. In just ?ve symbols Dick Karp -in 1972-captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it's fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog- Godel Lost Letter andP=NP-which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this.