Related papers: Russell's typicality as another randomness notion
Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…
A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…
It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
The generalized test ideals introduced in [HY] are related to multiplier ideals via reduction to characteristic p. In addition, they satisfy many of the subtle properties of the multiplier ideals, which in characteristic zero follow via…
We define the concept of a regular object with respect to another object in an arbitrary category. We present basic properties of regular objects and we study this concept in the special cases of abelian categories and locally finitely…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…
Different and distinct notions of regularity for modules exist in the literature. When these notions are restricted to commutative rings, they all coincide with the well-known von-Neumann regularity for rings. We give new characterizations…
Relative realizability toposes satisfy a universal property that involves regular functors to other categories. We use this universal property to define what relative realizability categories are, when based on other categories than of the…
The notion of probability plays a crucial role in quantum mechanics. It appears in quantum mechanics as the Born rule. In modern mathematics which describes quantum mechanics, however, probability theory means nothing other than measure…
The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…
The concept of typicality refers to properties holding for the "overwhelming majority" of cases and is a fundamental idea of the qualitative approach to dynamical problems. We argue that measure-theoretical typicality would be the adequate…
A new definition of random sets is proposed. It is based on the distance in measurable space and uses negative definite kernels for continuation from initial space to that of random sets. This approach has no connection to Hausdorff…
We introduce and investigate a class of ring ideals, termed ring $\mathrm{M}$-ideals, inspired by the Alfsen--Effros theory of $\mathrm{M}$-ideals in Banach spaces. We show that $\mathrm{M}$-ideals extend the classical notion of essential…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…