Elementary differences between the degrees of unsolvability and degrees of compressibility (Q636334): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2009.11.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072474105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracing and domination in the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative randomness and cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, lowness and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Pi_1^0 \) classes, LR degrees and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cupping, measure and computably enumerable splittings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness notions, measure and domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low for random reals and positive-measure domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost everywhere domination and superhighness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Latest revision as of 10:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Elementary differences between the degrees of unsolvability and degrees of compressibility
scientific article

    Statements

    Elementary differences between the degrees of unsolvability and degrees of compressibility (English)
    0 references
    0 references
    26 August 2011
    0 references
    In this paper the following is proved: Let \(X\) be a \(\Delta^0_2\)-set which is not \(K\)-trivial. Then there exists a c.e. set \(A\) which is not \(K\)-trivial such that \(A \leq_{LR} X\). It follows from this result that the \(\Delta^0_2\)-structures of \(LR/LK\)-degrees and the Turing degrees are not elementarily equivalent. Let \(X ,Y\) be \(\Delta^0_2\)-sets which are not \(K\)-trivial. Then there exists a c.e. set \(A\) which is not \(K\)-trivial such that \(A\leq_{LR} X\) and \(A\leq_{LR} Y\). It follows from this result that the \(\Sigma^0_1\)-structures of \(LR/LK\)-degrees and the Turing degrees are not elementarily equivalent. Also, the structure of the \(LR/LK\)-degrees below the \(LR/LK\)-degree of the halting problem is not elementarily equivalent to the \(\Sigma^0_1\)- and \(\Delta^0_2\)-structures of \(LR/LK\)-degrees.
    0 references
    0 references
    degrees of unsolvability
    0 references
    degrees of compressibility
    0 references
    elementary equivalence
    0 references
    minimal pairs
    0 references
    0 references