In this book, trigonometry is presented mainly through the solution of specific problems. The problems are meant to help the reader consolidate their knowledge of the subject. In addition, they serve to motivate and provide context for the concepts, definitions, and results as they are presented. In this way, it enables a more active mastery of the subject, directly linking the results of the theory with their applications. Some historical notes are also embedded in selected chapters.The problems in the book are selected from a variety of disciplines, such as physics, medicine, architecture, and so on. They include solving triangles, trigonometric equations, and their applications. Taken together, the problems cover the entirety of material contained in a standard trigonometry course which is studied in high school and college.We have also added some interesting, in our opinion, entertainment problems. To solve them, no special knowledge is required. While they are not directly related to the subject of the book, they reflect its spirit and contribute to a more lighthearted reading of the material.

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.

Steps forward in mathematics often reverberate in other scientific disciplines, and give rise to innovative conceptual developments or find surprising technological applications. This volume brings to the forefront some of the proponents of the mathematics of the twentieth century, who have put at our disposal new and powerful instruments for investigating the reality around us. The portraits present people who have impressive charisma and wide-ranging cultural interests, who are passionate about defending the importance of their own research, are sensitive to beauty, and attentive to the social and political problems of their times. What we have sought to document is mathematics' central position in the culture of our day. Space has been made not only for the great mathematicians but also for literary texts, including contributions by two apparent interlopers, Robert Musil and Raymond Queneau, for whom mathematical concepts represented a valuable tool for resolving the struggle between 'soul and precision.'

The book describes 4 main topics in current model theory and updates their most recent development and applications. The 4 topics are: 1) model theory of valued fields; 2) undecidability in arithmetic; 3) NIP theories; 4) model theory of real and complex exponentiation. The book addresses in particular young researchers in model theory, as well as more senior researchers in other branches of mathematics.

"These volumes collect almost all of the research and expository papers of J.-P. Serre published in mathematical journals through 1984, as well as some of his seminar reports, and a few items not previously published. .... Throughout his writings, Serre has liberally sprinkled open questions and conjectures. Most endnotes list subsequent progress made on these questions or improvements to the main results of the papers. Some make additional comments, and a few are corrections. These endnotes alone justify the publication of the collected works. Serre is one of the masters of mathematical exposition...." --James Milne, University of Michigan, in Math Reviews

This book explores the premise that a physical theory is an interpretation of the analytico-canonical formalism. Throughout the text, the investigation stresses that classical mechanics in its Lagrangian formulation is the formal backbone of theoretical physics. The authors start from a presentation of the analytico-canonical formalism for classical mechanics, and its applications in electromagnetism, Schroedinger's quantum mechanics, and field theories such as general relativity and gauge field theories, up to the Higgs mechanism. The analysis uses the main criterion used by physicists for a theory: to formulate a physical theory we write down a Lagrangian for it. A physical theory is a particular instance of the Lagrangian functional. So, there is already an unified physical theory. One only has to specify the corresponding Lagrangian (or Lagrangian density); the dynamical equations are the associated Euler-Lagrange equations. The theory of Suppes predicates as the main tool in the axiomatization and examples from the usual theories in physics. For applications, a whole plethora of results from logic that lead to interesting, and sometimes unexpected, consequences. This volume looks at where our physics happen and which mathematical universe we require for the description of our concrete physical events. It also explores if we use the constructive universe or if we need set-theoretically generic spacetimes.

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.

This volume is dedicated to Hiroakira Ono life's work on substructural logics. Chapters, written by well-established academics, cover topics related to universal algebra, algebraic logic and the Full Lambek calculus; the book includes a short biography about Hiroakira Ono. The book starts with detailed surveys on universal algebra, abstract algebraic logic, topological dualities, and connections to computer science. It further contains specialised contributions on connections to formal languages (recognizability in residuated lattices and connections to the finite embedding property), covering systems for modal substructural logics, results on the existence and disjunction properties and finally a study of conservativity of expansions. This book will be primarily of interest to researchers working in algebraic and non-classical logic.

This is an introduction to the mathematics involved in the intriguing field of cryptology, the science of writing and reading secret messages which are designed to be read only by their intended recipients. It is written at an elementary level, suitable for beginning undergraduates, with careful explanations of all the concepts used. The basic branches of mathematics required, including number theory, abstract algebra and probability, are used to show how to encipher and decipher messages, and why this works, giving a practical as well as theoretical basis to the subject. Challenging computer programming exercises are also included. The book is written in an engaging style which will appeal to all, and also includes historical background on some of the founders of the subject. It will be of interest both to students wishing to learn cryptology per se, and also to those searching for practical applications of seemingly abstract mathematics.

