Complexity of Proofs and Their Transformations in Axiomatic Theories(Translations of Mathematical Monographs)

数理逻辑与数学基础

原   价:
1941.25
售   价:
1553.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出版时间
1993年10月30日
装      帧
精装
ISBN
9780821845769
复制
页      码
153
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The aim of this work is to develop the tool of logical deduction schemata and use it to establish upper and lower bounds on the complexity of proofs and their transformations in axiomatized theories. The main results are establishment of upper bounds on the elongation of deductions in cut eliminations; a proof that the length of a direct deduction of an existence theorem in the predicate calculus cannot be bounded above by an elementary function of the length of an indirect deduction of the same theorem; a complexity version of the existence property of the constructive predicate calculus; and, for certain formal systems of arithmetic, restrictions on the complexity of deductions that guarantee that the deducibility of a formula for all natural numbers in some finite set implies the deducibility of the same formula with a universal quantifier over all sufficiently large numbers.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个