文章基本信息
- 标题：On Completeness of Pseudosimple Sets
- 本地全文：下载
- 作者：Vadim Bulitko
- 期刊名称：Journal of Universal Computer Science
- 印刷版ISSN：0948-6968
- 出版年度：1995
- 卷号：1
- 期号：2
- 页码：151-154
- 出版社：Graz University of Technology and Know-Center
- 摘要：The paper contains completeness criterions for pseudosimple sets. Those criterions are constructed using effectivization of the definitions as well as extensionally bounded functions.
