Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics.The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite.

    These vignettes serve as springboards to many telling perspectives: simple arithmetic puts life-long habits in a dubious new light; higher dimensional geometry helps us see that we're all rather peculiar; nonlinear dynamics explains the narcissism of small differences cascading into very different siblings; logarithms and exponentials yield insight on why we tend to become bored and jaded as we age; and there are tricks and jokes, probability and coincidences, and much more.For fans of Paulos or newcomers to his work, this witty commentary on his life--and yours--is fascinating reading.From the Trade Paperback edition.

    Organized around the central concept of a vector space, the book includes numerous physical applications in the body of the text as well as many problems of a physical nature. It is also one of the purposes of this book to introduce the physicist to the language and style of mathematics as well as the content of those particular subjects with contemporary relevance in physics.Chapters 1 and 2 are devoted to the mathematics of classical physics. Chapters 3, 4 and 5 — the backbone of the book — cover the theory of vector spaces. Chapter 6 covers analytic function theory. In chapters 7, 8, and 9 the authors take up several important techniques of theoretical physics — the Green's function method of solving differential and partial differential equations, and the theory of integral equations. Chapter 10 introduces the theory of groups. The authors have included a large selection of problems at the end of each chapter, some illustrating or extending mathematical points, others stressing physical application of techniques developed in the text.Essentially self-contained, the book assumes only the standard undergraduate preparation in physics and mathematics, i.e. intermediate mechanics, electricity and magnetism, introductory quantum mechanics, advanced calculus and differential equations. The text may be easily adapted for a one-semester course at the graduate or advanced undergraduate level.

    According to the author, these trends sought to create a unified conceptual apparatus as a common basis for the whole of human knowledge.Because these new developments in logical thought tended to perfect and sharpen the deductive method, an indispensable tool in many fields for deriving conclusions from accepted assumptions, the author decided to widen the scope of the work. In subsequent editions he revised the book to make it also a text on which to base an elementary college course in logic and the methodology of deductive sciences. It is this revised edition that is reprinted here.Part One deals with elements of logic and the deductive method, including the use of variables, sentential calculus, theory of identity, theory of classes, theory of relations and the deductive method. The Second Part covers applications of logic and methodology in constructing mathematical theories, including laws of order for numbers, laws of addition and subtraction, methodological considerations on the constructed theory, foundations of arithmetic of real numbers, and more. The author has provided numerous exercises to help students assimilate the material, which not only provides a stimulating and thought-provoking introduction to the fundamentals of logical thought, but is the perfect adjunct to courses in logic and the foundation of mathematics.

    This approach constantly reminds students of the logic behind what they are learning, and each procedure is taught both verbally and numerically, which helps to emphasize the concepts. Thoroughly revised, with new content and many new practice examples, this text takes the reader from basic procedures through analysis of variance (ANOVA). Students cover statistics and also learn to read and inderstand research articles. - SPSS examplesincluded with each procedure - Dozens of examples updated (especially the in-the-research-literature ones) - Reorganization - The self-contained chapters on correlation and regression have been moved after t-test and analysis of variance - Emphasis on definitional formulas - As opposed to computational formulas - Practical, up-to-date excerpts - For each procedure, the text explains how results are described in research articles. example being described in each way - Interesting examples throughout - Often include studies of or by researchers of diverse ethnicities - Complete package of ancillary materials - A web page with additional practice problems and extensive interactive study materials, plus four mini chapters covering additional material not in the text, a very substantial test bank; an instructors' manual that provides sample syllabi, lecture outlines, and ready-to-copy (or download) power-point slides or transparencies with examples not in the book; and a very complete students' study guide that also provides a thorough workbook for using SPSS with this book.

    This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, -The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory.- Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper, -On Computable Numbers, with an Application to the Entscheidungsproblem, - Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.

    In this guide for students, each equation is the subject of an entire chapter, with detailed, plain-language explanations of the physical meaning of each symbol in the equation, for both the integral and differential forms. The final chapter shows how Maxwell's equations may be combined to produce the wave equation, the basis for the electromagnetic theory of light. This book is a wonderful resource for undergraduate and graduate courses in electromagnetism and electromagnetics. A website hosted by the author at www.cambridge.org/9780521701471 contains interactive solutions to every problem in the text as well as audio podcasts to walk students through each chapter.

    Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.

    In the same period, the cross-fertilization of mathematics and philosophy resulted in a new sort of 'mathematical philosophy', associated most notably (but in different ways) with Bertrand Russell, W. V. Quine, and Godel himself, and which remains at the focus of Anglo-Saxon philosophical discussion. The present collection brings together in a convenient form the seminal articles in the philosophy of mathematics by these and other major thinkers. It is a substantially revised version of the edition first published in 1964 and includes a revised bibliography. The volume will be welcomed as a major work of reference at this level in the field.

    A timeless introduction to the field and a landmark in symbolic logic, showing that classical logic can be treated algebraically.

    Each chapter opens with a surprising insight—not a mathematic formula, but a common observation. From there, the authors leapfrog over math and anecdote toward profound ideas about nature, art, and music. Coincidences is a book for lovers of puzzles and posers of outlandish questions, lapsed math aficionados and the formula-phobic alike.

    This book helps you even the odds. Using easy-to-understand explanations and examples, it demystifies probability -- and even offers savvy tips to boost your chances of gambling success Discover how to* Conquer combinations and permutations* Understand probability models from binomial to exponential* Make good decisions using probability* Play the odds in poker, roulette, and other games

    But in spirit, the title is apt, as the book does cover a much broader range of topics than a typical introductory book on mathematical statistics. This book is for people who want to learn probability and statistics quickly. It is suitable for graduate or advanced undergraduate students in computer science, mathematics, statistics, and related disciplines. The book includes modern topics like nonparametric curve estimation, bootstrapping, and clas- sification, topics that are usually relegated to follow-up courses. The reader is presumed to know calculus and a little linear algebra. No previous knowledge of probability and statistics is required. Statistics, data mining, and machine learning are all concerned with collecting and analyzing data. For some time, statistics research was con- ducted in statistics departments while data mining and machine learning re- search was conducted in computer science departments. Statisticians thought that computer scientists were reinventing the wheel. Computer scientists thought that statistical theory didn't apply to their problems. Things are changing. Statisticians now recognize that computer scientists are making novel contributions while computer scientists now recognize the generality of statistical theory and methodology. Clever data mining algo- rithms are more scalable than statisticians ever thought possible. Formal sta- tistical theory is more pervasive than computer scientists had realized.

    Imagine that you face three doors, behind one of which is a prize. You choose one but do not open it. The host--call him Monty Hall--opens a different door, alwayschoosing one he knows to be empty. Left with two doors, will you do better by sticking with your first choice, or by switching to the other remaining door? In this light-hearted yet ultimately serious book, Jason Rosenhouse explores the history of this fascinating puzzle. Using a minimum ofmathematics (and none at all for much of the book), he shows how the problem has fascinated philosophers, psychologists, and many others, and examines the many variations that have appeared over the years. As Rosenhouse demonstrates, the Monty Hall Problem illuminates fundamental mathematical issuesand has abiding philosophical implications. Perhaps most important, he writes, the problem opens a window on our cognitive difficulties in reasoning about uncertainty.

    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.