This is an introduction to, and survey of, the constructive approaches to pure mathematics. The authors emphasise the viewpoint of Errett Bishop's school, but intuitionism. Russian constructivism and recursive analysis are also treated, with comparisons between the various approaches included where appropriate. Constructive mathematics is now enjoying a revival, with interest from not only logicans but also category theorists, recursive function theorists and theoretical computer scientists. This account for non-specialists in these and other disciplines.

This textbook presents the basics of philosophy that are necessary for the student and researcher in science in order to better understand scientific work. The approach is not historical but formative: tools for semantical analysis, ontology of science, epistemology, and scientific ethics are presented in a formal and direct way. The book has two parts: one with the general theory and a second part with application to some problems such as the interpretation of quantum mechanics, the nature of mathematics, and the ontology of spacetime. The book addresses questions such as "What is meaning?", "What is truth?", "What are truth criteria in science?", "What is a theory?", "What is a model?" "What is a datum?", "What is information?", "What does it mean to understand something?", "What is space?", "What is time?", "How are these concepts articulated in science?" "What are values?" "What are the limits of science?", and many more. The philosophical views presented are "scientific" in the sense that they are informed by current science, they are relevant for scientific research, and the method adopted uses the hypothetical-deductive approach that is characteristic of science. The results and conclusions, as any scientific conclusion, are open to revision in the light of future advances. Hence, this philosophical approach opposes to dogmatic philosophy. Supported by end-of-chapter summaries and a list of special symbols used, the material will be of interest for students and researchers in both science and philosophy. The second part will appeal to physicists and mathematicians.

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz's work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science.

The range of contributions includes material on the extension of natural deduction with higher-order rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism (itself a by-product of the work on natural deduction), via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction.
"

The surreal numbers form a system which includes both the ordinary real numbers and the ordinals. Since their introduction by J. H. Conway, the theory of surreal numbers has seen a rapid development revealing many natural and exciting properties. These notes provide a formal introduction to the theory in a clear and lucid style. The the author is able to lead the reader through to some of the problems in the field. The topics covered include exponentiation and generalized e-numbers.

Data structures and tools from computational geometry help to solve problems in computer graphics; these methods have been widely adopted by the computer graphics community yielding elegant and efficient algorithms. This book focuses on algorithms and data structures that have proven to be versatile, efficient, fundamental, and easy to implement. The book familiarizes students, as well as practitioners in the field of computer graphics, with a wide range of data structures. The authors describe each data structure in detail, highlight fundamental properties, and present algorithms based on the data structure. A number of recent representative and useful algorithms from computer graphics are described in detail, illuminating the utilization of the data structure in a creative way.

Together with its compagnion volume this book presents a practical introduction to computing spline functions, the fundamental tools for fitting curves and surfaces in computer-aided design (CAD) and computer graphics.

These volumes present a practical introduction to computing spline functions, the fundamental tools for fitting curves and surfaces in computer-aided deisgn (CAD) and computer graphics.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing.  This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

Regression Analysis and Its Application: A Data-Oriented Approach answers the need for researchers and students who would like a better understanding of classical regression analysis. Useful either as a textbook or as a reference source, this book bridges the gap between the purely theoretical coverage of regression analysis and its practical application. The book presents regression analysis in the general context of data analysis. Using a teach-by-example format, it contains ten major data sets along with several smaller ones to illustrate the common characteristics of regression data and properties of statistics that are employed in regression analysis. The book covers model misspecification, residual analysis, multicollinearity, and biased regression estimators. It also focuses on data collection, model assumptions, and the interpretation of parameter estimates. Complete with an extensive bibliography, Regression Analysis and Its Application is suitable for statisticians, graduate and upper-level undergraduate students, and research scientists in biometry, business, ecology, economics, education, engineering, mathematics, physical sciences, psychology, and sociology. In addition, data collection agencies in the government and private sector will benefit from the book.

Wearing Gauss's Jersey focuses on "Gauss problems," problems that can be very tedious and time consuming when tackled in a traditional, straightforward way but if approached in a more insightful fashion, can yield the solution much more easily and elegantly. The book shows how mathematical problem solving can be fun and how students can improve their mathematical insight, regardless of their initial level of knowledge. Illustrating the underlying unity in mathematics, it also explores how problems seemingly unrelated on the surface are actually extremely connected to each other. Each chapter starts with easy problems that demonstrate the simple insight/mathematical tools necessary to solve problems more efficiently. The text then uses these simple tools to solve more difficult problems, such as Olympiad-level problems, and develop more complex mathematical tools. The longest chapters investigate combinatorics as well as sequences and series, which are some of the most well-known Gauss problems. These topics would be very tedious to handle in a straightforward way but the book shows that there are easier ways of tackling them.

