scientific article; zbMATH DE number 871851

zbMATH Open0852.03020MaRDI QIDQ4875117FDOQ4875117

Authors: Serikzhan A. Badaev, S. S. Goncharov 

Publication date: 1 December 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

surveycomputable enumerations of classes of enumerable sets

Mathematics Subject Classification ID

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

Cited In (13)

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

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)