Picture 1 of 1
Gallery
Picture 1 of 1
Have one to sell?
Classical Recursion Theory: The Theory of Funct, Odifreddi, Odifreddi, Hoek-,
US $133.55
ApproximatelyS$ 171.34
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages.
3 available
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: MD, United States
Delivery:
Estimated between Thu, 21 Aug and Thu, 28 Aug to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:335217361638
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- PublishedOn
- 1992-02-04
- Title
- Classical Recursion Theory: The Theory of Functions and Sets of
- Artist
- Not Specified
- ISBN
- 9780444894830
About this product
Product Identifiers
Publisher
Elsevier Science & Technology
ISBN-10
0444894837
ISBN-13
9780444894830
eBay Product ID (ePID)
1828474
Product Key Features
Number of Pages
660 Pages
Language
English
Publication Name
Classical Recursion Theory : the Theory of Functions and Sets of Natural Numbers
Subject
Information Theory, Logic
Publication Year
1992
Type
Textbook
Subject Area
Mathematics, Computers
Series
Studies in Logic and the Foundations of Mathematics Ser.
Format
Trade Paperback
Dimensions
Item Weight
38.4 Oz
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
Reviews
G.E. Sacks, Harvard University and M.I.T. Odifreddi has written a delightful yet scholarly treatise... C. Calude An impressive presentation of classical recursion theory... highly recommended to everyone interested in recursion theory. Zentralblatt f r Mathematik A must as a reference manual for any mathematician, philosopher or theoretical computer scientist who deals with issues of computability. Mathematical Reviews An incredible wealth of information, including much that occurs for the first time in book form. Journal of Symbolic Logic, G.E. Sacks, Harvard University and M.I.T. Odifreddi has written a delightful yet scholarly treatise... C. Calude An impressive presentation of classical recursion theory... highly recommended to everyone interested in recursion theory. Zentralblatt fr Mathematik A must as a reference manual for any mathematician, philosopher or theoretical computer scientist who deals with issues of computability. Mathematical Reviews An incredible wealth of information, including much that occurs for the first time in book form. Journal of Symbolic Logic, Odifreddi has written a delightful yet scholarly treatise... G.E. Sacks, Harvard University and M.I.T. An impressive presentation of classical recursion theory... highly recommended to everyone interested in recursion theory. Zentralblatt für Mathematik C. Calude A must as a reference manual for any mathematician, philosopher or theoretical computer scientist who deals with issues of computability. Mathematical Reviews An incredible wealth of information, including much that occurs for the first time in book form. Journal of Symbolic Logic., G.E. Sacks, Harvard University and M.I.T. Odifreddi has written a delightful yet scholarly treatise... C. Calude An impressive presentation of classical recursion theory... highly recommended to everyone interested in recursion theory. Zentralblatt für Mathematik A must as a reference manual for any mathematician, philosopher or theoretical computer scientist who deals with issues of computability. Mathematical Reviews An incredible wealth of information, including much that occurs for the first time in book form. Journal of Symbolic Logic
Series Volume Number
Volume 125
Volume Number
Volume 125
Illustrated
Yes
Table Of Content
Recursiveness and Computability. Induction. Systems of Equations. Arithmetical Formal Systems. Turing Machines. Flowcharts. Functions as Rules. Arithmetization. Church's Thesis. Basic Recursion Theory. Partial Recursive Functions. Diagonalization. Partial Recursive Functionals. Effective Operations. Indices and Enumerations. Retraceable and Regressive Sets. Post's Problem and Strong Reducibilities. Post's Problem. Simple Sets and Many-One Degrees. Hypersimple Sets and Truth-Table Degrees. Hyperhypersimple Sets and Q-Degrees. A Solution to Post's Problem. Creative Sets and Completeness. Recursive Isomorphism Types. Variations of Truth-Table Reducibility. The World of Complete Sets. Formal Systems and R.E. Sets. Hierarchies and Weak Reducibilities. The Arithmetical Hierarchy. The Analytical Hierarchy. The Set-Theoretical Hierarchy. The Constructible Hierarchy. Turing Degrees. The Language of Degree Theory. The Finite Extension Method. Baire Category. The Coinfinite Extension Method. The Tree Method. Initial Segments. Global Properties. Degree Theory with Jump. Many-One and Other Degrees. Distributivity. Countable Initial Segments. Uncountable Initial Segments. Global Properties. Comparison of Degree Theories. Structure Inside Degrees. Bibliography. Index.
Synopsis
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular G del's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation., 1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Item description from the seller
Seller business information
VAT number: GB 724498118
Popular categories from this store
Seller feedback (545,349)
- i***a (345)- Feedback left by buyer.Past monthVerified purchaseExactly as it was described, came on time and was what I was looking for, A+++ seller!
- 3***l (190)- Feedback left by buyer.Past monthVerified purchaseThe book is great condition. Good price and got it fast. Ty!
- a***t (60)- Feedback left by buyer.Past monthVerified purchasethanks my book arrived in great condition as seller described it .thanks
Popular categories from this store
Seller feedback (545,349)
- i***a (345)- Feedback left by buyer.Past monthVerified purchaseExactly as it was described, came on time and was what I was looking for, A+++ seller!
- 3***l (190)- Feedback left by buyer.Past monthVerified purchaseThe book is great condition. Good price and got it fast. Ty!
- a***t (60)- Feedback left by buyer.Past monthVerified purchasethanks my book arrived in great condition as seller described it .thanks