On Recursive Enumeration Without Repetition

DOI10.1002/MALQ.19650110305MaRDI QIDQ5541322zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1965

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19650110305

zbMATH Keywords

mathematical logic

Cited in

(3)

• On universal pairs in the Ershov hierarchy
• On injective enumerability of recursively enumerable classes of cofinite sets
• On recursive enumerability with finite repetitions

This page was built for publication: On Recursive Enumeration Without Repetition

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