Isolation and lattice embeddings

Author:

Wu Guohua

Abstract

AbstractSay that (a, d) is an isolation pair if a is a c.e. degree, d is a d.c.e. degree, a < d and a bounds all c.e. degrees below d. We prove that there are an isolation pair (a, d) and a c.e. degree c such that c is incomparable with a, d, and c cups d to o′, caps a to o. Thus, {o, c, d, o′} is a diamond embedding, which was first proved by Downey in [9]. Furthermore, combined with Harrington-Soare continuity of capping degrees, our result gives an alternative proof of N5 embedding.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference14 articles.

1. Recursively Enumerable Sets and Degrees

2. Cooper S. B. , Degrees of unsolvability, Ph.D. thesis, Leicester University, Leicester, England.

3. Structural properties of the degrees below o′;Arslanov;Doklady Akademii Nauk SSSR,1985

4. Cupping the Recursively Enumerable Degrees by D.R.E. Degrees

Cited by 16 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Isolation from Side and Cone Avoidance in the 2-Computably Enumerable wtt-Degrees;Journal of Mathematical Sciences;2023-09

2. Turing Computability: Structural Theory;Journal of Mathematical Sciences;2021-05-28

3. Isolation from Side in 2-Computably Enumerable Degrees;Russian Mathematics;2020-08

4. There Are No Maximal d.c.e. wtt-degrees;Computability and Complexity;2016-12-01

5. Elementary theories and structural properties of d-c.e. and n-c.e. degrees;Lobachevskii Journal of Mathematics;2016-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3