Higher Recursion Theory(1st Edition)

Authors:

Gerald E Sacks

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 1 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$182.99

List Price: $261.42 Savings: $78.43 (30%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Higher Recursion Theory

Price:

$9.99

/month

Book details

ISBN: 3540193057, 978-3540193050

Book publisher: Springer

Offer Just for You!: Buy 2 books before the end of January and enter our lucky draw.

Book Price $182.99 : Hyperarithmetic Theory Is The First Step Beyond Classical Recursion Theory. It Is The Primary Source Of Ideas And Examples In Higher Recursion Theory. It Is Also A Crossroad For Several Areas Of Mathematical Logic: In Set Theory It Is An Initial Segment Of Godel's L; In Model Theory, The Least Admissible Set After ; In Descriptive Set Theory, The Setting For Effective Arguments. In This Book, Hyperarithmetic Theory Is Developed At Length And Used To Lift Classical Recursion Theory From Integers To Recursive Ordinals (metarecursion). Two Further Liftings Are Then Made, First Ordinals ( -recursion) And Then To Sets (E-recursion). Techniques Such As Finite And Infinite Injury, Forcing And Fine Structure And Extended And Combined Dynamic And Syntactical Methods Are Contrasted. Several Notions Of Reducibility And Computation Are Compared. Post's Problem Is Answere Affirmatively In All Three Settings. This Long-awaited Volume Of The -series Will Be A "Must" For All Working In The Field.