The Computational Complexity of Logical Theories

Name: The Computational Complexity of Logical Theories
Brand: Springer
SKU: 9783540095019
Price: 5562.00 INR
Availability: InStock

by J. Ferrante, C. W. Rackoff

Springer

₹5,562

Free delivery. Nothing extra to pay at checkout.

New copy. Each book is ordered new from our distributor, Atlantic Books, after you place your order.
Delivery in 3–7 days to any serviceable pincode in India, with tracking.
Cash on delivery. Pay when the parcel reaches you.
15-day returns. See what qualifies.

From the publisher

and background.- Ehrenfeucht games and decision procedures.- Integer addition An example of an Ehrenfeucht game decision procedure.- Some additional upper bounds.- Direct products of theories.- Lower bound preliminaries.- A technique for writing short formulas defining complicated properties.- A lower bound on the theories of pairing functions.- Some additional lower bounds.

Description supplied by the publisher.