Related papers: Sem\"enov Arithmetic, Affine VASS, and String Cons…
We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that…
We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations. Although restricting to one type of operations yields decidability, little is known…
We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…
We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defined by a set of final states (i.e., the coverability…
We study cosmological solutions in the effective heterotic string theory with $\alpha'$-correction terms in string frame. It is pointed out that the effective theory has an ambiguity via field redefinition and we analyze generalized…
The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…
In this work, we introduce the notion of decisional width of a finite relational structure and the notion of decisional width of a regular class of finite structures. Our main result states that given a first-order formula {\psi} over a…
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 study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider the refinement verification problem for asynchronous…
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…
Consider the sequence $\mathcal{V}(2,n)$ constructed in a greedy fashion by setting $a_1 = 2$, $a_2 = n$ and defining $a_{m+1}$ as the smallest integer larger than $a_m$ that can be written as the sum of two (not necessarily distinct)…
This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…
The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…
We explore \emph{semibounded} expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We introduce the notion of a \emph{semibounded} expansion of an arbitrary ordered group, extending…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…