加载中…
We study the extension of Presburger arithmetic by the class of sub-polynomial Hardy field functions, and show the majority of these extensions to be undecidable. More precisely, we show that the theory , where is a Hardy field function and the nearest integer operator, is undecidable when grows polynomially faster than . Further, we show that when grows sub-linearly quickly, but still as fast as some polynomial, the theory is undecidable.

生成讲解博客的中文版本

生成AI智能校验的中文版本