Related papers: Notes on the DPRM property for listable structures

Argumentation is a promising model for reasoning with uncertain knowledge. The key concept of acceptability enables to differentiate arguments and counterarguments: The certainty of a proposition can then be evaluated through the most…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…

A list $\Lambda =\{\lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers (repeats allowed) is said to be \textit{realizable} if it is the spectrum of an entrywise nonnegative matrix $A$. $\Lambda $ is \textit{diagonalizably realizable} if…

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

For any countable group $\Gamma$ satisfying the ``weak Rohlin property'', and for any dynamical property, the set of $\Gamma$-actions with that property is either residual or meager. The class of groups with the weak Rohlin property…

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

The modeling framework of port-Hamiltonian systems is systematically extended to constrained dynamical systems (descriptor systems, differential-algebraic equations). A new algebraically and geometrically defined system structure is…

This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…

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…

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…

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

Structural identifiability is an important property of parametric ODE models. When conducting an experiment and inferring the parameter value from the time-series data, we want to know if the value is globally, locally, or non-identifiable.…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…