Back

Zoom Roll over image to zoom in

The Computational Complexity of Logical Theories (Lecture Notes in Mathematics 718) (1979)

Ferrante, J./ Rackoff, C. W.
100.69 SGD
Member Price
90.63
English

Product Description

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.

... Read Full Text

Available to Order

Usually dispatches within 3-4 weeks

While every attempt has been made to ensure stock availability, occasionally we may run out of stock at our stores.

Free domestic shipping on orders over 50.00SGD

Discount is applied at checkout.

Recently Viewed Items

Related Products