This work presents a purely classical first-order logical approach to the field of study in theoretical computer science sometimes referred to as the theory of programs, or programming theory. This field essentially attempts to provide a precise mathematical basis for the common activities involved in reasoning about computer programs and programming languages, and it also attempts to find practical applications in the areas of program specification, verification and programming language design. Many different approaches with different mathematical frameworks have been proposed as a basis for programming theory. They differ in the mathe matical machinery they use to define and investigate programs and program properties and they also differ in the concepts they deal with to understand the programming paradigm. Different approaches use different tools and viewpoints to characterize the data environment of programs. Most of the approaches are related to mathe matical logic and they provide their own logic. These logics, however, are very eclectic since they use special entities to reflect a special world of programs, and also, they are usually incomparable with each other. This Babel's mess irritated us and we decided to peel off the eclectic com ponents and try to answer all the questions by using classical first-order logic."

The analysis, processing, evolution, optimization and/or regulation, and control of shapes and images appear naturally in engineering (shape optimization, image processing, visual control), numerical analysis (interval analysis), physics (front propagation), biological morphogenesis, population dynamics (migrations), and dynamic economic theory. These problems are currently studied with tools forged out of differential geometry and functional analysis, thus requiring shapes and images to be smooth. However, shapes and images are basically sets, most often not smooth. J.-P. Aubin thus constructs another vision, where shapes and images are just any compact set. Hence their evolution -- which requires a kind of differential calculus -- must be studied in the metric space of compact subsets. Despite the loss of linearity, one can transfer most of the basic results of differential calculus and differential equations in vector spaces to mutational calculus and mutational equations in any mutational space, including naturally the space of nonempty compact subsets. "Mutational and Morphological Analysis" offers a structure that embraces and integrates the various approaches, including shape optimization and mathematical morphology. Scientists and graduate students will find here other powerful mathematical tools for studying problems dealing with shapes and images arising in so many fields.

The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns."

Real analytic sets in Euclidean space (Le. , sets defined locally at each point of Euclidean space by the vanishing of an analytic function) were first investigated in the 1950's by H. Cartan [Car], H. Whitney [WI-3], F. Bruhat [W-B] and others. Their approach was to derive information about real analytic sets from properties of their complexifications. After some basic geometrical and topological facts were established, however, the study of real analytic sets stagnated. This contrasted the rapid develop ment of complex analytic geometry which followed the groundbreaking work of the early 1950's. Certain pathologies in the real case contributed to this failure to progress. For example, the closure of -or the connected components of-a constructible set (Le. , a locally finite union of differ ences of real analytic sets) need not be constructible (e. g. , R - {O} and 3 2 2 { (x, y, z) E R : x = zy2, x + y2 -=I- O}, respectively). Responding to this in the 1960's, R. Thorn [Thl], S. Lojasiewicz [LI,2] and others undertook the study of a larger class of sets, the semianalytic sets, which are the sets defined locally at each point of Euclidean space by a finite number of ana lytic function equalities and inequalities. They established that semianalytic sets admit Whitney stratifications and triangulations, and using these tools they clarified the local topological structure of these sets. For example, they showed that the closure and the connected components of a semianalytic set are semianalytic.

Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.

The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references.

This modern introduction to the foundations of logic and mathematics not only takes theory into account, but also treats in some detail applications that have a substantial impact on everyday life (loans and mortgages, bar codes, public-key cryptography). A first college-level introduction to logic, proofs, sets, number theory, and graph theory, and an excellent self-study reference and resource for instructors.

Gaisi Takeuti was one of the most brilliant, genius, and influential logicians of the 20th century. He was a long-time professor and professor emeritus of mathematics at the University of Illinois at Urbana-Champaign, USA, before he passed away on May 10, 2017, at the age of 91. Takeuti was one of the founders of Proof Theory, a branch of mathematical logic that originated from Hilbert's program about the consistency of mathematics. Based on Gentzen's pioneering works of proof theory in the 1930s, he proposed a conjecture in 1953 concerning the essential nature of formal proofs of higher-order logic now known as Takeuti's fundamental conjecture and of which he gave a partial positive solution. His arguments on the conjecture and proof theory in general have had great influence on the later developments of mathematical logic, philosophy of mathematics, and applications of mathematical logic to theoretical computer science. Takeuti's work ranged over the whole spectrum of mathematical logic, including set theory, computability theory, Boolean valued analysis, fuzzy logic, bounded arithmetic, and theoretical computer science. He wrote many monographs and textbooks both in English and in Japanese, and his monumental monograph Proof Theory, published in 1975, has long been a standard reference of proof theory. He had a wide range of interests covering virtually all areas of mathematics and extending to physics. His publications include many Japanese books for students and general readers about mathematical logic, mathematics in general, and connections between mathematics and physics, as well as many essays for Japanese science magazines. This volume is a collection of papers based on the Symposium on Advances in Mathematical Logic 2018. The symposium was held September 18-20, 2018, at Kobe University, Japan, and was dedicated to the memory of Professor Gaisi Takeuti.

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

