Local structure of Rogers semilattices of Σn 0-computable numberings
From MaRDI portal
Publication:5393765
DOI10.1007/s10469-005-0010-3zbMath1104.03038OpenAlexW2025592279MaRDI QIDQ5393765
Publication date: 24 October 2006
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-005-0010-3
Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)
Related Items (11)
Two theorems on minimal generalized computable numberings ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Upper Semilattices in Many-One Degrees ⋮ Unnamed Item ⋮ Some absolute properties of \(A\)-computable numberings ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Friedberg numberings of families of partial computable functionals ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Lattice properties of Rogers semilattices of compuatble and generalized computable families ⋮ Generalized computable universal numberings
This page was built for publication: Local structure of Rogers semilattices of Σn 0-computable numberings
