scientific article; zbMATH DE number 16546

MaRDI QIDQ3973232zbMATH OpenFDO

Authors V. P. Dobritsa

Publication date 26 June 1992

zbMATH Keywords

computable numberingrecursive modelenumerable subclass of computable class

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• scientific article; zbMATH DE number 4035802
• Publication:4735182
• scientific article; zbMATH DE number 3853049
• Conditions of effective infinity for the set of computable indexings of a class of constructive models
• scientific article; zbMATH DE number 871854

Cited in

(5)

• scientific article; zbMATH DE number 4035802 (Why is no real title available?)
• Effectively closed sets and enumerations
• Effective choice of constructivizations and recursive consistency of problems on constructive models
• The number of computable indexations of finite classes of constructive models
• scientific article; zbMATH DE number 4160713 (Why is no real title available?)

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 Q3973232)