scientific article; zbMATH DE number 5041641

zbMath1095.03027MaRDI QIDQ5476772

S. Yu. Podzorov

Publication date: 18 July 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimal coveringweak reducibilityRogers semilatticelimit propertycomplete numberingreducibility of numberings

Mathematics Subject Classification ID

Semilattices (06A12) Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)

Related Items (7)

Minimal generalized computable numberings and families of positive preorders ⋮ Universal generalized computable numberings and hyperimmunity ⋮ Some absolute properties of \(A\)-computable numberings ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Khutoretskii's theorem for generalized computable families ⋮ Generalized computable universal numberings

This page was built for publication: