# The Leading eBooks Store Online

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

Most popular at the top

#### 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...

#### Computability and Logic

Cambridge University Press 2007; US$ 28.00Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. 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$ 40.00Textbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof. 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...

#### Computability, Complexity, Logic

Elsevier Science 1989; US$ 72.95The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory... more...

#### The Lambda Calculus

Elsevier Science 1985; US$ 133.00The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications... more...

#### The Moment of Proof

Oxford University Press, USA 2000; US$ 22.99When Archimedes, while bathing, suddenly hit upon the principle of buoyancy, he ran wildly through the streets of Syracuse, stark naked, crying "eureka!" In The Moment of Proof, Donald Benson attempts to convey to general readers the feeling of eureka--the joy of discovery--that mathematicians feel when they first encounter an elegant proof.... more...