The Leading eBooks Store Online
3,508,729 members ⚫ 2,065,349 ebooks
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
Most popular at the top
- Oxford University Press 1993; US$ 159.99
This work is a sequel to the author's G?del's Incompleteness Theorems , though it can be read independently by anyone familiar with G?del'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. ... more...
- Elsevier Science 1992; US$ 72.95
This 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...
- Elsevier Science 2011; US$ 205.00
This 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...
- Springer Berlin Heidelberg 2011; US$ 49.95
S. 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...
- Elsevier Science 2010; US$ 79.95
Computability 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...
- Taylor and Francis 2012; US$ 20.95
'Nagel and Newman accomplish the wondrous task of clarifying the argumentative outline of Kurt Godel's celebrated logic bomb.' ? The Guardian In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of physicist Albert Einstein, his... more...
- Cambridge University Press 1980; US$ 112.00
This book is a collection of advanced research/survey papers by eminent research workers in the Recursion theory. more...
- World Scientific Publishing Company 2014; US$ 22.00
This volume presents the lecture notes of short courses given by three leading experts in mathematical logic at the 2012 Asian Initiative for Infinity Logic Summer School . The major topics cover set-theoretic forcing, higher recursion theory, and applications of set theory to C*-algebra. This volume offers a wide spectrum of ideas and techniques introduced... more...
- De Gruyter 2015; US$ 168.00
This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory,... more...