# The Leading eBooks Store Online

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

#### Basics Of Contemporary Cryptography For It Practitioners

World Scientific Publishing Company 2005; US$ 128.00The aim of this book is to provide a comprehensive introduction to cryptography without using complex mathematical constructions. The themes are conveyed in a form that only requires a basic knowledge of mathematics, but the methods are described in sufficient detail to enable their computer implementation. The book describes the main techniques and... 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...

#### Computability and Logic

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

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

#### Computable Models

Springer London 2009; US$ 109.00First book to explore the application of computable mathematical models to theoretical computer science and artificial intelligence e.g. the various areas of semantics, theories of formal ontologies and a computational approach to Montague semantics Examines the development, mathematical investigation and application of axiomatic theories of data... 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...

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

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

#### Logic and Computation

Cambridge University Press 1987; US$ 60.00This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program... more...