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.

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)

We see numbers on automobile license plates, addresses, weather reports, and, of course, on our smartphones. Yet we look at these numbers for their role as descriptors, not as an entity in and unto themselves. Each number has its own history of meaning, usage, and connotation in the larger world. The Secret Lives of Numbers takes readers on a journey through integers, considering their numerological assignments as well as their significance beyond mathematics and in the realm of popular culture. Of course we all know that the number 13 carries a certain value of unluckiness with it. The phobia of the number is called Triskaidekaphobia; Franklin Delano Roosevelt was known to invite and disinvite guests to parties to avoid having 13 people in attendance; high-rise buildings often skip the 13th floor out of superstition. There are many explanations as to how the number 13 received this negative honor, but from a mathematical point of view, the number 13 is also the smallest prime number that when its digits are reversed is also a prime number. It is honored with a place among the Fibonacci numbers and integral Pythagorean triples, as well as many other interesting and lesser-known occurrences. In The Secret Lives of Numbers, popular mathematician Alfred S. Posamentier provides short and engaging mini-biographies of more than 100 numbers, starting with 1 and featuring some especially interesting numbers -like 6,174, a number with most unusual properties -to provide readers with a more comprehensive picture of the lives of numbers both mathematically and socially.

Logic and Philosophy of Mathematics in the Early Husserl focuses on the first ten years of Edmund Husserl's work, from the publication of his Philosophy of Arithmetic (1891) to that of his Logical Investigations (1900/01), and aims to precisely locate his early work in the fields of logic, philosophy of logic and philosophy of mathematics. Unlike most phenomenologists, the author refrains from reading Husserl's early work as a more or less immature sketch of claims consolidated only in his later phenomenology, and unlike the majority of historians of logic she emphasizes the systematic strength and the originality of Husserl's logico-mathematical work.

The book attempts to reconstruct the discussion between Husserl and those philosophers and mathematicians who contributed to new developments in logic, such as Leibniz, Bolzano, the logical algebraists (especially Boole and Schroder), Frege, and Hilbert and his school. It presents both a comprehensive critical examination of some of the major works produced by Husserl and his antagonists in the last decade of the 19th century and a formal reconstruction of many texts from Husserl's Nachlass that have not yet been the object of systematical scrutiny.

This volume will be of particular interest to researchers working in the history, and in the philosophy, of logic and mathematics, and more generally, to analytical philosophers and phenomenologists with a background in standard logic."

