On inseparable pairs

DOI10.1007/BF02219043MaRDI QIDQ2561211zbMATH OpenFDO

Authors Yuri L. Ershov

Publication date 1972

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02219043

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• A note on universal sets
• On computable enumerations. I
• Some Properties of Recursively Inseparable Sets

Cited in

(12)

• Numberings, c.e. oracles, and fixed points
• Extremal numberings and fixed point theorems
• Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
• On Non-principal Arithmetical Numberings and Families
• On computable numberings of families of Turing degrees
• Effectively infinite classes of numberings and fixed point theorems
• Some properties of precompletely and positively numbered sets
• Fixed point theorems for minimal numberings
• A family whose computable numberings are all complete
• On e-principal and e-complete numberings
• Relative completeness of arithmetical numberings
• Recursion theorems in numbered sets

This page was built for publication: On inseparable pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561211)