# The Leading eBooks Store Online

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

Most popular at the top

#### Cooperative Task-Oriented Computing: Algorithms and Complexity

Morgan & Claypool Publishers 2011; US$ 45.00Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single... more...

#### Around and Beyond the Square of Opposition

Springer 2012; US$ 89.95aiThe theory of oppositions based on Aristotelian foundations of logic has been pictured in a striking square diagram which can be understood and applied in many different ways having repercussions in various fields: epistemology, linguistics, mathematics, psychology. The square can also be generalized in other two-dimensional or multi-dimensional... more...

#### Ways of Proof Theory

De Gruyter 2010; US$ 196.00On the occasion of the retirement of Wolfram Pohlers the Institut für Mathematische Logik und Grundlagenforschung of the University of Münster organized a colloquium and a workshop which took place July 17 ? 19, 2008. This event brought together proof theorists from many parts of the world who have been acting as teachers, students and collaborators... more...

#### Sparse Grids and Applications - Munich 2012

Springer 2014; US$ 169.00Sparse grids have gained increasing interest in recent years for the numerical treatment of high-dimensional problems. Whereas classical numerical discretization schemes fail in more than three or four dimensions, sparse grids make it possible to overcome the ?curse? of dimensionality to some degree, extending the number of dimensions that can be dealt... 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...

#### Computation and Automata

Cambridge University Press 1985; US$ 72.00In this 1985 book, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science. more...

#### Varieties of Constructive Mathematics

Cambridge University Press 1987; US$ 52.00This is an introduction to, and survey of, the constructive approaches to pure mathematics. more...

#### Lambda-Calculus and Combinators

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