首页 | 官方网站   微博 | 高级检索  
     


Almost semirecursive sets
Authors:A N Degtev
Affiliation:(1) Tyumen State University, Russia
Abstract:LetA be a subset of 
$$\mathbb{N} = \{ 0,1,2,...\} $$
, and leta∉A. The setA is said to be almost semirecursive, if there is a two-place general recursive functionf such thatf(x, y)ε{x, y, a}∧({x, y}⊆A⇌f(x, y)εA) for all 
$$x,y \in \mathbb{N}$$
. Among other facts, it is proved that ifA and 
$$\mathbb{N}\backslash A$$
are almost semirecursive sets, thenA is a semirecursive set, and that there exists a wsr*-set that is neither a wsr-nor an almost semirecursive set. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 188–193, August, 1999.
Keywords:semirecursive set  simple set  immune set  retraceable set  recursive enumerability
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号