Related papers: The First Order Truth behind Undecidability of Reg…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
The authors of the recent paper [Phys. Rev. A 90, 032104 (2014)] claim to have established a time continuous formulation of path integration in the CS basis free from the mentioned inconsistency. Since a few recent investigations consider…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
Two results are presented concerning the entailment problem in Separation Logic with inductively defined predicate symbols and theory reasoning. First, we show that the entailment problem is undecidable for rules with bounded tree-width, if…
We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…
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…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
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…
It is proved that flatness of an analytic mapping germ from a complete intersection is determined by its sufficiently high jet. As a consequence, one obtains finite determinacy of complete intersections. It is also shown that flatness and…
For $\alpha\in (0,1)$, we consider stochastic differential equations driven by one-sided stable processes of order $\alpha$: \[dX_t= \phi(X_{t-})\ dZ_t.\] We prove that pathwise uniqueness holds for this equation under the assumptions that…
$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference…
We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path…
Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such…
In this note we give a negative answer to Abraham Robinson's question whether a finitely generated extension of an undecidable field is always undecidable. We construct 'natural' undecidable fields of transcendence degree 1 over Q all of…
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…
Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…
A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…
We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…