Related papers: A constructive Borel-Cantelli Lemma. Constructing …

This is a leisurely introductory account addressed to non-experts and based on previous work by the authors, on how methods borrowed from physics can be used to "count" an infinite number of points. We begin with the classical case of…

We introduce a measure of coherence, which is extended from the coherence rank via the standard convex roof construction, we call it the logarithmic coherence number. This approach is parallel to the Schmidt measure in entanglement theory,…

An error in the proof of Lemma 2 (ii) in [I. Werner, Math. Proc. Camb. Phil. Soc. 140(2) 333-347 (2006)], which claims the absolute continuity of dynamically defined measures (DDM), is identified. This undermines the assertion of the…

No physical measurement can be performed with infinite precision. This leaves a loophole in the standard no-go arguments against non-contextual hidden variables. All such arguments rely on choosing special sets of quantum-mechanical…

I investigate the problem of finding a statistical description of a complex many-body system whose invariant measure cannot be constructed stemming from classical thermodynamics ensembles. By taking solitons as a reference system and by…

For any transitive piecewise monotonic map for which the set of periodic measures is dense in the set of ergodic invariant measures (such as monotonic mod one transformations and piecewise monotonic maps with two monotonic pieces), we show…

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

We use a Poisson point process approach to prove distributional convergence to a stable law for non square-integrable observables $\phi: [0,1]\to R$, mostly of the form $\phi (x) = d(x,x_0)^{-\frac{1}{\alpha}}$,$0<\alpha\le 2$, on…

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account…

Let f be a polynomial or a rational function which has r summable critical points. We prove that there exists an r-dimensional manifold in an appropriate space containing f such that for every smooth curve in it through f, the ratio between…

In this paper we investigate the foundations for analysis in infinitely-many (independent) variables. We give a topological approach to the construction of the regular $\s$-finite Kirtadze-Pantsulaia measure on $\R^\iy$ (the usual…

This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…

In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…

The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…

Bell's theorem is supposed to exclude all local hidden-variable models of quantum correlations. However, an explicit counterexample shows that a new class of local realistic models, based on generalized arithmetic and calculus, can exactly…