On universal pairs in the Ershov hierarchy

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Numberings in the analytical hierarchy
Denseness properties of the lattice of separation-degrees
Computable single-valued numerations
Positive numerations of families with one-valued numerations
Hierarchy of limiting computations
Two existence theorems for computable numerations
On the cardinality of the upper semilattice of computable enumerations
The upper semilattice of numerations of a finite set
Enumerations of families of general recursive functions
Two theorems on computable numberings
Computable enumerations of families of general recursive functions
On cardinality of semilattices of enumerations of nondiscrete families
Minimal numerations of positively computable families
Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
On computable enumerations. I
Undecidability of the theory of the lattice \(L^ 0_{sm}\)
Reductions between types of numberings
Enumeration of families of general recursive functions
On a hierarchy of sets. III
Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
Theory of Formal Systems. (AM-47)
Creative Functions
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
The universal Lachlan semilattice without the greatest element
A decomposition of the Rogers semilattice of a family of d.c.e. sets
On Recursive Enumeration Without Repetition
Effective Inseparability for Sequences of Sets
Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
Friedberg numberings in the Ershov hierarchy