{"product_id":"9783540095019","title":"The Computational Complexity of Logical Theories (Lecture Notes in Mathematics 718) (1979)","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","brand":"SPRINGER, BERLIN","offers":[{"title":"Default Title","offer_id":52353712128311,"sku":"00000_00000_00000_00000","price":297.93,"currency_code":"MYR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0962\/3548\/7543\/files\/9783540095019-1.jpg?v=1783269727","url":"https:\/\/kinokuniya.com.my\/products\/9783540095019","provider":"Books Kinokuniya Malaysia","version":"1.0","type":"link"}