期刊文献+

省略内聚集(英文)

OMITTING COHESIVE SETS
下载PDF
导出
摘要 给定一个可计算的自然数子集序列向量R,并假设向量R没有可计算的内聚集.我们证明:任何一个3-兼纳集合都不能计算向量R-内聚集;同时,存在一个Martin-Lf随机集,它不能计算向量R-内聚集. We prove that if R is a computable sequence of subsets of ω which admits no computable cohesive set, then no 3-generic computes any R-cohesive set; and there exists a Martin-LSf random which computes no R-cohesive set.
作者 王玮
出处 《南京大学学报(数学半年刊)》 CAS 2013年第1期40-47,共8页 Journal of Nanjing University(Mathematical Biquarterly)
基金 Supported by NSF Grant 11001281 of China and an NCET grant from the Ministry of Education of China
关键词 内聚集 兼纳集 随机集 可计算 cohesive set, Cohen generic, Martin-Lof random, reverse mathematics
  • 相关文献

参考文献7

  • 1Peter A, Cholak, Carl G. Jockusch, and Theodore A. Slaman. On the Strength of Ramsey's Theorem for Pairs. J. Symbolic Logic, 2001, 66(1): 1-55.
  • 2Rod Downey and Denis Hirschfeldt. Algorithmic Randomness and Complexity. Theory and Appli- cations of Computability. Springer, 2010.
  • 3Denis R. Hirschfeldt and Richard A. Shore. Combinatorial Principles Weaker Than Ramsey's The- orem for Pairs. J. Symbolic Logic, 2007, 72(1): 171-206.
  • 4Carl Jockusch and Frank Stephan. A Cohesive Set which is Not High. Math. Logic Quart., 1993, 39(4): 515-530.
  • 5Antonfn Kucera. Measure, П^01-classes and Complete Extensions of PA. Recursion theory week (Oberwolfach, 1984), volume 1141 of Lecture Notes in Math., pages 245-259. Springer, Berlin, 1985.
  • 6Stephen G. Simpson. Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.
  • 7Robert I. Soare. Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series. Springer-Verlag, Heidelberg, 1987.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部