Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.

    The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional coverage of introductory material such as sets.

    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.

    It is intended to provide the essential primary texts for students of logic, metaphysics and philosophy of language.It contains, in particular, Frege's four essays 'Function and Concept', 'On Sinn and Bedeutung', 'On Concept and Object' and 'Thought', and new translations of key parts of the Begriffschrift, Grundlagen and Grundgesetze. Additional selections have also been made from his Collected Papers, Posthumous Writings and Correspondence. The editor's introduction provides an overview of the development and significance of Frege's philosophy, highlighting some of the main issues of interpretation. Footnotes, appendices and other editorial material have been supplied to facilitate understanding of the works of one of the central figures in modern philosophy.

    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.

    A lecture class taught by Wittgenstein, however, hardly resembled a lecture. He sat on a chair in the middle of the room, with some of the class sitting in chairs, some on the floor. He never used notes. He paused frequently, sometimes for several minutes, while he puzzled out a problem. He often asked his listeners questions and reacted to their replies. Many meetings were largely conversation. These lectures were attended by, among others, D. A. T. Gasking, J. N. Findlay, Stephen Toulmin, Alan Turing, G. H. von Wright, R. G. Bosanquet, Norman Malcolm, Rush Rhees, and Yorick Smythies. Notes taken by these last four are the basis for the thirty-one lectures in this book. The lectures covered such topics as the nature of mathematics, the distinctions between mathematical and everyday languages, the truth of mathematical propositions, consistency and contradiction in formal systems, the logicism of Frege and Russell, Platonism, identity, negation, and necessary truth. The mathematical examples used are nearly always elementary.

    It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity. Topics include sets, logic, counting, methods of conditional and non-conditional proof, disproof, induction, relations, functions and infinite cardinality.

    It presents in a unified manner an introduction to the mathematical theory underlying computer graphic applications. It covers topics of keen interest to students in engineering and computer science: transformations, projections, 2-D and 3-D curve definition schemes, and surface definitions. It also includes techniques, such as B-splines, which are incorporated as part of the software in advanced engineering workstations. A basic knowledge of vector and matrix algebra and calculus is required.

    The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5

    It contains many puzzles and their solutions and aims to attract many readers in an age where computer science, logic, and mathematics are becoming increasingly important and popular.

     -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. -Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org

    For the first time, William Poundstone reveals the toughest questions used at Microsoft and other Fortune 500 companies -- and supplies the answers. He traces the rise and controversial fall of employer-mandated IQ tests, the peculiar obsessions of Bill Gates (who plays jigsaw puzzles as a competitive sport), the sadistic mind games of Wall Street (which reportedly led one job seeker to smash a forty-third-story window), and the bizarre excesses of today's hiring managers (who may start off your interview with a box of Legos or a game of virtual Russian roulette). How Would You Move Mount Fuji? is an indispensable book for anyone in business. Managers seeking the most talented employees will learn to incorporate puzzle interviews in their search for the top candidates. Job seekers will discover how to tackle even the most brain-busting questions, and gain the advantage that could win the job of a lifetime. And anyone who has ever dreamed of going up against the best minds in business may discover that these puzzles are simply a lot of fun. Why are beer cans tapered on the end, anyway?

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

    Written by two of the best-known names in categorical logic, Conceptual Mathematics is the first book to apply categories to the most elementary mathematics. It thus serves two purposes: first, to provide a key to mathematics for the general reader or beginning student; and second, to furnish an easy introduction to categories for computer scientists, logicians, physicists, and linguists who want to gain some familiarity with the categorical method without initially committing themselves to extended study.

    Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.