arXiv math/05111532005-11-07math.LOmath.AG

The Hurwitz Equivalence Problem is Undecidable

E. Liberman, M. Teicher

英文摘要：

In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in $F_2 \oplus F_2$ is undecidable, and as a consequence, the Hurwitz equivalence problem for $Δ^2$-factorizations in the braid groups $B_n, n\geq 5$ is also undecidable.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

莫利关于可数模型个数定理的一个不可判定扩张

An undecidable extension of Morley's theorem on the number of countable models

本文证明莫利关于可数一阶理论可数模型个数的定理在二阶逻辑扩张下不可判定，并在多个集合论模型中计算σ-射影等价关系的等价类个数，方法涉及随机力迫、科恩力迫、伍丁基数与内模型理论。

2023-07-05math.LO

良结构程序等价性是高度不可判定的

Well structured program equivalence is highly undecidable

本研究解决了《斯坦福哲学百科全书》中的相关问题，证明带交的严格确定性命题动态逻辑高度不可判定，且能表达良结构程序与空程序skip等价性的命题动态逻辑变体的有效性问题是Π₁¹-难的，有限模型有效命题集也非递归可枚举、无公理化系统。

2011-03-08cs.LOmath.LO

具有两个等价关系的二变量一阶逻辑的插值存在性不可判定

Interpolant Existence is Undecidable for Two-Variable First-Order Logic with Two Equivalence Relations

本文首次证明一阶逻辑可判定片段中插值存在性问题不可判定，具体包括具有两个等价关系的二变量片段及其有保护扩展，并确定了相应的布尔描述逻辑情形。

2024-04-03cs.LOmath.LO

有限非确定性逻辑矩阵的等价性是不可判定的

Equivalence of finite non-deterministic logical matrices is undecidable

本文证明判定两个有限非确定性逻辑矩阵是否等价（诱导相同逻辑）的问题不可判定，并给出了可行的充分条件与特定情形。

2024-12-18cs.LOmath.LO

Highly Undecidable Problems For Infinite Computations

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $Π_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable". In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all $Π_2^1$-complete for context-free omega-languages or for infinitary rational relations. Topological and arithmetical properties of 1-counter omega-languages, c…

2009-01-04cs.CCcs.LOmath.LO

Highly Undecidable Problems about Recognizability by Tiling Systems

Altenbernd, Thomas and Wöhrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the Büchi and Muller ones [1]. It was proved in [9] that it is undecidable whether a Büchi-recognizable language of infinite pictures is E-recognizable (respectively, A-recognizable). We show here that these two decision problems are actually $Π_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable". We give the exact degree of numerous other undecidable pro…

2008-11-22cs.CCcs.LOmath.LO

更多相关论文收起更多论文

半自由微分格代数的不可判定问题

Undecidability problems for semifree DG algebras

Stanford University（斯坦福大学）；University of Toronto（多伦多大学）

研究半自由非交换微分格代数的稳定 tame 同构、准同构及导出 Morita 等价问题，证明其不可判定，解决低维拓扑中的 K3 问题列表中的问题5.16。

2026-04-28math.GTmath.LOmath.RA