scientific article; zbMATH DE number 871851

MaRDI QIDQ4875117zbMATH OpenFDO

Authors Serikzhan A. Badaev, S. S. Goncharov

Publication date 1 December 1996

zbMATH Keywords

computable enumerations of classes of enumerable setssurvey

Mathematics Subject Classification ID

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

Recommendations

• Enumeration reducibility and computable structure theory
• Publication:4934282
• Universal computable enumerations of finite classes of families of total functions
• scientific article; zbMATH DE number 16546

Cited in

(14)

• On \(p \)-universal and \(p \)-minimal numberings
• Universal computable enumerations of finite classes of families of total functions
• Enumeration reducibility and computable structure theory
• scientific article; zbMATH DE number 5125120 (Why is no real title available?)
• Bounding minimal degrees by computably enumerable degrees
• scientific article; zbMATH DE number 1390017 (Why is no real title available?)
• Friedberg numberings in the Ershov hierarchy
• Minimal enumerations of subsets of a finite set and the middle level problem
• Online Enumeration of All Minimal Inductive Validity Cores
• Two theorems on minimal generalized computable numberings
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• A family with a single minimal but not least numbering
• Some recent research directions in the computably enumerable sets
• Punctual numberings for families of sets

This page was built for publication:

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