The aim of this book is to present mathematical logic to students who are interested in what this field is but have no intention of specializing in it. The point of view is to treat logic on an equal footing to any other topic in the mathematical curriculum. The book starts with a presentation of naive set theory, the theory of sets that mathematicians use on a daily basis. Each subsequent chapter presents one of the main areas of mathematical logic: first order logic and formal proofs, model theory, recursion theory, Godel's incompleteness theorem, and, finally, the axiomatic set theory. Each chapter includes several interesting highlights-outside of logic when possible-either in the main text, or as exercises or appendices. Exercises are an essential component of the book, and a good number of them are designed to provide an opening to additional topics of interest.

Lively prose and imaginative exercises draw the reader into this unique introductory real analysis textbook. Motivating the fundamental ideas and theorems that underpin real analysis with historical remarks and well-chosen quotes, the author shares his enthusiasm for the subject throughout. A student reading this book is invited not only to acquire proficiency in the fundamentals of analysis, but to develop an appreciation for abstraction and the language of its expression. In studying this book, students will encounter: the interconnections between set theory and mathematical statements and proofs; the fundamental axioms of the natural, integer, and real numbers; rigorous -N and - definitions; convergence and properties of an infinite series, product, or continued fraction; series, product, and continued fraction formulae for the various elementary functions and constants. Instructors will appreciate this engaging perspective, showcasing the beauty of these fundamental results.

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic.

This book introduces the theory of graded consequence (GCT) and its mathematical formulation. It also compares the notion of graded consequence with other notions of consequence in fuzzy logics, and discusses possible applications of the theory in approximate reasoning and decision-support systems. One of the main points where this book emphasizes on is that GCT maintains the distinction between the three different levels of languages of a logic, namely object language, metalanguage and metametalanguage, and thus avoids the problem of violation of the principle of use and mention; it also shows, gathering evidences from existing fuzzy logics, that the problem of category mistake may arise as a result of not maintaining distinction between levels.

Using data from one season of NBA games, Basketball Data Science: With Applications in R is the perfect book for anyone interested in learning and applying data analytics in basketball. Whether assessing the spatial performance of an NBA player's shots or doing an analysis of the impact of high pressure game situations on the probability of scoring, this book discusses a variety of case studies and hands-on examples using a custom R package. The codes are supplied so readers can reproduce the analyses themselves or create their own. Assuming a basic statistical knowledge, Basketball Data Science with R is suitable for students, technicians, coaches, data analysts and applied researchers. Features: * One of the first books to provide statistical and data mining methods for the growing field of analytics in basketball. * Presents tools for modelling graphs and figures to visualize the data. * Includes real world case studies and examples, such as estimations of scoring probability using the Golden State Warriors as a test case. * Provides the source code and data so readers can do their own analyses on NBA teams and players.

Through its engaging and unusual problems, this book demonstrates methods of reasoning necessary for learning number theory. Every technique is followed by problems (as well as detailed hints and solutions) that apply theorems immediately, so readers can solve a variety of abstract problems in a systematic, creative manner. New solutions often require the ingenious use of earlier mathematical concepts - not the memorization of formulas and facts. Questions also often permit experimental numeric validation or visual interpretation to encourage the combined use of deductive and intuitive thinking. The first chapter starts with simple topics like even and odd numbers, divisibility, and prime numbers and helps the reader to solve quite complex, Olympiad-type problems right away. It also covers properties of the perfect, amicable, and figurate numbers and introduces congruence. The next chapter begins with the Euclidean algorithm, explores the representations of integer numbers in different bases, and examines continued fractions, quadratic irrationalities, and the Lagrange Theorem. The last section of Chapter Two is an exploration of different methods of proofs. The third chapter is dedicated to solving Diophantine linear and nonlinear equations and includes different methods of solving Fermat's (Pell's) equations. It also covers Fermat's factorization techniques and methods of solving challenging problems involving exponent and factorials. Chapter Four reviews the Pythagorean triple and quadruple and emphasizes their connection with geometry, trigonometry, algebraic geometry, and stereographic projection. A special case of Waring's problem as a representation of a number by the sum of the squares or cubes of other numbers is covered, as well as quadratic residuals, Legendre and Jacobi symbols, and interesting word problems related to the properties of numbers. Appendices provide a historic overview of number theory and its main developments from the ancient cultures in Greece, Babylon, and Egypt to the modern day. Drawing from cases collected by an accomplished female mathematician, Methods in Solving Number Theory Problems is designed as a self-study guide or supplementary textbook for a one-semester course in introductory number theory. It can also be used to prepare for mathematical Olympiads. Elementary algebra, arithmetic and some calculus knowledge are the only prerequisites. Number theory gives precise proofs and theorems of an irreproachable rigor and sharpens analytical thinking, which makes this book perfect for anyone looking to build their mathematical confidence.

