# The Leading eBooks Store Online

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

Most popular at the top

#### An Introduction to Many-Valued and Fuzzy Logic

Cambridge University Press 2008; US$ 40.00An accessible introduction to many-valued and fuzzy logic designed for undergraduate and graduate students. more...

#### Recursion Theory for Metamathematics

Oxford University Press 1993; US$ 139.99This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is... more...

#### Godel's Incompleteness Theorems

Oxford University Press 1992; US$ 224.99An introduction to the work of the mathematical logician Kurt Godel, which guides the reader through his Theorem of Undecidability and his theories on the completeness of logic, the incompleteness of numbers and the consistency of the axiom of choice. more...

#### Super-Recursive Algorithms

Springer 2006; US$ 169.00Provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. This book demonstrates how these algorithms are more appropriate as mathematical models for modern computers. more...

#### Goguen Categories

Springer 2007; US$ 209.00Goguen categories extend the relational calculus and its categorical formalization to the fuzzy world. Starting from the fundamental concepts of sets, binary relations and lattices this book introduces several categorical formulations of an abstract theory of relations such as allegories, Dedekind categories and related structures. It is shown that... more...

#### Recursive Functionals

Elsevier Science 1992; US$ 72.95This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers.... more...

#### Fundamentals of Generalized Recursion Theory

Elsevier Science 2011; US$ 205.00This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods... more...

#### Recursion Theory and Computational Complexity

Springer 2011; US$ 49.95S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory. more...

#### Computability Theory

Elsevier Science 2010; US$ 79.95Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized... more...