Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees(Memoirs of the American Mathematical Society)

*小的弱真理表度和可计算的图灵度

数理逻辑与数学基础

原   价:
1000
售   价:
800.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后3-5周到货!
出版时间
2021年01月30日
装      帧
平装
ISBN
9781470441623
复制
页      码
90
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as $m$-deducibility or truth table reducibility, it is possible for computably enumerable degrees to be minimal. For weaker notions of reducibility, such as weak truth table reducibility or Turing reducibility, it is not possible to combine these properties in a single degree. This book considers how minimal weak truth table degrees interact with computably enumerable Turing degrees and obtain three main results. First, there are sets with minimal weak truth table degree which bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with computable enumerable Turing degree can have minimal weak truth table degree. Third, no $Delta^0_2$ set which Turing bounds a promptly simple set can have minimal weak truth table degree.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个