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)

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

(7)

• On computable numberings of families of Turing degrees
• Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
• Effectively infinite classes of numberings and fixed point theorems
• Extremal numberings and fixed point theorems
• Numberings, c.e. oracles, and fixed points
• On Non-principal Arithmetical Numberings and Families
• Some properties of precompletely and positively 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)