This textbook prepares graduate students for research in numerical analysis/computational mathematics by giving to them a mathematical framework embedded in functional analysis and focused on numerical analysis. This helps the student to move rapidly into a research program. The text covers basic results of functional analysis, approximation theory, Fourier analysis and wavelets, iteration methods for nonlinear equations, finite difference methods, Sobolev spaces and weak formulations of boundary value problems, finite element methods, elliptic variational inequalities and their numerical solution, numerical methods for solving integral equations of the second kind, and boundary integral equations for planar regions. The presentation of each topic is meant to be an introduction with certain degree of depth. Comprehensive references on a particular topic are listed at the end of each chapter for further reading and study.

Because of the relevance in solving real world problems, multivariable polynomials are playing an ever more important role in research and applications. In this third editon, a new chapter on this topic has been included and some major changes are made on two chapters from the previous edition. In addition, there are numerous minor changes throughout the entire text and new exercises are added.

Review of earlier edition:

..".the book is clearly written, quite pleasant to read, and contains a lot of important material; and the authors have done an excellent job at balancing theoretical developments, interesting examples and exercises, numerical experiments, and bibliographical references."

R. Glowinski, SIAM Review, 2003

Originally published in 1995, Large Deviations for Performance Analysis consists of two synergistic parts. The first half develops the theory of large deviations from the beginning, through recent results on the theory for processes with boundaries, keeping to a very narrow path: continuous-time, discrete-state processes. By developing only what is needed for the applications, the theory is kept to a manageable level, both in terms of length and in terms of difficulty. Within its scope, the treatment is detailed, comprehensive and self-contained. As the book shows, there are sufficiently many interesting applications of jump Markov processes to warrant a special treatment. The second half is a collection of applications developed at Bell Laboratories. The applications cover large areas of the theory of communication networks: circuit switched transmission, packet transmission, multiple access channels, and the M/M/1 queue. Aspects of parallel computation are covered as well including, basics of job allocation, rollback-based parallel simulation, assorted priority queueing models that might be used in performance models of various computer architectures, and asymptotic coupling of processors. These applications are thoroughly analysed using the tools developed in the first half of the book.

This volume gathers selected papers presented at the Fourth Asian Workshop on Philosophical Logic, held in Beijing in October 2018. The contributions cover a wide variety of topics in modal logic (epistemic logic, temporal logic and dynamic logic), proof theory, algebraic logic, game logics, and philosophical foundations of logic. They also reflect the interdisciplinary nature of logic - a subject that has been studied in fields as diverse as philosophy, linguistics, mathematics, computer science and artificial intelligence. More specifically. The book also presents the latest developments in logic both in Asia and beyond.

This accessible book helps readers to see the bigger picture of advanced mathematics. The book contains carefully selected, challenging problems in an easy-to-follow, step-by-step process. Neither prior preparation nor any mathematical sophistication is required. The authors guide the reader to "train their brain" to think and express themselves in a rigorous, mathematical way, and to extract facts, analyze the problem, and identify main challenges. A firm foundation in a diverse range of topics is presented. Moreover, the authors show how to draw appropriate, true conclusions. Computer support is used to better intuition into discussed problems. The book is designed for self-study. It can be used to bridge the gap between introductory calculus/linear algebra courses and more advanced courses offered at universities. It improves the ability to read, write, and think in a rigorous, mature mathematical fashion. The reader will develop a deeper understanding in preparation to succeed in more advanced course work. Features *The authors employ a six-step process: 1.SOURCE 2.PROBLEM 3.THEORY 4.SOLUTION 5.REMARK 6.EXERCISES *An Appendix introduces programming in Julia This book is also suitable for high school students that are interested in competing in math competitions or simply for people of all ages and backgrounds who want to expand their knowledge and to challenge themselves with interesting questions.

