# The Leading eBooks Store Online

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

Most popular at the top

#### Structural Proof Theory

Cambridge University Press 2001; US$ 36.00A concise introduction to structural proof theory, a branch of logic studying the general structure of logical and mathematical proofs. more...

#### Student Solutions Manual for A Transition to Abstract Mathematics

Elsevier Science 2013; US$ 14.99Student Solutions Manual for A Transition to Abstract Mathematics more...

#### An Introduction to Mathematical Reasoning

Cambridge University Press 1997; US$ 52.00The purpose of this book is to introduce the basic ideas of mathematical proof and reasoning to students starting university mathematics. more...

#### Invitation to Fixed-Parameter Algorithms

Oxford University Press 2006; US$ 139.99This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation;... more...

#### Computability and Logic

Cambridge University Press 2002; US$ 28.00Now in its fourth edition, this book on logic has been enhanced and rewritten. more...

#### Computable Structures and the Hyperarithmetical Hierarchy

Elsevier Science 2000; US$ 175.00This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There... more...

#### Essays in Constructive Mathematics

Springer 2007; US$ 109.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...

#### New Computational Paradigms

Springer 2007; US$ 169.00Examines developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. This book covers topics in computability theory such as relative computability, theory of numberings, and domain theory. more...

#### Lambda-Calculus and Combinators

Cambridge University Press 2008; US$ 68.00This book gives an account of combinatory logic and lambda-calculus models. more...

#### Math Proofs Demystified

McGraw-Hill Education 2005; US$ 22.00Almost every student has to study some sort of mathematical proofs, whether it be in geometry, trigonometry, or with higher-level topics. In addition, mathematical theorems have become an interesting course for many students outside of the mathematical arena, purely for the reasoning and logic that is needed to complete them. Therefore, it is not... more...