相关论文: Nonlinear Arithmetic with SMTLIB Division is Undec…

For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…

Let $R$ be a commutative integral unital domain and $L$ a free non-commutative Lie algebra over $R$. In this paper we show that the ring $R$ and its action on $L$ are 0-interpretable in $L$, viewed as a ring with the standard ring language…

First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding constraints in SMT theory solvers is highly relevant. We propose…

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…

The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…

Basic arithmetic is the cornerstone of mathematics and computer sciences. In arithmetic, 'division by zero' is an undefined operation and any attempt at extending logic for algebraic division to incorporate division by zero has resulted in…

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

Disjunctive Linear Arithmetic (DLA) is a major decidable theory that is supported by almost all existing theorem provers. The theory consists of Boolean combinations of predicates of the form $\Sigma_{j=1}^{n}a_j\cdot x_j \le b$, where the…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We show that the ring of integers of $\mathbb{Q}^{\text{tr}}$ is existentially definable in the ring of integers of $\mathbb{Q}^{\text{tr}}(i)$, where $\mathbb{Q}^{\text{tr}}$ denotes the field of all totally real numbers. This implies that…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…