Positive numerations of families with one-valued numerations

DOI10.1007/BF01982111zbMath0572.03023OpenAlexW2084070337MaRDI QIDQ1062050

Sergei S. Goncharov

Publication date: 1983

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187235

zbMATH Keywords

minimal numerationnumerations of families of recursively enumerable sets

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Minimal numerations of positively computable families ⋮ On universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ A decomposition of the Rogers semilattice of a family of d.c.e. sets

Cites Work

• The quantity of nonautoequivalent constructivizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive numerations of families with one-valued numerations