First published in 1931, this book is the second edition of a 1917 original. The text provides an account of the method of least squares, aiming to obtain the best interpretation of the results of experiment without consideration of the way in which these results are obtained. Elaborate descriptions of instruments and experimental methods are avoided, allowing for a concise and economical account that concentrates on key elements of the subject. This is a detailed and well-organized book that will be of value to anyone with an interest in least squares and the development of mathematics.

Benford's law states that the leading digits of many data sets are not uniformly distributed from one through nine, but rather exhibit a profound bias. This bias is evident in everything from electricity bills and street addresses to stock prices, population numbers, mortality rates, and the lengths of rivers. Here, Steven Miller brings together many of the world's leading experts on Benford's law to demonstrate the many useful techniques that arise from the law, show how truly multidisciplinary it is, and encourage collaboration. Beginning with the general theory, the contributors explain the prevalence of the bias, highlighting explanations for when systems should and should not follow Benford's law and how quickly such behavior sets in. They go on to discuss important applications in disciplines ranging from accounting and economics to psychology and the natural sciences. The contributors describe how Benford's law has been successfully used to expose fraud in elections, medical tests, tax filings, and financial reports. Additionally, numerous problems, background materials, and technical details are available online to help instructors create courses around the book. Emphasizing common challenges and techniques across the disciplines, this accessible book shows how Benford's law can serve as a productive meeting ground for researchers and practitioners in diverse fields.

Methods of dimensionality reduction provide a way to understand and visualize the structure of complex data sets. Traditional methods like principal component analysis and classical metric multidimensional scaling suffer from being based on linear models. Until recently, very few methods were able to reduce the data dimensionality in a nonlinear way. However, since the late nineties, many new methods have been developed and nonlinear dimensionality reduction, also called manifold learning, has become a hot topic. New advances that account for this rapid growth are, e.g. the use of graphs to represent the manifold topology, and the use of new metrics like the geodesic distance. In addition, new optimization schemes, based on kernel techniques and spectral decomposition, have lead to spectral embedding, which encompasses many of the recently developed methods.

This book describes existing and advanced methods to reduce the dimensionality of numerical databases. For each method, the description starts from intuitive ideas, develops the necessary mathematical details, and ends by outlining the algorithmic implementation. Methods are compared with each other with the help of different illustrative examples.

The purpose of the book is to summarize clear facts and ideas about well-known methods as well as recent developments in the topic of nonlinear dimensionality reduction. With this goal in mind, methods are all described from a unifying point of view, in order to highlight their respective strengths and shortcomings.

The book is primarily intended for statisticians, computer scientists and data analysts. It is also accessible to other practitioners having a basic background in statistics and/or computational learning, like psychologists (in psychometry) and economists.

This book contains leading survey papers on the various aspects of Abduction, both logical and numerical approaches. Abduction is central to all areas of applied reasoning, including artificial intelligence, philosophy of science, machine learning, data mining and decision theory, as well as logic itself.

This textbook is an introduction to the theory of infinity-categories, a tool used in many aspects of modern pure mathematics. It treats the basics of the theory and supplies all the necessary details while leading the reader along a streamlined path from the basic definitions to more advanced results such as the very important adjoint functor theorems. The book is based on lectures given by the author on the topic. While the material itself is well-known to experts, the presentation of the material is, in parts, novel and accessible to non-experts. Exercises complement this textbook that can be used both in a classroom setting at the graduate level and as an introductory text for the interested reader.

Famous mathematical constants include the ratio of circular circumference to diameter, = 3.14 ..., and the natural logarithm base, e = 2.718 .... Students and professionals can often name a few others, but there are many more buried in the literature and awaiting discovery. How do such constants arise, and why are they important? Here the author renews the search he began in his book Mathematical Constants, adding another 133 essays that broaden the landscape. Topics include the minimality of soap film surfaces, prime numbers, elliptic curves and modular forms, Poisson-Voronoi tessellations, random triangles, Brownian motion, uncertainty inequalities, Prandtl-Blasius flow (from fluid dynamics), Lyapunov exponents, knots and tangles, continued fractions, Galton-Watson trees, electrical capacitance (from potential theory), Zermelo's navigation problem, and the optimal control of a pendulum. Unsolved problems appear virtually everywhere as well. This volume continues an outstanding scholarly attempt to bring together all significant mathematical constants in one place.