首页> 外文期刊>Transactions of the American Mathematical Society >Extension theorems, orbits, and automorphisms of the computably enumerable sets
【24h】

Extension theorems, orbits, and automorphisms of the computably enumerable sets

机译:可计算枚举集的扩展定理,轨道和自同构

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We prove an algebraic extension theorem for the computably enumerable sets, epsilon. Using this extension theorem and other work we then show if A and (A) over cap are automorphic via Psi, then they are automorphic via Lambda where Lambda up arrow epsilon*( A) = Psi and Lambda up arrow epsilon*(A) is Delta(0)(3). We give an algebraic description of when an arbitrary set (A) over cap is in the orbit of a computably enumerable set A. We construct the first example of a definable orbit which is not a Delta(0)(3) orbit. We conclude with some results which restrict the ways one can increase the complexity of orbits. For example, we show that if A is simple and (A) over cap is in the same orbit as A, then they are in the same. Delta(0)(6)-orbit and, furthermore, we provide a classification of when two simple sets are in the same orbit.
机译:我们证明了可计算的集合epsilon的代数扩展定理。然后,使用此扩展定理和其他工作,我们证明盖上的A和(A)通过Psi是自同构的,然后通过Lambda是自同构的,其中Lambda向上箭头epsilon *(A)= Psi和Lambda向上箭头epsilon *(A)是Delta(0)(3)。我们给出了何时上限的任意集合(A)在可计算的集合A的轨道上的代数描述。我们构造了可定义轨道的第一个示例,该示例不是Delta(0)(3)轨道。我们得出一些结论,这些结果限制了人们增加轨道复杂性的方式。例如,我们表明如果A是简单的并且(A)上限与A处于同一轨道,则它们位于同一轨道。 Delta(0)(6)-轨道,此外,我们提供了两个简单集合何时在同一轨道上的分类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号