首页> 外文期刊>RAIRO Theoretical Informatics and Applications >UNDECIDABILITY OF TOPOLOGICAL AND ARITHMETICAL PROPERTIES OF INFINITARY RATIONAL RELATIONS
【24h】

UNDECIDABILITY OF TOPOLOGICAL AND ARITHMETICAL PROPERTIES OF INFINITARY RATIONAL RELATIONS

机译:无限理性关系的拓扑和算术性质的不确定性

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

摘要

We prove that for every countable ordinal a one cannot decide whether a given infinitary rational relation is in the Borel class Σ_α~0 (respectively Π_α~0). Furthermore one cannot decide whether a given infmitary rational relation is a Borel set or a Σ_1~1-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is an arithmetical set. We then deduce from the proof of these results some other ones, like: one cannot decide whether the complement of an infinitary rational relation is also an infinitary rational relation.
机译:我们证明,对于每一个可数序数,都无法确定给定的无限理性关系是否在Borel类Σ_α〜0(分别为Π_α〜0)中。此外,不能确定给定的基本有理关系是Borel集还是Σ_1〜1完全集。我们证明了这些属性的一些递归类似物。特别是,不能确定无限式理性关系是否为算术集合​​。然后,我们从这些结果的证明中推导出另外一些结果,例如:无法确定无限性理性关系的补充是否也是一种无限性理性关系。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号