scientific article; zbMATH DE number 16546
From MaRDI portal
Publication:3973232
[For the entire collection see Zbl 0702.00009.] Let \(K^*\) be a computable class of constructive (recursive) models, \(\gamma\) its computable numbering. A subclass \(K^*_ 0\) of the class \(K^*\) is called enumerable in the numbering \(\gamma\) if the set of \(\gamma\)-indexes of elements of \(K^*_ 0\) is recursively enumerable. Some connections between the numbers of computable numberings of \(K^*\) and \(K^*_ 0\) are given.
Recommendations
Cited in
(7)- Effective choice of constructivizations and recursive consistency of problems on constructive models
- scientific article; zbMATH DE number 4160713 (Why is no real title available?)
- scientific article; zbMATH DE number 4035802 (Why is no real title available?)
- scientific article; zbMATH DE number 871851 (Why is no real title available?)
- scientific article; zbMATH DE number 871854 (Why is no real title available?)
- The number of computable indexations of finite classes of constructive models
- Effectively closed sets and enumerations
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)