On Recursive Enumeration Without Repetition

DOI10.1002/MALQ.19650110305zbMath0158.25102OpenAlexW2004999461MaRDI QIDQ5541322

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

Related Items (3)

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

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