This book gathers together a colorful set of problems on classical Mathematical Logic, selected from over 30 years of teaching. The initial chapters start with problems from supporting fields, like set theory (ultrafilter constructions), full-information game theory (strategies), automata, and recursion theory (decidability, Kleene's theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht- Fraisse game; ultraproducts; and examples for axiomatizability and non-axiomatizability. The Arithmetic part covers Robinson's theory, Peano's axiom system, and Goedel's incompleteness theorems. Finally, the book touches universal graphs, tournaments, and the zero-one law in Mathematical Logic. Instructors teaching Mathematical Logic, as well as students who want to understand its concepts and methods, can greatly benefit from this work. The style and topics have been specially chosen so that readers interested in the mathematical content and methodology could follow the problems and prove the main theorems themselves, including Goedel's famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume.

We live in a world that is not quite "right." The central tenet of statistical inquiry is that Observation = Truth + Error because even the most careful of scientific investigations have always been bedeviled by uncertainty. Our attempts to measure things are plagued with small errors. Our attempts to understand our world are blocked by blunders. And, unfortunately, in some cases, people have been known to lie. In this long-awaited follow-up to his well-regarded bestseller, The Lady Tasting Tea, David Salsburg opens a door to the amazing widespread use of statistical methods by looking at historical examples of errors, blunders and lies from areas as diverse as archeology, law, economics, medicine, psychology, sociology, Biblical studies, history, and war-time espionage. In doing so, he shows how, upon closer statistical investigation, errors and blunders often lead to useful information. And how statistical methods have been used to uncover falsified data. Beginning with Edmund Halley's examination of the Transit of Venus and ending with a discussion of how many tanks Rommel had during the Second World War, the author invites the reader to come along on this easily accessible and fascinating journey of how to identify the nature of errors, minimize the effects of blunders, and figure out who the liars are.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Perspectives in Logic series, Pour-El and Richards present the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The book focuses on the computability or noncomputability of standard processes in analysis and physics. Topics include classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, eigenvectors, and equations of mathematical physics. The work is self-contained, and although it is intended primarily for logicians and analysts, it should also be of interest to researchers and graduate students in physics and computer science.

During 1996-97 MSRI held a full academic-year program on combinatorics, with special emphasis on its connections to other branches of mathematics, such as algebraic geometry, topology, commutative algebra, representation theory, and convex geometry. The rich combinatorial problems arising from the study of various algebraic structures are the subject of this book, which features work done or presented at the program's seminars. The text contains contributions on matroid bundles, combinatorial representation theory, lattice points in polyhedra, bilinear forms, combinatorial differential topology and geometry, Macdonald polynomials and geometry, enumeration of matchings, the generalized Baues problem, and Littlewood-Richardson semigroups. These expository articles, written by some of the most respected researchers in the field, present the state of the art to graduate students and researchers in combinatorics as well as in algebra, geometry, and topology.

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.

This book casts the theory of periods of algebraic varieties in the natural setting of Madhav Nori's abelian category of mixed motives. It develops Nori's approach to mixed motives from scratch, thereby filling an important gap in the literature, and then explains the connection of mixed motives to periods, including a detailed account of the theory of period numbers in the sense of Kontsevich-Zagier and their structural properties. Period numbers are central to number theory and algebraic geometry, and also play an important role in other fields such as mathematical physics. There are long-standing conjectures about their transcendence properties, best understood in the language of cohomology of algebraic varieties or, more generally, motives. Readers of this book will discover that Nori's unconditional construction of an abelian category of motives (over fields embeddable into the complex numbers) is particularly well suited for this purpose. Notably, Kontsevich's formal period algebra represents a torsor under the motivic Galois group in Nori's sense, and the period conjecture of Kontsevich and Zagier can be recast in this setting. Periods and Nori Motives is highly informative and will appeal to graduate students interested in algebraic geometry and number theory as well as researchers working in related fields. Containing relevant background material on topics such as singular cohomology, algebraic de Rham cohomology, diagram categories and rigid tensor categories, as well as many interesting examples, the overall presentation of this book is self-contained.

Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area. The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development. Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.

This book presents a collection of invited articles by distinguished Mathematicians on the occasion of the Platinum Jubilee Celebrations of the Indian Statistical Institute, during the year 2007. These articles provide a current perspective of different areas of research, emphasizing the major challenging issues. Given the very significant record of the Institute in research in the areas of Statistics, Probability and Mathematics, distinguished authors have very admirably responded to the invitation. Some of the articles are written keeping students and potential new entrants to an area of mathematics in mind. This volume is thus very unique and gives a perspective of several important aspects of mathematics.

This careful selection of participant contributions reflects the focus of the 14th International Conference on Operator Theory, held in Timisoara (Romania) in June 1992, centering on the problems of extensions of operators and their connections with interpolation of analytic functions and with the spectral theory of differential operators. Other topics concern operator inequalities, spectral theory in general spaces and operator theory in Krein spaces.

Residue number systems (RNSs) and arithmetic are useful for several reasons. First, a great deal of computing now takes place in embedded processors, such as those found in mobile devices, for which high speed and low-power consumption are critical; the absence of carry propagation facilitates the realization of high-speed, low-power arithmetic. Second, computer chips are now getting to be so dense that full testing will no longer be possible; so fault tolerance and the general area of computational integrity have become more important. RNSs are extremely good for applications such as digital signal processing, communications engineering, computer security (cryptography), image processing, speech processing, and transforms, all of which are extremely important in computing today.This book provides an up-to-date account of RNSs and arithmetic. It covers the underlying mathematical concepts of RNSs; the conversion between conventional number systems and RNSs; the implementation of arithmetic operations; various related applications are also introduced. In addition, numerous detailed examples and analysis of different implementations are provided.

This volume focuses on the important mathematical idea of functions that, with the technology of computers and calculators, can be dynamically represented in ways that have not been possible previously. The book's editors contend that as result of recent technological developments combined with the integrated knowledge available from research on teaching, instruction, students' thinking, and assessment, curriculum developers, researchers, and teacher educators are faced with an unprecedented opportunity for making dramatic changes. The book presents content considerations that occur when the mathematics of graphs and functions relate to curriculum. It also examines content in a carefully considered integration of research that conveys where the field stands and where it might go. Drawing heavily on their own work, the chapter authors reconceptualize research in their specific areas so that this knowledge is integrated with the others' strands. This model for synthesizing research can serve as a paradigm for how research in mathematics education can -- and probably should -- proceed.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the third publication in the Perspectives in Logic series, is a much-needed monograph on the metamathematics of first-order arithmetic. The authors pay particular attention to subsystems (fragments) of Peano arithmetic and give the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness. The reader is only assumed to know the basics of mathematical logic, which are reviewed in the preliminaries. Part I develops parts of mathematics and logic in various fragments. Part II is devoted to incompleteness. Finally, Part III studies systems that have the induction schema restricted to bounded formulas (bounded arithmetic).

A satisfactory and coherent theory of orthogonal polynomials in several variables, attached to root systems, and depending on two or more parameters, has developed in recent years. This comprehensive account of the subject provides a unified foundation for the theory to which I.G. Macdonald has been a principal contributor. The first four chapters lead up to Chapter 5 which contains all the main results.

Siya is a worrier. And with good reason. His mother and sister just can't keep to a budget, and every month the family gets deeper into debt. But he's not one to sit back and let this situation continue. When his sister finds 'treasure' in a bottle of old buttons he think their problems are solved. But life is never that simple...

This best-selling text by John Taylor, now released in its second edition, introduces the study of uncertainties to lower division science students. Assuming no prior knowledge, the author introduces error analysis through the use of familiar examples ranging from carpentry to well-known historic experiments. Pertinent worked examples, simple exercises throughout the text, and numerous chapter-ending problems combine to make the book ideal for use in physics, chemistry and engineering lab courses. This book has been translated into nine languages and has more adoptions than we can count.

All modern books on Einstein emphasize the genius of his relativity theory and the corresponding corrections and extensions of the ancient space-time concept. However, Einstein s opposition to the use of probability in the laws of nature and particularly in the laws of quantum mechanics is criticized and often portrayed as outdated.

The author of Einstein Was Right takes a different view and shows that Einstein created a "Trojan horse" ready to unleash forces against the use of probability as a basis for the laws of nature. Einstein warned that the use of probability would, in the final analysis, lead to "spooky" actions and mysterious instantaneous influences at a distance.

John Bell pulled Einstein s Trojan horse into the castle of physics. He developed a theory that, together with experimental results of Aspect, Zeilinger, and others, "proves" the existence of quantum non-localities, instantaneous influences. These have indeed the nature of what Einstein labeled as "spooky."

The book Einstein Was Right shows that Bell was not aware of the special role that time and space-time play in any rigorous probability theory. As a consequence, his formalism is not general enough to be applied to the Aspect-Zeilinger type of experiments and his conclusions about the existence of instantaneous influences at a distance are incorrect.

This fact suggests a world view that is less optimistic about claims that teleportation and influences at a distance could open new horizons and provide the possibility of quantum computing. On the positive side, however, and as compensation, we are assured that the space-time picture of mankind developed over millions of years and perfected by Einstein, is still able to cope with the phenomena that nature presents us on the atomic and sub-atomic level and that the "quantum weirdness" may be explainable and understandable after all. "

This book studies the universal constructions and properties in categories of commutative algebras, bringing out the specific properties that make commutative algebra and algebraic geometry work. Two universal constructions are presented and used here for the first time. The author shows that the concepts and constructions arising in commutative algebra and algebraic geometry are not bound so tightly to the absolute universe of rings, but possess a universality that is independent of them and can be interpreted in various categories of discourse. This brings new flexibility to classical commutative algebra and affords the possibility of extending the domain of validity and the application of the vast number of results obtained in classical commutative algebra. This innovative and original work will interest mathematicians in a range of specialities, including algebraists, categoricians, and algebraic geometers.

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

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

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

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

This book is concerned with tangent cones, duality formulas, a generalized concept of conjugation, and the notion of maxi-minimizing sequence for a saddle-point problem, and deals more with algorithms in optimization. It focuses on the multiple exchange algorithm in convex programming.

The proceedings of the Los Angeles Caltech-UCLA 'Cabal Seminar' were originally published in the 1970s and 1980s. Ordinal Definability and Recursion Theory is the third in a series of four books collecting the seminal papers from the original volumes together with extensive unpublished material, new papers on related topics and discussion of research developments since the publication of the original volumes. Focusing on the subjects of 'HOD and its Local Versions' (Part V) and 'Recursion Theory' (Part VI), each of the two sections is preceded by an introductory survey putting the papers into present context. These four volumes will be a necessary part of the book collection of every set theorist.

A Handbook of Categorical Algebra, in three volumes, is a detailed account of everything a mathematician needs to know about category theory. Each volume is self-contained and is accessible to graduate students with a good background in mathematics. Volume 1 is devoted to general concepts. After introducing the terminology and proving the fundamental results concerning limits, adjoint functors and Kan extensions, the categories of fractions are studied in detail; special consideration is paid to the case of localizations. The remainder of the first volume studies various "refinements" of the fundamental concepts of category and functor.

Model theory is a branch of mathematical logic that has found applications in several areas of algebra and geometry. It provides a unifying framework for the understanding of old results and more recently has led to significant new results, such as a proof of the Mordell-Lang conjecture for function fields in positive characteristic. Perhaps surprisingly, it is sometimes the most abstract aspects of model theory that are relevant to those applications. This book gives the necessary background for understanding both the model theory and the mathematics behind the applications. Aimed at graduate students and researchers, it contains introductory surveys by leading experts covering the whole spectrum of contemporary model theory (stability, simplicity, o-minimality and variations), and introducing and discussing the diverse areas of geometry (algebraic, diophantine, real analytic, p-adic, and rigid) to which the model theory is applied. The book begins with an introduction to model theory by David Marker. It then broadens into three components: pure model theory (Bradd Hart, Dugald Macpherson), geometry(Barry Mazur, Ed Bierstone and Pierre Milman, Jan Denef), and the model theory of fields (Marker, Lou van den Dries, Zoe Chatzidakis).

This volume, first published in 2000, presents a classical approach to the foundations and development of the geometry of vector fields, describing vector fields in three-dimensional Euclidean space, triply-orthogonal systems and applications in mechanics. Topics covered include Pfaffian forms, systems in n-dimensional space, and foliations and their Godbillion-Vey invariant. There is much interest in the study of geometrical objects in n-dimensional Euclidean space and this volume provides a useful and comprehensive presentation.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the sixth publication in the Perspectives in Logic series, Keith J. Devlin gives a comprehensive account of the theory of constructible sets at an advanced level. The book provides complete coverage of the theory itself, rather than the many and diverse applications of constructibility theory, although applications are used to motivate and illustrate the theory. The book is divided into two parts: Part I (Elementary Theory) deals with the classical definition of the L -hierarchy of constructible sets and may be used as the basis of a graduate course on constructibility theory. and Part II (Advanced Theory) deals with the J -hierarchy and the Jensen 'fine-structure theory'.