# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...

Most popular at the top

#### Lectures on the Curry-Howard Isomorphism

Elsevier Science 2006; US$ 165.00The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic... more...

#### Mathematical Thinking and Writing

Elsevier Science 2001; US$ 107.00The ability to construct proofs is one of the most challenging aspects of the world of mathematics. It is, essentially, the defining moment for those testing the waters in a mathematical career. Instead of being submerged to the point of drowning, readers of Mathematical Thinking and Writing are given guidance and support while learning the language... more...

#### Handbook of Computability Theory

Elsevier Science 1999; US$ 200.00The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind... more...

#### The Nuts and Bolts of Proofs

Elsevier Science 2005; US$ 53.95The Nuts and Bolts of Proof instructs students on the basic logic of mathematical proofs, showing how and why proofs of mathematical statements work. It provides them with techniques they can use to gain an inside view of the subject, reach other results, remember results more easily, or rederive them if the results are forgotten.A flow chart graphically... more...

#### Handbook of Proof Theory

Elsevier Science 1998; US$ 235.00This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics... more...

#### The EM Algorithm and Extensions

Wiley 2007; US$ 148.00The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM... more...

#### How to Think About Algorithms

Cambridge University Press 2008; US$ 36.00Textbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof. more...

#### Adapting Proofs-as-Programs

Springer 2007; US$ 139.00Details developments in the direction of a practical proofs-as-programs paradigm, which constitutes a set of approaches to developing programs from proofs in constructive logic with applications to industrial-scale, complex software engineering problems. more...

#### Constructive Negations and Paraconsistency

Springer 2008; US$ 239.00This book presents the author's recent investigations of the two main concepts of negation developed in the constructive logic: the negation as reduction to absurdity (L.E.J. Brouwer) and the strong negation (D. Nelson) are studied in the setting of paraconsistent logic.The paraconsistent logics are those, which admit inconsistent but non-trivial... more...

#### Symbolic-Numeric Computation

Springer 2007; US$ 139.00The growing demand of speed, accuracy, and reliability in scientific and engineering computing has been accelerating the merging of symbolic and numeric computations. These two types of computation coexist in mathematics yet are separated in traditional research of mathematical computation. This book presents 27 research articles on the integration... more...