The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
- Elsevier Science 2000; US$ 133.00
This 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...
- Cambridge University Press 2002; US$ 28.00
Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters. more...
- Elsevier Science 1989; US$ 189.00
The 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...
- Springer 2007; US$ 129.99
Examines 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...
- Elsevier Science 1999; US$ 195.00
The 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...
- Cambridge University Press 1987; US$ 52.00
This 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...
- World Scientific Publishing Company 2005; US$ 70.00
The 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...