相关论文: Models for short sequences of measures in the cofi…
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback (``adaptive circuits'') can evade such restrictions. We introduce three classes…
The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by…
Architectural imperatives due to the slowing of Moore's Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness.…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
We present several characterizations of uo-convergent nets or sequences in spaces of continuous functions $C(\Omega)$, $C_b(\Omega)$, $C_0(\Omega)$, and $C^\infty(\Omega)$, extending results of [vdW18]. In particular, it is shown that a…
We define a simple rule that allows to describe sequences of projective measurements for a broad class of generalized probabilistic models. This class embraces quantum mechanics and classical probability theory, but, for example, also the…
Capacitary measures form a class of measures that vanish on sets of capacity zero. These measures are compact with respect to so-called $\gamma$-convergence, which relates a sequence of measures to the sequence of solutions of relaxed…
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…
We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…
We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
We investigate when the categories of all rational $A$-modules and of finite dimensional rational modules are closed under extensions inside the category of $C^*$-modules, where $C^*$ is the cofinite topological completion of $A$. We give a…
We study an influence of the continuous measurement in a composite quantum system C on the evolution of the states of its parts. It is shown that the character of the evolution (decoherence or recoherence) depends on the type of the…
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…
Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…
Motivated by deformation quantization, we introduced in an earlier work the notion of formal Morita equivalence in the category of $^*$-algebras over a ring $\ring C$ which is the quadratic extension by $\im$ of an ordered ring $\ring R$.…
The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…
In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when…
Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…
This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…