Uniform enumeration operations

DOI10.2307/2272164MaRDI QIDQ4075451zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1975

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272164

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(3)

• There is no degree invariant half-jump
• Recursively enumerable sets and degrees
• On the problem of the critical bound

This page was built for publication: Uniform enumeration operations

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