On inseparable pairs

DOI10.1007/BF02219043zbMath0263.02021MaRDI QIDQ2561211

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)

Related Items (4)

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

Cites Work

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

This page was built for publication: On inseparable pairs