# The Leading eBooks Store Online

## 3,667,858 members ⚫ 1,180,414 ebooks

Most popular at the top

#### 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.00 US$ 22.96Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. 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...

#### Essays in Constructive Mathematics

Springer New York 2007; US$ 129.00This book aims to promote constructive mathematics not by defining it or formalizing it but by practicing it. This means that its definitions and proofs use finite algorithms, not `algorithms' that require surveying an infinite number of possibilities to determine whether a given condition is met. The topics covered derive from classic works of... more...

#### The EM Algorithm and Extensions

Wiley 2007; US$ 158.00 US$ 136.93The 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 algorithm by describing... more...

#### How to Think About Algorithms

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

#### Constructive Negations and Paraconsistency

Springer Netherlands 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

Birkhäuser Basel 2007; US$ 97.71The 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...

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