首页> 外文会议>Conference on Computability in Europe >Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
【24h】

Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests

机译:有限标记森林的同型拟矩阵中的不可察觉性

获取原文

摘要

We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k ≥3, in contrast to the known decidability result for k=2. We establish also undecidablity (again for every k ≥3) of elementary theories of two other relevant structures: the homomorphic quasiorder of finite k-labeled trees, and of finite k-labeled trees with a fixed label of the root element.
机译:我们证明有限k标记的森林的同态拟矩形的k≥3具有不可透明的基本理论,与K = 2的已知可解锁结果相反。我们也建立了另外两种相关结构的基本理论的强药(再次≥3):有限k标记树木的同态拟矩形,以及具有根元素的固定标签的有限k标记的树木。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号