跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.35770 · v1

The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation

首次提交 2026-10-27 01:13
版本更新 2026-10-27 01:13
雷达观测 2026-10-29 00:35
arXiv ↗PDF ↗

摘要

The validity problem for first-order logic is a well-known undecidable problem. The undecidability also holds even for $\mathsf{FO}3$ and (equational formulas of) the calculus of relations. In this paper we tighten these undecidability results to the following: (1) $\mathsf{FO}3$ with just one binary relation is undecidable even without equality; and (2) the calculus of relations with just one character and with only composition, union, and complement is undecidable. Additionally we prove that the finite validity problem is also undecidable for the above two classes.

作者备注:Long version of the paper at ICLA'19, with (Ax.1) and (Ax.2) in Section 3 corrected

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-10-27 01:13 · 最新观测版本

The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation

The validity problem for first-order logic is a well-known undecidable problem. The undecidability also holds even for $\mathsf{FO}3$ and (equational formulas of) the calculus of relations. In this paper we tighten these undecidability results to the following: (1) $\mathsf{FO}3$ with just one binary relation is undecidable even without equality; and (2) the calculus of relations with just one character and with only composition, union, and complement is undecidable. Additionally we prove that the finite validity problem is also undecidable for the above two classes.

查看此版本解读 →查看此版本原文 ↗