The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the Siberian school of algebra and logic and some other researchers (in particular, Nerode and his colleagues). The main themes are the existence of recursive models and applications to fields, algebras, and ordered sets (Ershov), the existence of decidable prime models (Goncharov, Harrington), the existence of decidable saturated models (Morley), the existence of decidable homogeneous models (Goncharov and Peretyat'kin), properties of the Ehrenfeucht theories (Millar, Ash, and Reed), the theory of algorithmic dimension and conditions of autostability (Goncharov, Ash, Shore, Khusainov, Ventsov, and others), and the theory of computable classes of models with various properties. Future perspectives of the theory of constructive models are also discussed. Most of the results in the book are presented in monograph form for the first time. The theory of constructive models serves as a basis for recursive mathematics. It is also useful in computer science, in particular, in the study of programming languages, higher level languages of specification, abstract data types, and problems of synthesis and verification of programs. Therefore, the book will be usefulfor not only specialists in mathematical logic and the theory of algorithms but also for scientists interested in the mathematical fundamentals of computer science. The authors are eminent specialists in mathematical logic. They have established fundamental results on elementary theories, model theory, the theory of algorithms, field theory, group theory, applied logic, computable numberings, the theory of constructive models, and the theoretical computer science.

Anyone involved in the philosophy of science is naturally drawn into the study of the foundations of probability. Different interpretations of probability, based on competing philosophical ideas, lead to different statistical techniques, and frequently to mutually contradictory consequences.

This unique book presents a new interpretation of probability, rooted in the traditional interpretation that was current in the 17th and 18th centuries. Mathematical models are constructed based on this interpretation, and statistical inference and decision theory are applied, including some examples in artificial intelligence, solving the main foundational problems. Nonstandard analysis is extensively developed for the construction of the models and in some of the proofs. Many nonstandard theorems are proved, some of them new, in particular, a representation theorem that asserts that any stochastic process can be approximated by a process defined over a space with equiprobable outcomes.

This undergraduate textbook is intended primarily for a transition course into higher mathematics, although it is written with a broader audience in mind. The heart and soul of this book is problem solving, where each problem is carefully chosen to clarify a concept, demonstrate a technique, or to enthuse. The exercises require relatively extensive arguments, creative approaches, or both, thus providing motivation for the reader. With a unified approach to a diverse collection of topics, this text points out connections, similarities, and differences among subjects whenever possible. This book shows students that mathematics is a vibrant and dynamic human enterprise by including historical perspectives and notes on the giants of mathematics, by mentioning current activity in the mathematical community, and by discussing many famous and less well-known questions that remain open for future mathematicians.

Ideally, this text should be used for a two semester course, where the first course has no prerequisites and the second is a more challenging course for math majors; yet, the flexible structure of the book allows it to be used in a variety of settings, including as a source of various independent-study and research projects.
"

Das Buch behandelt Matrizengleichungen und -funktionen sowie die computergerechte Darstellung und Losung der Bewegungsgleichungen von Schwingungssystemen mit endlich vielen Freiheitsgraden und fuhrt in die Grundlagen der Naherungsmethoden von Rayleigh und Ritz ein. Das Eigenwertproblem wird, anders als sonst ublich, von einem allgemeinen Standpunkt aus betrachtet. Dadurch gewinnt die Darstellung an Verstandlichkeit und an Anwendungsbreite. Das Buch ist sowohl fur Studierende als auch fur Physiker und Ingenieure in der Praxis geschrieben.

One criterion for classifying books is whether they are written for a single pur pose or for multiple purposes. This book belongs to the category of multipurpose books, but one of its roles is predominant-it is primarily a textbook. As such, it can be used for a variety ofcourses at the first-year graduate or upper-division undergraduate level. A common characteristic of these courses is that they cover fundamental systems concepts, major categories of systems problems, and some selected methods for dealing with these problems at a rather general level. A unique feature of the book is that the concepts, problems, and methods are introduced in the context of an architectural formulation of an expert system referred to as the general systems problem solver or aSPS-whose aim is to provide users ofall kinds with computer-based systems knowledge and methodo logy. Theasps architecture, which is developed throughout the book, facilitates a framework that is conducive to acoherent, comprehensive, and pragmaticcoverage ofsystems fundamentals-concepts, problems, and methods. A course that covers systems fundamentals is now offered not only in sys tems science, information science, or systems engineering programs, but in many programs in other disciplines as well. Although the level ofcoverage for systems science or engineering students is surely different from that used for students in other disciplines, this book is designed to serve both of these needs."

This is a continuation of Vol. 7 of Trends in Logic. It wil cover the wealth of recent developments of Lukasiewicz Logic and their algebras (Chang MV-algebras), with particular reference to (de Finetti) coherent evaluation of continuously valued events, (Renyi) conditionals for such events, related algorithms.

This volume, which presents the cumulation of the authors' research in the field, deals with Lidstone, Hermite, Abel-Gontscharoff, Birkhoff, piecewise Hermite and Lidstone, spline and Lidstone-spline interpolating problems. Explicit representations of the interpolating polynomials and associated error functions are given, as well as explicit error inequalities in various norms. Numerical illustrations are provided of the importance and sharpness of the various results obtained. Also demonstrated are the significance of these results in the theory of ordinary differential equations such as maximum principles, boundary value problems, oscillation theory, disconjugacy and disfocality. The book should be useful for mathematicians, numerical analysts, computer scientists and engineers.

This volume tackles Goedel's two-stage project of first using Husserl's transcendental phenomenology to reconstruct and develop Leibniz' monadology, and then founding classical mathematics on the metaphysics thus obtained. The author analyses the historical and systematic aspects of that project, and then evaluates it, with an emphasis on the second stage. The book is organised around Goedel's use of Leibniz, Husserl and Brouwer. Far from considering past philosophers irrelevant to actual systematic concerns, Goedel embraced the use of historical authors to frame his own philosophical perspective. The philosophies of Leibniz and Husserl define his project, while Brouwer's intuitionism is its principal foil: the close affinities between phenomenology and intuitionism set the bar for Goedel's attempt to go far beyond intuitionism. The four central essays are `Monads and sets', `On the philosophical development of Kurt Goedel', `Goedel and intuitionism', and `Construction and constitution in mathematics'. The first analyses and criticises Goedel's attempt to justify, by an argument from analogy with the monadology, the reflection principle in set theory. It also provides further support for Goedel's idea that the monadology needs to be reconstructed phenomenologically, by showing that the unsupplemented monadology is not able to found mathematics directly. The second studies Goedel's reading of Husserl, its relation to Leibniz' monadology, and its influence on his publishe d writings. The third discusses how on various occasions Brouwer's intuitionism actually inspired Goedel's work, in particular the Dialectica Interpretation. The fourth addresses the question whether classical mathematics admits of the phenomenological foundation that Goedel envisaged, and concludes that it does not. The remaining essays provide further context. The essays collected here were written and published over the last decade. Notes have been added to record further thoughts, changes of mind, connections between the essays, and updates of references.

Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a hat problem.

This book deals with the question of how successfully one can predict the value of an arbitrary function at one or more points of its domain based on some knowledge of its values at other points. Topics range from hat problems that are accessible to everyone willing to think hard, to some advanced topics in set theory and infinitary combinatorics. For example, there is a method of predicting the value "f"("a") of a function f mapping the reals to the reals, based only on knowledge of "f"'s values on the open interval ("a" 1, "a"), and for every such function the prediction is incorrect only on a countable set that is nowhere dense.

The monograph progresses from topics requiring fewer prerequisites to those requiring more, with most of the text being accessible to any graduate student in mathematics. The broad range of readership includes researchers, postdocs, and graduate students in the fields of set theory, mathematical logic, and combinatorics. The hope is that this book will bring together mathematicians from different areas to think about set theory via a very broad array of coordinated inference problems. "

This book presents eleven peer-reviewed papers from the 3rd International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE2017) held in Tbilisi, Georgia in December 2017. Written by researchers from the region (Georgia, Russia, Turkey) and from Western countries (France, Germany, Italy, Luxemburg, Spain, USA), it discusses key aspects of mathematics and informatics, and their applications in natural sciences and engineering. Featuring theoretical, practical and numerical contributions, the book appeals to scientists from various disciplines interested in applications of mathematics and informatics in natural sciences and engineering.

Problems books are popular with instructors and students alike, as well as among general readers. The key to this book is the many alternative solutions to single problems. Mathematics educators, secondary mathematics teachers, and university instructors will find the book interesting and useful.

Starting with a simple formulation accessible to all mathematicians, this second edition is designed to provide a thorough introduction to nonstandard analysis. Nonstandard analysis is now a well-developed, powerful instrument for solving open problems in almost all disciplines of mathematics; it is often used as a 'secret weapon' by those who know the technique. This book illuminates the subject with some of the most striking applications in analysis, topology, functional analysis, probability and stochastic analysis, as well as applications in economics and combinatorial number theory. The first chapter is designed to facilitate the beginner in learning this technique by starting with calculus and basic real analysis. The second chapter provides the reader with the most important tools of nonstandard analysis: the transfer principle, Keisler's internal definition principle, the spill-over principle, and saturation. The remaining chapters of the book study different fields for applications; each begins with a gentle introduction before then exploring solutions to open problems. All chapters within this second edition have been reworked and updated, with several completely new chapters on compactifications and number theory. Nonstandard Analysis for the Working Mathematician will be accessible to both experts and non-experts, and will ultimately provide many new and helpful insights into the enterprise of mathematics.

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.

Intuitionistic type theory can be described, somewhat boldly, as a partial fulfillment of the dream of a universal language for science. This book expounds several aspects of intuitionistic type theory, such as the notion of set, reference vs. computation, assumption, and substitution. Moreover, the book includes philosophically relevant sections on the principle of compositionality, lingua characteristica, epistemology, propositional logic, intuitionism, and the law of excluded middle. Ample historical references are given throughout the book.

The book is an authoritative and up-to-date introduction to the field of analysis and potential theory dealing with the distribution zeros of classical systems of polynomials such as orthogonal polynomials, Chebyshev, Fekete and Bieberbach polynomials, best or near-best approximating polynomials on compact sets and on the real line. The main feature of the book is the combination of potential theory with conformal invariants, such as module of a family of curves and harmonic measure, to derive discrepancy estimates for signed measures if bounds for their logarithmic potentials or energy integrals are known a priori.

Can you really keep your eye on the ball? How is massive data collection changing sports? Sports science courses are growing in popularity. The author's course at Roanoke College is a mix of physics, physiology, mathematics, and statistics. Many students of both genders find it exciting to think about sports. Sports problems are easy to create and state, even for students who do not live sports 24/7. Sports are part of their culture and knowledge base, and the opportunity to be an expert on some area of sports is invigorating. This should be the primary reason for the growth of mathematics of sports courses: the topic provides intrinsic motivation for students to do their best work. From the Author: "The topics covered in Sports Science and Sports Analytics courses vary widely. To use a golfing analogy, writing a book like this is like hitting a drive at a driving range; there are many directions you can go without going out of bounds. At the driving range, I pick out a small target to focus on, and that is what I have done here. I have chosen a sample of topics I find very interesting. Ideally, users of this book will have enough to choose from to suit whichever version of a sports course is being run." "The book is very appealing to teach from as well as to learn from. Students seem to have a growing interest in ways to apply traditionally different areas to solve problems. This, coupled with an enthusiasm for sports, makes Dr. Minton's book appealing to me."-Kevin Hutson, Furman University

This book collects 13 papers that explore Wittgenstein's philosophy throughout the different stages of his career. The author writes from the viewpoint of critical rationalism. The tone of his analysis is friendly and appreciative yet critical. Of these papers, seven are on the background to the philosophy of Wittgenstein. Five papers examine different aspects of it: one on the philosophy of young Wittgenstein, one on his transitional period, and the final three on the philosophy of mature Wittgenstein, chiefly his Philosophical Investigations. The last of these papers, which serves as the concluding chapter, concerns the analytical school of philosophy that grew chiefly under its influence. Wittgenstein's posthumous Philosophical Investigations ignores formal languages while retaining the view of metaphysics as meaningless -- declaring that all languages are metaphysics-free. It was very popular in the middle of the twentieth century. Now it is passe. Wittgenstein had hoped to dissolve all philosophical disputes, yet he generated a new kind of dispute. His claim to have improved the philosophy of life is awkward just because he prevented philosophical discussion from the ability to achieve that: he cut the branch on which he was sitting. This, according to the author, is the most serious critique of Wittgenstein.

Proceedings of the NATO Advanced Study Institute, Calgary, Canada, August 26-September 2, 1978

The fundamental theorem of algebra states that any complex polynomial must have a complex root. This book examines three pairs of proofs of the theorem from three different areas of mathematics: abstract algebra, complex analysis and topology. The first proof in each pair is fairly straightforward and depends only on what could be considered elementary mathematics. However, each of these first proofs leads to more general results from which the fundamental theorem can be deduced as a direct consequence. These general results constitute the second proof in each pair. To arrive at each of the proofs, enough of the general theory of each relevant area is developed to understand the proof. In addition to the proofs and techniques themselves, many applications such as the insolvability of the quintic and the transcendence of e and pi are presented. Finally, a series of appendices give six additional proofs including a version of Gauss'original first proof. The book is intended for junior/senior level undergraduate mathematics students or first year graduate students, and would make an ideal "capstone" course in mathematics.