Related papers: Evitable iterates of the consistency operator
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
Autonomous morphology, such as inflection class systems and paradigmatic distribution patterns, is widespread and diachronically resilient in natural language. Why this should be so has remained unclear given that autonomous morphology…
Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…
A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations…
The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…
We show that (for the weak operator topology) the set of unitary operators on a separable infinite-dimensional Hilbert space is residual in the set of all contractions. The analogous result holds for isometries and the strong operator…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…
Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…
A sequence of operators $T_n$ from a Hilbert space ${\mathfrak H}$ to Hilbert spaces ${\mathfrak K}_n$ which is nondecreasing in the sense of contractive domination is shown to have a limit which is still a linear operator $T$ from…
The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…
Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…
Let No be Conway's class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some "tameness" and uniformity condition, f must satisfy some interesting…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
We consider general linear non-degenerate weakly-coupled cooperative elliptic systems and study certain monotonicity properties of the generalized principal eigenvalue in $\mathbb{R}^d$ with respect to the potential. It is shown that…
For a random walk killed at leaving a cone we suggest two new constructions of a positive harmonic function. These constructions allow one to remove a quite strong extendability assumption, which has been imposed in our previous paper…