# The Leading eBooks Store Online

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

Most popular at the top

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

#### Numbers Are Forever

Constable & Robinson 2014; US$ 14.57This book is only about numbers - that is, whole numbers and nothing but the whole numbers, which start from from 0, 1, 2, 3, 4... and go on forever. Here you can meet perfect numbers, happy numbers, lucky, untouchable, weird, narcissistic, evil and deficient numbers, not to mention nice Friedmans and multi-legged repunits, as well as primes... 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$ 170.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...

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

#### Lambda-Calculus and Combinators

Cambridge University Press 2008; US$ 65.00This book, first published in 2008, gives an account of combinatory logic and lambda-calculus models. more...

#### Applied Proof Theory

Springer 2008; US$ 99.00This is the first treatment in book format of proof-theoretic transformations - known as proof interpretations - that focuses on applications to ordinary mathematics. It covers both the necessary logical machinery behind the proof interpretations that are used in recent applications as well as - via extended case studies - carrying out some of these... more...