On universal pairs in the Ershov hierarchy (Q2221958): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creative Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Inseparability for Sequences of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hierarchy of sets. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable enumerations of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cardinality of semilattices of enumerations of nondiscrete families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal numerations of positively computable families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable single-valued numerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive numerations of families with one-valued numerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computable enumerations. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper semilattice of numerations of a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recursive Enumeration Without Repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations of families of general recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems on computable numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two existence theorems for computable numerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cardinality of the upper semilattice of computable enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of elementary theories of Rogers semilattices of analytical hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numberings in the analytical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of the Rogers semilattice of a family of d.c.e. sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friedberg numberings in the Ershov hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions between types of numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3068310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The universal Lachlan semilattice without the greatest element / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy of limiting computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denseness properties of the lattice of separation-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the theory of the lattice \(L^ 0_{sm}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings / rank
 
Normal rank

Latest revision as of 11:29, 24 July 2024

scientific article
Language Label Description Also known as
English
On universal pairs in the Ershov hierarchy
scientific article

    Statements

    On universal pairs in the Ershov hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2021
    0 references
    A classical result of (independently) Muchnik and Smullyan is that if \(A\) and \(B\) are effectively inseparable, then \((C,D)\le_m(A,B)\) for any disjoint c.e.~sets \(C\),~\(D\). The present paper finds analogs of \((A,B)\) for every level of the Ershov hierarchy. The authors then generalize further from pairs to certain finite collections of sets -- again, for each Ershov level.
    0 references
    Ershov hierarchy
    0 references
    \( m \)-reducibility
    0 references
    C-class
    0 references
    computable numbering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers