Proof Complexity(Encyclopedia of Mathematics and its Applications)

证明的复杂性

数理逻辑与数学基础

售   价:
1164.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2019年03月28日
装      帧
精装
ISBN
9781108416849
复制
页      码
542
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个