Uniform enumeration operations

DOI10.2307/2272164zbMATH Open0316.02048OpenAlexW2077301442MaRDI QIDQ4075451FDOQ4075451

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)

Cites Work

• Title not available (Why is that?)

Cited In (3)

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

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)