Related papers: Decidability of the HD0L ultimate periodicity prob…
We prove a relative decidability result for perfectoid fields. This applies to show that the fields $\mathbb{Q}_p(p^{1/p^{\infty}})$ and $\mathbb{Q}_p(\zeta_{p^{\infty}})$ are (existentially) decidable relative to the perfect hull of $…
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
In this paper, we consider the finite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.
We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
We prove that one variable equations in the lamplighter group $\MZ_2\wr \MZ$ are decidable and describe an algorithm for solving such equations. The algorithm has super-exponential time complexity in the worst case. We also show that, for…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
We show that the emptiness (unsatisfiability) problem is undecidable and $\mathrm{\Pi}^{0}_{1}$-complete for deterministic propositional while programs with (graph) loop. To this end, we introduce a hypothesis elimination using loops. Using…
For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
This paper formalize the existence's proof of first-integrals for any second order ODE, allowing to discriminate periodic orbits. Up to the author's knowledge, such a powerful result is not available in the literature providing a tool to…
We obtain a generalized Euler-Lagrange differential equation and transversality optimality conditions for Herglotz-type higher-order variational problems. Illustrative examples of the new results are given.
In this paper, we investigate periodic solutions of regime-switching jump diffusions. We first show the well-posedness of solutions to the SDEs corresponding to the hybrid system. Then, we derive the strong Feller property and…
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.
In this paper, we seek to explore under what conditions the periodicity of an entire function $ f(z) $ follows from the periodicity of a differential polynomial in $ f(z) $. We improve and generalize some earlier results and we give other…
We extend the piecewise orthogonal collocation method to computing periodic solutions of coupled renewal and delay differential equations. Through a rigorous error analysis, we prove convergence of the relevant finite-element method and…
We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors…