The Haskell Road to Logic, Maths and Programming


Kees Doets - 2004
    Haskell emerged in the last decade as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvellous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures.This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others.

On Numbers and Games


John H. Conway - 1976
    Originally written to define the relation between the theories of transfinite numbers and mathematical games, the resulting work is a mathematically sophisticated but eminently enjoyable guide to game theory. By defining numbers as the strengths of positions in certain games, the author arrives at a new class, the surreal numbers, that includes both real numbers and ordinal numbers. These surreal numbers are applied in the author's mathematical analysis of game strategies. The additions to the Second Edition present recent developments in the area of mathematical game theory, with a concentration on surreal numbers and the additive theory of partizan games.

Theory of Games and Economic Behavior


John von Neumann - 1944
    What began more than sixty years ago as a modest proposal that a mathematician and an economist write a short paper together blossomed, in 1944, when Princeton University Press published Theory of Games and Economic Behavior. In it, John von Neumann and Oskar Morgenstern conceived a groundbreaking mathematical theory of economic and social organization, based on a theory of games of strategy. Not only would this revolutionize economics, but the entirely new field of scientific inquiry it yielded--game theory--has since been widely used to analyze a host of real-world phenomena from arms races to optimal policy choices of presidential candidates, from vaccination policy to major league baseball salary negotiations. And it is today established throughout both the social sciences and a wide range of other sciences.This sixtieth anniversary edition includes not only the original text but also an introduction by Harold Kuhn, an afterword by Ariel Rubinstein, and reviews and articles on the book that appeared at the time of its original publication in the New York Times, tthe American Economic Review, and a variety of other publications. Together, these writings provide readers a matchless opportunity to more fully appreciate a work whose influence will yet resound for generations to come.

Introduction to Logic


Irving M. Copi - 1953
    Many new exercises introduced in this edition help supplement and support explanations, aid in review, and make the book visually stimulating. This edition also includes a revised Logic tutorial on CD-Rom--further simplifying the study of logic. Includes many fascinating illustrations taken from the history of science as well as from contemporary research in the physical and biological sciences, plus introduces an abundance of new exercises throughout, complete with solutions for the first exercise in a set. Appropriate for those in business, education, political, or psychology careers.

Basic Category Theory for Computer Scientists


Benjamin C. Pierce - 1991
    Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts.

A First Course in Abstract Algebra


John B. Fraleigh - 1967
    Focused on groups, rings and fields, this text gives students a firm foundation for more specialized work by emphasizing an understanding of the nature of algebraic structures. KEY TOPICS: Sets and Relations; GROUPS AND SUBGROUPS; Introduction and Examples; Binary Operations; Isomorphic Binary Structures; Groups; Subgroups; Cyclic Groups; Generators and Cayley Digraphs; PERMUTATIONS, COSETS, AND DIRECT PRODUCTS; Groups of Permutations; Orbits, Cycles, and the Alternating Groups; Cosets and the Theorem of Lagrange; Direct Products and Finitely Generated Abelian Groups; Plane Isometries; HOMOMORPHISMS AND FACTOR GROUPS; Homomorphisms; Factor Groups; Factor-Group Computations and Simple Groups; Group Action on a Set; Applications of G-Sets to Counting; RINGS AND FIELDS; Rings and Fields; Integral Domains; Fermat's and Euler's Theorems; The Field of Quotients of an Integral Domain; Rings of Polynomials; Factorization of Polynomials over a Field; Noncommutative Examples; Ordered Rings and Fields; IDEALS AND FACTOR RINGS; Homomorphisms and Factor Rings; Prime and Maximal Ideas; Gr�bner Bases for Ideals; EXTENSION FIELDS; Introduction to Extension Fields; Vector Spaces; Algebraic Extensions; Geometric Constructions; Finite Fields; ADVANCED GROUP THEORY; Isomorphism Theorems; Series of Groups; Sylow Theorems; Applications of the Sylow Theory; Free Abelian Groups; Free Groups; Group Presentations; GROUPS IN TOPOLOGY; Simplicial Complexes and Homology Groups; Computations of Homology Groups; More Homology Computations and Applications; Homological Algebra; Factorization; Unique Factorization Domains; Euclidean Domains; Gaussian Integers and Multiplicative Norms; AUTOMORPHISMS AND GALOIS THEORY; Automorphisms of Fields; The Isomorphism Extension Theorem; Splitting Fields; Separable Extensions; Totally Inseparable Extensions; Galois Theory; Illustrations of Galois Theory; Cyclotomic Extensions; Insolvability of the Quintic; Matrix Algebra MARKET: For all readers interested in abstract algebra.

An Introduction to Functional Programming Through Lambda Calculus


Greg Michaelson - 1989
    This well-respected text offers an accessible introduction to functional programming concepts and techniques for students of mathematics and computer science. The treatment is as nontechnical as possible, and it assumes no prior knowledge of mathematics or functional programming. Cogent examples illuminate the central ideas, and numerous exercises appear throughout the text, offering reinforcement of key concepts. All problems feature complete solutions.

Geometry, Relativity and the Fourth Dimension


