On \(n\)-tardy sets (Q435200): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963259647 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.0228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's program and incomplete recursively enumerable sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Δ₃⁰-automorphism method and noninvariant classes of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codable sets and orbits of computably enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3232283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank

Latest revision as of 10:33, 5 July 2024

scientific article
Language Label Description Also known as
English
On \(n\)-tardy sets
scientific article

    Statements

    On \(n\)-tardy sets (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2012
    0 references
    This paper extends and generalizes work of Harrington and Soare on \(n\)-tardy sets. The authors prove the existence of (i) a 3-tardy set that is not \(\leq_T\) any 2-tardy set (and hence is not codable) and (ii) a low\({}_2\), simple, 2-tardy set. They also define a family of nontrivial lattice-theoretic properties \(Q_n\), with \(Q_n\) implying \(n\)-tardiness, and use this family to establish the existence of infinitely many incomplete orbits in \(\mathcal E\).
    0 references
    \(n\)-tardy sets
    0 references
    c.e. sets
    0 references
    r.e. sets
    0 references
    automorphisms
    0 references

    Identifiers