Effectively infinite classes of enumerations

MaRDI QIDQ1920071zbMATH OpenFDO

Authors Alexander Yakhnis, S. S. Goncharov, Vladimir Yakhnis

Publication date 28 August 1996

Published in Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

computable enumerationseffective infinityfinite injury priority methodFriedberg enumerationpositive elementsrecursive functionrecursively enumerable setsRogers semilattice

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)

Recommendations

• Some effectively infinite classes of enumerations
• A unique positive enumeration
• The Rogers semilattices of generalized computable enumerations
• Effectively closed sets and enumerations
• On recursive enumerability with finite repetitions

Cited in

(6)

• Some effectively infinite classes of enumerations
• A unique positive enumeration
• Enumerations of ^0_1 classes: acceptability and decidable classes
• On recursive enumerability with finite repetitions
• Effectively infinite classes of numberings and computable families of reals
• Effectively closed sets and enumerations

This page was built for publication: Effectively infinite classes of enumerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920071)