paperbot · PL 论文追踪

RSS

Decidability of extensions of Presburger arithmetic by generalised polynomials

LMCS vol.Volume 21, Issue 42025
Jakub Konieczny

尚未生成 AI 速览(可能缺少 API key 或等待下次运行补跑)。

原文摘要(Abstract)

We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.

链接与引用

DOI 原文 ·

BibTeX
@article{paperbot3367,
  title = {Decidability of extensions of Presburger arithmetic by generalised polynomials},
  author = {Jakub Konieczny},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 21, Issue 4},
  year = {2025},
  doi = {10.46298/lmcs-21(4:1)2025}
}