A mathematical journey through the most fascinating problems of extremes and how to solve them What is the best way to photograph a speeding bullet? How can lost hikers find their way out of a forest? Why does light move through glass in the least amount of time possible? When Least Is Best combines the mathematical history of extrema with contemporary examples to answer these intriguing questions and more. Paul Nahin shows how life often works at the extremes-with values becoming as small (or as large) as possible-and he considers how mathematicians over the centuries, including Descartes, Fermat, and Kepler, have grappled with these problems of minima and maxima. Throughout, Nahin examines entertaining conundrums, such as how to build the shortest bridge possible between two towns, how to vary speed during a race, and how to make the perfect basketball shot. Moving from medieval writings and modern calculus to the field of optimization, the engaging and witty explorations of When Least Is Best will delight math enthusiasts everywhere.

This textbook presents the second edition of Manin's celebrated 1988 Montreal lectures, which influenced a new generation of researchers in algebra to take up the study of Hopf algebras and quantum groups. In this expanded write-up of those lectures, Manin systematically develops an approach to quantum groups as symmetry objects in noncommutative geometry in contrast to the more deformation-oriented approach due to Faddeev, Drinfeld, and others. This new edition contains an extra chapter by Theo Raedschelders and Michel Van den Bergh, surveying recent work that focuses on the representation theory of a number of bi- and Hopf algebras that were first introduced in Manin's lectures, and have since gained a lot of attention. Emphasis is placed on the Tannaka-Krein formalism, which further strengthens Manin's approach to symmetry and moduli-objects in noncommutative geometry.

This monograph provides a modern introduction to the theory of quantales. First coined by C.J. Mulvey in 1986, quantales have since developed into a significant topic at the crossroads of algebra and logic, of notable interest to theoretical computer science. This book recasts the subject within the powerful framework of categorical algebra, showcasing its versatility through applications to C*- and MV-algebras, fuzzy sets and automata. With exercises and historical remarks at the end of each chapter, this self-contained book provides readers with a valuable source of references and hints for future research. This book will appeal to researchers across mathematics and computer science with an interest in category theory, lattice theory, and many-valued logic.

Floating-point arithmetic is the most widely used way of implementing real-number arithmetic on modern computers. However, making such an arithmetic reliable and portable, yet fast, is a very difficult task. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. The handbook is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research.

This visionary and engaging book provides a mathematical perspective on the fundamental ideas of numbers, space, life, evolution, the brain and the mind. The author suggests how a development of mathematical concepts in the spirit of category theory may lead to unravelling the mystery of the human mind and the design of universal learning algorithms. The book is divided into two parts, the first of which describes the ideas of great mathematicians and scientists, those who saw sparks of light in the dark sea of unknown. The second part, Memorandum Ergo, reflects on how mathematics can contribute to the understanding of the mystery of thought. It argues that the core of the human mind is a structurally elaborated object that needs a creation of a broad mathematical context for its understanding. Readers will discover the main properties of the expected mathematical objects within this context, called ERGO-SYSTEMS, and readers will see how these "systems" may serve as prototypes for design of universal learning computer programs. This is a work of great, poetical insight and is richly illustrated. It is a highly attractive read for all those who welcome a mathematical and scientific way of thinking about the world.

Writing with clear knowledge and affection for the subject, the author introduces and explores infinite sets, infinite cardinals, and ordinals, thus challenging the readers' intuitive beliefs about infinity. Requiring little mathematical training and a healthy curiosity, the book presents a user-friendly approach to ideas involving the infinite. Readers will discover the main ideas of infinite cardinals and ordinal numbers without experiencing in-depth mathematical rigor. Classic arguments and illustrative examples are provided throughout the book and are accompanied by a gradual progression of sophisticated notions designed to stun your intuitive view of the world. Infinity, we are told, is as large as things get. This is not entirely true. This book does not refer to "infinities, " but rather to "cardinals." This is to emphasize the point that what you thought you knew about infinity is probably incorrect or imprecise. Since the reader is assumed to be educated in mathematics, but not necessarily mathematically trained, an attempt has been made to convince the reader of the truth of a matter without resorting to the type of rigor found in professional journals. Therefore, the author has accompanied the proofs with illustrative examples. The examples are often a part of a larger proof. Important facts are included and their proofs have been excluded if the author has determined that the proof is beyond the scope of the discussion. For example, it is assumed and not proven within the book that a collection of cardinals is larger than any set or mathematical object. The topics covered within the book cannot be found within any other one book on infinity, and the work succeeds in being the only book on infinite cardinals for the high school educated person. Topical coverage includes: logic and sets; functions; counting infinite sets; infinite cardinals; well ordered sets; inductions and numbers; prime numbers; and logic and meta-mathematics.

Combining stories of great writers and philosophers with quotations and riddles, this text for first courses in mathematical logic examines problems related to proofs, propositional logic and first-order logic, undecidability, and other topics.

