Related papers: A note on the differences of computably enumerable…
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in $SCL^{rp}$ and $SCL^{rp}$ is…
Let $X$ be a set of cardinality $\kappa$ such that $\kappa^\omega=\kappa$. We prove that the linear algebra $\mathbb{R}^X$ (or $\mathbb{C}^X$) contains a free linear algebra with $2^\kappa$ generators. Using this, we prove several…
SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in…
HMC sets are hereditarily at most countable sets. We rework a substantial part of univariate real analysis in a form in which only HMC real functions are used. In such countable real analysis we carry out Hilbert's proof of transcendence of…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\beta$-models:…
We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…
We establish that the Lie algebra of weight one states in a (strongly) rational vertex operator algebra is reductive, and that its Lie rank is bounded above by the effective central charge. We show that lattice vertex operator algebras may…
Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…
The Karcher mean on the cone $\Omega$ of invertible positive elements of the $C^*$-algebra $\mathcal{B}(E)$ of bounded operators on a Hilbert space $E$ has recently been extended to a contractive barycentric map on the space of $L^1$-…
We prove some statements of left- and right-continuous variants of generalized inverses of non-decreasing real functions.
We prove a central limit theorem for the logarithm of the characteristic polynomial of random Jacobi matrices. Our results cover the G$\beta$E models for $\beta>0$.
Both, Bayes Theorem and the cMPE-Method serve for establishing relations between systems of probabilities. By the cMPE-Method non-conditional probabilities are added, by the DPE-Method, they are subtracted, however, in both versions…
Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every…
We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…