menu
{ "item_title" : "General Recursion Theory", "item_author" : [" Jens E. Fenstad "], "item_description" : "Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/10/716/816/1107168163_b.jpg", "price_data" : { "retail_price" : "159.00", "online_price" : "159.00", "our_price" : "159.00", "club_price" : "159.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
General Recursion Theory|Jens E. Fenstad

General Recursion Theory : An Axiomatic Approach

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.

This item is Non-Returnable

Details

  • ISBN-13: 9781107168169
  • ISBN-10: 1107168163
  • Publisher: Cambridge University Press
  • Publish Date: March 2017
  • Dimensions: 9.21 x 6.14 x 0.69 inches
  • Shipping Weight: 1.2 pounds
  • Page Count: 238

Related Categories

You May Also Like...

    1

BAM Customer Reviews