Related papers: Notes on the DPRM property for listable structures
We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of…
In a recent paper the authors classified differentiable structures on the non-Hausdorff one-dimensional manifold $\mathbb{L}$ called the line with two origins which is obtained by gluing two copies of the real line $\mathbb{R}$ via the…
Starting from the seventies mathematicians face the question whether a non-negative local martingale is a true or a strict local martingale. In this article we answer this question from a semimartingale perspective. We connect the…
In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…
We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…
We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
This is an article in mathematics, specifically in set theory. On the example of the Measure Recognition Problem (MRP) the article highlights the phenomenon of the utility of a multidisciplinary mathematical approach to a single…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…
We provide a pure algebraic version of the dynamical characterization of Conrad's property. This approach allows dealing with general group actions on totally ordered spaces. As an application, we give a new and somehow constructive proof…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…
Researchers develop models to explain the unknowns. These models typically involve parameters that capture tangible quantities, the estimation of which is desired. Parameter identifiability investigates the recoverability of the unknown…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…