Related papers: Tracking chains revisited

In the present paper we prove a duality theory for compact groups in the case when the C*-algebra A, the fixed point algebra of the corresponding Hilbert C*-system (F,G), has a nontrivial center Z and the relative commutant satisfies the…

We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…

We introduce the first cut-free nested sequent systems for first-order modal logics that admit increasing, decreasing, constant, and empty domains along with so-called general path conditions and seriality. We obtain such systems by means…

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…

This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…

In the 1970s Alain Connes identified the appropriate notion of amenabilty for von Neumann algebras, and used it to obtain a deep internal finite dimensional approximation structure for these algebras. This structure is exactly what is…

Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…

A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…

We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…

In the first part of the paper we describe the dual \ell^2(A)^{\prime} of the standard Hilbert C*-module \ell^2(A) over an arbitrary (not necessarily unital) C*-algebra A. When A is a von Neumann algebra, this enables us to construct…

Let $E \subset \C$ be a Borel set with finite length, that is, $0<\mathcal{H}^1 (E)<\infty$. By a theorem of David and L\'eger, the $L^2 (\mathcal{H}^1 \lfloor E)$-boundedness of the singular integral associated to the Cauchy kernel (or…

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Over the years a number of topologies for the set of laws of stochastic processes have been proposed. Building on the weak topology they all aim to capture more accurately the temporal structure of the processes. In a parallel paper we show…

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

We define well-connectedness, an order-theoretic notion of largeness whose associated partition relations $\nu\to_{wc}(\mu)_\lambda^2$ formally weaken those of the classical Ramsey relations $\nu\to(\mu)_\lambda^2$. We show that it is…

In earlier work, my colleagues and I developed a formalism for using information theory to understand scales of organization and structure in multi-component systems. One prominent theme of that work was that the structure of a system…

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…