首页> 外文会议>Workshop on Computational Prospects of Infinity >CUPPING COMPUTABLY ENUMERABLE DEGREES INTHE ERSHOV HIERARCHY
【24h】

CUPPING COMPUTABLY ENUMERABLE DEGREES INTHE ERSHOV HIERARCHY

机译:Chinging Itershov层次结构的拔罐可计算地令人享受的学位

获取原文

摘要

The study of the degrees below 0' starts from Kleene and Post's seminalpaper [37]. Research in this area has led to the deep understanding ofTuring degrees and the development of various construction techniques.In many constructions, for example, in the construction of minimal degreesbelow 0', it is necessary to combine the priority argument with the sorts offorcing methods employed in the global theory. The difficulties encounteredin attempting to "localize" results from the global theory to degrees below0' have led to a better understanding of the nature of various constructions.
机译:在0'低于0'之下的研究从Kleene和Post的Semomapor [37]开始。该领域的研究导致了对学位的深刻理解和各种施工技术的发展。在许多结构中,例如,在最小的曲率0'的构造中,必须将优先级参数与所采用的各种落地方法组合起来在全球理论中。遇到在全球理论中试图“本地化”的困难导致了更好地了解各种建筑的性质。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号