Keeping students involved and actively learning is challenging. Instructors in computer science are aware of the cognitive value of modelling puzzles and often use logical puzzles as an efficient pedagogical instrument to engage students and develop problem-solving skills. This unique book is a comprehensive resource that offers teachers and students fun activities to teach and learn logic. It provides new, complete, and running formalisation in Propositional and First Order Logic for over 130 logical puzzles, including Sudoku-like puzzles, zebra-like puzzles, island of truth, lady and tigers, grid puzzles, strange numbers, or self-reference puzzles. Solving puzzles with theorem provers can be an effective cognitive incentive to motivate students to learn logic. They will find a ready-to-use format which illustrates how to model each puzzle, provides running implementations, and explains each solution. This concise and easy-to-follow textbook is a much-needed support tool for students willing to explore beyond the introductory level of learning logic and lecturers looking for examples to heighten student engagement in their computer science courses.

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

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.

The goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.

This LNCS volume is part of FoLLI book serie and contains the papers presented at the 6th International Workshop on Logic, Rationality and Interaction/ (LORI-VI), held in September 2017 in Sapporo, Japan. The focus of the workshop is on following topics: Agency, Argumentation and Agreement, Belief Revision and Belief Merging, Belief Representation, Cooperation, Decision making and Planning, Natural Language, Philosophy and Philosophical Logic, and Strategic Reasoning.

The present book is an introduction to the philosophy of mathematics. It asks philosophical questions concerning fundamental concepts, constructions and methods - this is done from the standpoint of mathematical research and teaching. It looks for answers both in mathematics and in the philosophy of mathematics from their beginnings till today. The reference point of the considerations is the introducing of the reals in the 19th century that marked an epochal turn in the foundations of mathematics. In the book problems connected with the concept of a number, with the infinity, the continuum and the infinitely small, with the applicability of mathematics as well as with sets, logic, provability and truth and with the axiomatic approach to mathematics are considered. In Chapter 6 the meaning of infinitesimals to mathematics and to the elements of analysis is presented. The authors of the present book are mathematicians. Their aim is to introduce mathematicians and teachers of mathematics as well as students into the philosophy of mathematics. The book is suitable also for professional philosophers as well as for students of philosophy, just because it approaches philosophy from the side of mathematics. The knowledge of mathematics needed to understand the text is elementary. Reports on historical conceptions. Thinking about today's mathematical doing and thinking. Recent developments. Based on the third, revised German edition. For mathematicians - students, teachers, researchers and lecturers - and readersinterested in mathematics and philosophy. Contents On the way to the reals On the history of the philosophy of mathematics On fundamental questions of the philosophy of mathematics Sets and set theories Axiomatic approach and logic Thinking and calculating infinitesimally - First nonstandard steps Retrospection

Decision Theory An Introduction to Dynamic Programming and Sequential Decisions John Bather University of Sussex, UK Mathematical induction, and its use in solving optimization problems, is a topic of great interest with many applications. It enables us to study multistage decision problems by proceeding backwards in time, using a method called dynamic programming. All the techniques needed to solve the various problems are explained, and the author's fluent style will leave the reader with an avid interest in the subject.
* Tailored to the needs of students of optimization and decision theory
* Written in a lucid style with numerous examples and applications
* Coverage of deterministic models: maximizing utilities, directed networks, shortest paths, critical path analysis, scheduling and convexity
* Coverage of stochastic models: stochastic dynamic programming, optimal stopping problems and other special topics
* Coverage of advanced topics: Markov decision processes, minimizing expected costs, policy improvements and problems with unknown statistical parameters
* Contains exercises at the end of each chapter, with hints in an appendix
Aimed primarily at students of mathematics and statistics, the lucid text will also appeal to engineering and science students and those working in the areas of optimization and operations research.

Providing a timely description of the present state of the art of moduli spaces of curves and their geometry, this volume is written in a way which will make it extremely useful both for young people who want to approach this important field, and also for established researchers, who will find references, problems, original expositions, new viewpoints, etc. The book collects the lecture notes of a number of leading algebraic geometers and in particular specialists in the field of moduli spaces of curves and their geometry. This is an important subject in algebraic geometry and complex analysis which has seen spectacular developments in recent decades, with important applications to other parts of mathematics such as birational geometry and enumerative geometry, and to other sciences, including physics. The themes treated are classical but with a constant look to modern developments (see Cascini, Debarre, Farkas, and Sernesi's contributions), and include very new material, such as Bridgeland stability (see Macri's lecture notes) and tropical geometry (see Chan's lecture notes).

This book gives a detailed treatment of functional interpretations of arithmetic, analysis, and set theory. The subject goes back to Goedel's Dialectica interpretation of Heyting arithmetic which replaces nested quantification by higher type operations and thus reduces the consistency problem for arithmetic to the problem of computability of primitive recursive functionals of finite types. Regular functional interpretations, in particular the Dialectica interpretation and its generalization to finite types, the Diller-Nahm interpretation, are studied on Heyting as well as Peano arithmetic in finite types and extended to functional interpretations of constructive as well as classical systems of analysis and set theory. Kreisel's modified realization and Troelstra's hybrids of it are presented as interpretations of Heyting arithmetic and extended to constructive set theory, both in finite types. They serve as background for the construction of hybrids of the Diller-Nahm interpretation of Heyting arithmetic and constructive set theory, again in finite types. All these functional interpretations yield relative consistency results and closure under relevant rules of the theories in question as well as axiomatic characterizations of the functional translations.