The method of the yu–ding theorem and its application

Authors:
Yun Fan
Affiliations:
Department of mathematics, nanjing university, china and department of mathematics, southeast university, china email: fanyun1234@hotmail.com
Venue:
Mathematical Structures in Computer Science
Year:
2009

Citing 3
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Random reals and Lipschitz continuity

Mathematical Structures in Computer Science
Computably enumerable sets in the solovay and the strong weak truth table degrees

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We begin by reviewing the major results dealing with the structure of the cl-degrees, and then focus on the method of the Yu–Ding Theorem, which is an important result in this area. By strengthening the Yu–Ding procedure, we construct a cl-cuppable cl-degree of c.e. sets.