We strive to deliver the best value to our customers and ensure complete satisfaction for all our textbook rentals.
You can return your online books for any reason within our refund period – no questions asked.
Every order is available for express shipping, and return shipping is always free.
You'll be happy with the quality of your books (or we'll ship you another one on our dime).
You can extend your rental at any time – at the same cheap daily rental rate.
If you decide to keep the book it will never cost more than the purchase price.
As always, you have access to over 5 million titles. Plus, you can choose from 5 rental periods, so you only pay for what you’ll use. And if you ever run into trouble, our top-notch U.S. based Customer Service team is ready to help by email, chat or phone.
Supplemental materials are not guaranteed for used textbooks or rentals (access codes, DVDs, workbooks).
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 2 (Studies in Logic and the Foundations of Mathematics, Vol. 143)
Volume II of Classical Recursion Theory describes the universe from a local (bottom-upor synthetical) point of view, and covers the whole spectrum, from therecursive to the arithmetical sets. The first half of the book provides a detailed picture of the computablesets from the perspective of Theoretical Computer Science. Besides giving adetailed...
Volume II of Classical Recursion Theory describes the universe from a local (bottom-upor synthetical) point of view, and covers the whole spectrum, from therecursive to the arithmetical sets. The first half of the book provides a detailed picture of the computablesets from the perspective of Theoretical Computer Science. Besides giving adetailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexityclasses, ranging from small time and space bounds to the elementary functions,with a particular attention to polynomial time and space computability. It alsodeals with primitive recursive functions and larger classes, which are ofinterest to the proof theorist. The second half of the book starts with the classical theory of recursivelyenumerable sets and degrees, which constitutes the core of Recursion orComputability Theory. Unlike other texts, usually confined to the Turingdegrees, the book covers a variety of other strong reducibilities, studyingboth their individual structures and their mutual relationships. The lastchapters extend the theory to limit sets and arithmetical sets. The volumeends with the first textbook treatment of the enumeration degrees, whichadmit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested inComplexity and Computability Theory. The student will appreciate the detailedbut informal account of a wide variety of basic topics, while the specialistwill find a wealth of material sketched in exercises and asides. A massivebibliography of more than a thousand titles completes the treatment on thehistorical side.
Since launching the first textbook rental site in 2006, BookRenter has never wavered from our mission to make education more affordable for all students. Every day, we focus on delivering students the best prices, the most flexible options, and the best service on earth. On March 13, 2012 BookRenter.com, Inc. formally changed its name to Rafter, Inc. We are still the same company and the same people, only our corporate name has changed.