Arithmetic, Proof Theory, and Computational Complexity(Oxford Logic Guides)

算术,证明理论和计算复杂性

数理逻辑与数学基础

售   价:
894.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
1993年05月06日
装      帧
精装
ISBN
9780198536901
复制
页      码
442
开      本
234x156mm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 29 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book principally concerns the rapidly growing area of Logical Complexity Theory, the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. Additional features of the book include (1) the transcription and translation of a recently discovered 1956 letter from K Godel to J von Neumann, asking about a polynomial time algorithm for the proof in k-symbols of predicate calculus formulas (equivalent to the P-NP question), (2) an OPEN PROBLEM LIST consisting of 7 fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个