Enumeration of families of general recursive functions

DOI10.1007/BF01040653zbMath0191.30401MaRDI QIDQ2537970

Yuri L. Ershov

Publication date: 1968

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (11)

Rogers semilattices of punctual numberings ⋮ Two theorems on minimal generalized computable numberings ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Ideals without minimal elements in Rogers semilattices ⋮ A family with a single minimal but not least numbering ⋮ On universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Lattice properties of Rogers semilattices of compuatble and generalized computable families ⋮ One-element Rogers semilattices in the Ershov hierarchy

Cites Work

• An enumeration of the primitive recursive functions without repetition

This page was built for publication: Enumeration of families of general recursive functions