Rudolf Rucker - 1977
    A remarkable pictorial discussion of the curved space-time we call home, it achieves even greater impact through the use of 141 excellent illustrations. This is the first sustained visual account of many important topics in relativity theory that up till now have only been treated separately.Finding a perfect analogy in the situation of the geometrical characters in Flatland, Professor Rucker continues the adventures of the two-dimensional world visited by a three-dimensional being to explain our three-dimensional world in terms of the fourth dimension. Following this adventure into the fourth dimension, the author discusses non-Euclidean geometry, curved space, time as a higher dimension, special relativity, time travel, and the shape of space-time. The mathematics is sound throughout, but the casual reader may skip those few sections that seem too purely mathematical and still follow the line of argument. Readable and interesting in itself, the annotated bibliography is a valuable guide to further study.Professor Rucker teaches mathematics at the State University of New York in Geneseo. Students and laymen will find his discussion to be unusually stimulating. Experienced mathematicians and physicists will find a great deal of original material here and many unexpected novelties. Annotated bibliography. 44 problems.

Godel: A Life Of Logic, The Mind, And Mathematics


John L. Casti - 2000
    His Incompleteness Theorem turned not only mathematics but also the whole world of science and philosophy on its head. Equally legendary were Gö's eccentricities, his close friendship with Albert Einstein, and his paranoid fear of germs that eventually led to his death from self-starvation. Now, in the first popular biography of this strange and brilliant thinker, John Casti and Werner DePauli bring the legend to life. After describing his childhood in the Moravian capital of Brno, the authors trace the arc of Gö's remarkable career, from the famed Vienna Circle, where philosophers and scientists debated notions of truth, to the Institute for Advanced Study in Princeton, New Jersey, where he lived and worked until his death in 1978. In the process, they shed light on Gö's contributions to mathematics, philosophy, computer science, artificial intelligence -- even cosmology -- in an entertaining and accessible way.

PI in the Sky: Counting, Thinking, and Being


John D. Barrow - 1992
    Barrow's Pi in the Sky is a profound -- and profoundly different -- exploration of the world of mathematics: where it comes from, what it is, and where it's going to take us if we follow it to the limit in our search for the ultimate meaning of the universe. Barrow begins by investigating whether math is a purely human invention inspired by our practical needs. Or is it something inherent in nature waiting to be discovered?In answering these questions, Barrow provides a bridge between the usually irreconcilable worlds of mathematics and theology. Along the way, he treats us to a history of counting all over the world, from Egyptian hieroglyphics to logical friction, from number mysticism to Marxist mathematics. And he introduces us to a host of peculiar individuals who have thought some of the deepest and strangest thoughts that human minds have ever thought, from Lao-Tse to Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow thus provides the historical framework and the intellectual tools necessary to an understanding of some of today's weightiest mathematical concepts.

Single Variable Essential Calculus: Early Transcendentals


James Stewart - 1995
    In writing the book James Stewart asked himself:What is essential for a three-semester calculus course for scientists and engineers? Stewart's SINGLE VARIABLE ESSENTIAL CALCULUS: EARLY TRANSCENDENTALS offers a concise approach to teaching calculus, focusing on major concepts and supporting those with precise definitions, patient explanations, and carefully graded problems. SINGLE VARIABLE ESSENTIAL CALCULUS: EARLY TRANSCENDENTALS is only 850 pages-two-thirds the size of Stewart's other calculus texts (CALCULUS, FIFTH EDITION AND CALCULUS, EARLY TRANSCENDENTALS, Fifth Edition)-yet it contains almost all of the same topics. The author achieved this relative brevity mainly by condensing the exposition and by putting some of the features on the website www.StewartCalculus.com. Despite the reduced size of the book, there is still a modern flavor: Conceptual understanding and technology are not neglected, though they are not as prominent as in Stewart's other books. SINGLE VARIABLE ESSENTIAL CALCULUS: EARLY TRANSCENDENTALS has been written with the same attention to detail, eye for innovation, and meticulous accuracy that have made Stewart's textbooks the best-selling calculus texts in the world.

Applied Cryptography: Protocols, Algorithms, and Source Code in C


Bruce Schneier - 1993
    … The book the National Security Agency wanted never to be published." –Wired Magazine "…monumental… fascinating… comprehensive… the definitive work on cryptography for computer programmers…" –Dr. Dobb's Journal"…easily ranks as one of the most authoritative in its field." —PC Magazine"…the bible of code hackers." –The Millennium Whole Earth CatalogThis new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography—the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations

Meta Math!: The Quest for Omega


Gregory Chaitin - 2005
    His investigations shed light on what we can ultimately know about the universe and the very nature of life. In an infectious and enthusiastic narrative, Chaitin delineates the specific intellectual and intuitive steps he took toward the discovery. He takes us to the very frontiers of scientific thinking, and helps us to appreciate the art—and the sheer beauty—in the science of math.

God Created the Integers: The Mathematical Breakthroughs That Changed History


Stephen Hawking - 2005
    In this collection of landmark mathematical works, editor Stephen Hawking has assembled the greatest feats humans have ever accomplished using just numbers and their brains.

Introduction to Algorithms


Thomas H. Cormen - 1989
    Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.