Related papers: Uniform Definability and Undecidability in Classes…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…
Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous…
When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…
Hyperuniformity refers to the suppression of density fluctuations at large scales. Typical for ordered systems, this property also emerges in several disordered physical and biological systems, where it is particularly relevant to…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We derive a family of necessary separability criteria for finite-dimensional systems based on inequalities for variances of observables. We show that every pure bipartite entangled state violates some of these inequalities. Furthermore, a…
We give the definition of uniform symmetric continuity for functions defined on a nonempty subset of the real line. Then we investigate the properties of uniformly symmetrically continuous functions and compare them with those of…
We use the uniform semiclassical approximation in order to derive the fidelity decay in the regime of large perturbations. Numerical computations are presented which agree with our theoretical predictions. Moreover, our theory allows to…
Can we train a system that, on any new input, either says "don't know" or makes a prediction that is guaranteed to be correct? We answer the question in the affirmative provided our model family is well-specified. Specifically, we introduce…