{"product_id":"the-computational-complexity-of-logical-theories-von-j-ferrante-c-w-rackoff","title":"The Computational Complexity of Logical Theories","description":"\u003cp\u003eand 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783540095019\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783540095019","offer_id":39425271169117,"sku":"9783540095019","price":53.49,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/32380c09-aea9-46dd-9512-3bd3739eb5e9.jpg?v=1772086424","url":"https:\/\/shop.autorenwelt.de\/en\/products\/the-computational-complexity-of-logical-theories-von-j-ferrante-c-w-rackoff","provider":"Autorenwelt Shop","version":"1.0","type":"link"}