This volume was produced in conjunction with the Thematic Program in o-Minimal Structures and Real Analytic Geometry, held from January to June of 2009 at the Fields Institute. Five of the six contributions consist of notes from graduate courses associated with the program: Felipe Cano on a new proof of resolution of singularities for planar analytic vector fields; Chris Miller on o-minimality and Hardy fields; Jean-Philippe Rolin on the construction of o-minimal structures from quasianalytic classes; Fernando Sanz on non-oscillatory trajectories of vector fields; and Patrick Speissegger on pfaffian sets. The sixth contribution, by Antongiulio Fornasiero and Tamara Servi, is an adaptation to the nonstandard setting of A.J. Wilkie's construction of o-minimal structures from infinitely differentiable functions. Most of this material is either unavailable elsewhere or spread across many different sources such as research papers, conference proceedings and PhD theses. This book will be a useful tool for graduate students or researchers from related fields who want to learn about expansions of o-minimal structures by solutions, or images thereof, of definable systems of differential equations.

From the reviews: "This is a very interesting book containing material for a comprehensive study of the cyclid homological theory of algebras, cyclic sets and S1-spaces. Lie algebras and algebraic K-theory and an introduction to Connes'work and recent results on the Novikov conjecture. The book requires a knowledge of homological algebra and Lie algebra theory as well as basic technics coming from algebraic topology. The bibliographic comments at the end of each chapter offer good suggestions for further reading and research. The book can be strongly recommended to anybody interested in noncommutative geometry, contemporary algebraic topology and related topics." European Mathematical Society Newsletter

In this second edition the authors have added a chapter 13 on MacLane (co)homology.

In this volume, world-leading puzzle designers, puzzle collectors, mathematicians, and magicians continue the tradition of honoring Martin Gardner, who inspired them to enter mathematics, to enter magic, to bring magic into their mathematics, or to bring mathematics into their magic. This edited collection contains a variety of articles connected to puzzles, magic, and/or mathematics, including the history behind given puzzles, solitaire puzzles, two-person games, and mathematically interesting objects. Topics include tangrams, peg solitaire, sodoku, coin-weighing problems, anamorphoses, and more!

Origami5 continues in the excellent tradition of its four previous incarnations, documenting work presented at an extraordinary series of meetings that explored the connections between origami, mathematics, science, technology, education, and other academic fields. The fifth such meeting, 5OSME (July 13-17, 2010, Singapore Management University) followed the precedent previous meetings to explore the interdisciplinary connections between origami and the real world. This book begins with a section on origami history, art, and design. It is followed by sections on origami in education and origami science, engineering, and technology, and culminates with a section on origami mathematics the pairing that inspired the original meeting. Within this one volume, you will find a broad selection of historical information, artists descriptions of their processes, various perspectives and approaches to the use of origami in education, mathematical tools for origami design, applications of folding in engineering and technology, as well as original and cutting-edge research on the mathematical underpinnings of origami.

In the 21st century, digitalization is a global challenge of mankind. Even for the public, it is obvious that our world is increasingly dominated by powerful algorithms and big data. But, how computable is our world? Some people believe that successful problem solving in science, technology, and economies only depends on fast algorithms and data mining. Chances and risks are often not understood, because the foundations of algorithms and information systems are not studied rigorously. Actually, they are deeply rooted in logics, mathematics, computer science and philosophy.Therefore, this book studies the foundations of mathematics, computer science, and philosophy, in order to guarantee security and reliability of the knowledge by constructive proofs, proof mining and program extraction. We start with the basics of computability theory, proof theory, and information theory. In a second step, we introduce new concepts of information and computing systems, in order to overcome the gap between the digital world of logical programming and the analog world of real computing in mathematics and science. The book also considers consequences for digital and analog physics, computational neuroscience, financial mathematics, and the Internet of Things (IoT).

