menu
{ "item_title" : "Complexity, Logic, and Recursion Theory", "item_author" : [" Andrea Sorbi "], "item_description" : "Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/82/470/026/0824700260_b.jpg", "price_data" : { "retail_price" : "370.00", "online_price" : "370.00", "our_price" : "370.00", "club_price" : "370.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Complexity, Logic, and Recursion Theory|Andrea Sorbi

Complexity, Logic, and Recursion Theory

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Other Available Formats

Paperback
370.00
Hardcover
$255.00

show all formats

Overview

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."

This item is Non-Returnable

Details

  • ISBN-13: 9780824700263
  • ISBN-10: 0824700260
  • Publisher: CRC Press
  • Publish Date: February 1997
  • Dimensions: 9.84 x 6.98 x 0.65 inches
  • Shipping Weight: 1.43 pounds
  • Page Count: 384

Related Categories

You May Also Like...

    1

BAM Customer Reviews