Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for The Computational Complexity of Logical Theories
Stock Image
Computational Complexity of Logical Theories
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783662209806
Stock Image
Computational Complexity of Logical Theories
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783662209806
Buy New
US$ 62.51
Shipping:
US$ 5.46
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
The Computational Complexity of Logical Theories
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783662209806_new
Buy New
US$ 61.69
Shipping:
US$ 15.73
From United Kingdom to U.S.A.
Quantity: Over 20 available