English Books > Mathematics > Mathematical Analysis > Arithmetic, Proof Theory, and Computational Complexity

Arithmetic, Proof Theory, and Computational Complexity
Hardback; Book; Line Figures, Bibliography
442 pages
Published: May 1993
Oxford University Press
ISBN: 0198536909

Concerns the rapidly growing area of logical complexity theory, the study of bounded arithmetic, propositional proof systems, length of proof and relations to computational complexity theory. An open problem list consisting of 7 fundamental and 39 technical questions is included.



 
  
The NetStoreUSA website is operated by Open Communications, Inc
an Arizona corporation, which has successfully served
the Internet community since 1994.






 



Copyright © 2009 Open Communications, Inc
®Open Communications is a Registered Trade Mark.
This material may be freely distributed ONLY with full reference to Open Communications Inc,
including fax, phone, e-mail, and world-wide web details.
This material is an invitation to treat and not an offer.
We reserve the right to decline orders received from this site.
Prices subject to change to be advised on confirmation of order.
Not all titles listed are in print.
Home Page: http://www.NetStoreUSA.com/
Site Map