The series is devoted to the publication of monographs and high-level textbooks in mathematics, mathematical methods and their applications. Apart from covering important areas of current interest, a major aim is to make topics of an interdisciplinary nature accessible to the non-specialist. The works in this series are addressed to advanced students and researchers in mathematics and theoretical physics. In addition, it can serve as a guide for lectures and seminars on a graduate level. The series de Gruyter Studies in Mathematics was founded ca. 35 years ago by the late Professor Heinz Bauer and Professor Peter Gabriel with the aim to establish a series of monographs and textbooks of high standard, written by scholars with an international reputation presenting current fields of research in pure and applied mathematics. While the editorial board of the Studies has changed with the years, the aspirations of the Studies are unchanged. In times of rapid growth of mathematical knowledge carefully written monographs and textbooks written by experts are needed more than ever, not least to pave the way for the next generation of mathematicians. In this sense the editorial board and the publisher of the Studies are devoted to continue the Studies as a service to the mathematical community. Please submit any book proposals to Niels Jacob. Titles in planning include Flavia Smarazzo and Alberto Tesei, Measure Theory: Radon Measures, Young Measures, and Applications to Parabolic Problems (2019) Elena Cordero and Luigi Rodino, Time-Frequency Analysis of Operators (2019) Mark M. Meerschaert, Alla Sikorskii, and Mohsen Zayernouri, Stochastic and Computational Models for Fractional Calculus, second edition (2020) Mariusz Lemanczyk, Ergodic Theory: Spectral Theory, Joinings, and Their Applications (2020) Marco Abate, Holomorphic Dynamics on Hyperbolic Complex Manifolds (2021) Miroslava Antic, Joeri Van der Veken, and Luc Vrancken, Differential Geometry of Submanifolds: Submanifolds of Almost Complex Spaces and Almost Product Spaces (2021) Kai Liu, Ilpo Laine, and Lianzhong Yang, Complex Differential-Difference Equations (2021) Rajendra Vasant Gurjar, Kayo Masuda, and Masayoshi Miyanishi, Affine Space Fibrations (2022)

Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science. The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs. The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.

Compactly supported smooth piecewise polynomial functions provide an efficient tool for the approximation of curves and surfaces and other smooth functions of one and several arguments. Since they are locally polynomial, they are easy to evaluate. Since they are smooth, they can be used when smoothness is required, as in the numerical solution of partial differential equations (in the Finite Element method) or the modeling of smooth sur faces (in Computer Aided Geometric Design). Since they are compactly supported, their linear span has the needed flexibility to approximate at all, and the systems to be solved in the construction of approximations are 'banded'. The construction of compactly supported smooth piecewise polynomials becomes ever more difficult as the dimension, s, of their domain G ~ IRs, i. e. , the number of arguments, increases. In the univariate case, there is only one kind of cell in any useful partition, namely, an interval, and its boundary consists of two separated points, across which polynomial pieces would have to be matched as one constructs a smooth piecewise polynomial function. This can be done easily, with the only limitation that the num ber of smoothness conditions across such a breakpoint should not exceed the polynomial degree (since that would force the two joining polynomial pieces to coincide). In particular, on any partition, there are (nontrivial) compactly supported piecewise polynomials of degree ~ k and in C(k-l), of which the univariate B-spline is the most useful example.

Many people start the day with physical exercise but few seem to be so concerned with exercising the most human of organs-the brain. This book provides you with entertaining and challenging mental exercises for every week of the year. Whether you are a high school student eager to sharpen your brain, or someone older who would like to retain your mental agility, you will find your brain getting sharper and more agile as you solve the puzzles in this book. Read a few puzzles every week, think about them, solve them, and you will see the results. And on the way to a sharper mind, you will enjoy every step.

Project Origami: Activities for Exploring Mathematics, Second Edition presents a flexible, discovery-based approach to learning origami-math topics. It helps readers see how origami intersects a variety of mathematical topics, from the more obvious realm of geometry to the fields of algebra, number theory, and combinatorics. With over 100 new pages, this updated and expanded edition now includes 30 activities and offers better solutions and teaching tips for all activities. The book contains detailed plans for 30 hands-on, scalable origami activities. Each activity lists courses in which the activity might fit, includes handouts for classroom use, and provides notes for instructors on solutions, how the handouts can be used, and other pedagogical suggestions. The handouts are also available on the book's CRC Press web page. Reflecting feedback from teachers and students who have used the book, this classroom-tested text provides an easy and entertaining way for teachers to incorporate origami into a range of college and advanced high school math courses. Visit the author's website for more information.

Easily Create Origami with Curved Folds and Surfaces Origami making shapes only through folding reveals a fascinating area of geometry woven with a variety of representations. The world of origami has progressed dramatically since the advent of computer programs to perform the necessary computations for origami design. 3D Origami Art presents the design methods underlying 3D creations derived from computation. It includes numerous photos and design drawings called crease patterns, which are available for download on the author's website. Through the book's clear figures and descriptions, readers can easily create geometric 3D structures out of a set of lines and curves drawn on a 2D plane. The author uses various shapes of sheets such as rectangles and regular polygons, instead of square paper, to create the origami. Many of the origami creations have a 3D structure composed of curved surfaces, and some of them have complicated forms. However, the background theory underlying all the creations is very simple. The author shows how different origami forms are designed from a common theory.