Definability and Computability(Siberian School of Algebra and Logic)

数理逻辑与数学基础

原   价:
2788.75
售   价:
2231.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
1996年04月30日
装      帧
精装
ISBN
9780306110399
复制
页      码
264
开      本
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 81 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the Gödel incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory’s development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个