A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definab(Annals of Mathematics Studies)

图灵度的层次结构:可计算的可枚举度、统一类和自然可定义性中的低概念的超限层次

数理逻辑与数学基础

售   价:
1239.00
发货周期:预计8-10周
作      者
出  版 社
出版时间
2020年06月16日
装      帧
精装
ISBN
9780691199658
复制
页      码
240
开      本
9.50 x 6.40 x 0.80
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 69 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers. Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个