Positive enumerations

DOI10.1007/BF00967026MaRDI QIDQ1259587zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev

Publication date 1978

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

Full work available at URL https://doi.org/10.1007/bf00967026

zbMATH Keywords

positive enumerationsweak effective discrete family of recursive enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Cites work

• Endliche Gruppen mit einzelnen auflösbaren Untergruppen der Länge 2
• On computable enumerations. I
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(9)

• Positive presentations of families relative to \(e\)-oracles
• Two theorems on minimal generalized computable numberings
• One note on positive A-computable numberings
• Some properties of the upper semilattice of computable families of computably enumerable sets
• Reductions between types of numberings
• Friedberg numberings in the Ershov hierarchy
• Weak reducibility of computable and generalized computable numberings
• Effectively infinite classes of numberings of computable families of reals
• Positive presentations of families in relation to reducibility with respect to enumerability

This page was built for publication: Positive enumerations

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