There are no maximal low d.c.e. degrees (Q558429): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3727979 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4511553 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relative enumerability in the difference hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The d.r.e. degrees are not dense / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4732457 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interpolation and embedding in the recursively enumerable degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The recursively enumerable degrees are dense / rank | |||
Normal rank |
Latest revision as of 12:21, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | There are no maximal low d.c.e. degrees |
scientific article |
Statements
There are no maximal low d.c.e. degrees (English)
0 references
6 July 2005
0 references
The main result of the paper is Theorem 1.6 showing that there is no maximal low d.c.e. degree. Besides, a number of different results concerning d.c.e.degrees are discussed. We recall that a set \(A\) is d.c.e. if \(A\) is a difference of two computably enumerable sets. Turing d.c.e. degrees, i.e. degrees containing d.c.e sets, were studied more or less intensively during the last 10--15 years when a number of significant results concerning d.c.e. degrees have been obtained including the famous `Non-Density Theorem' by Cooper, Harrington, Lachlan, Lempp and Soare. The paper is useful for all people interested in the modern development of computability theory.
0 references
d.c.e degree
0 references
computably enumerable set
0 references
Turing degrees
0 references