Related papers: Russell's typicality as another randomness notion

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

In this article, we prove a normality criterion for a family of meromorphic functions having zeros with some multiplicity which involves sharing of a holomorphic function by the members of the family. Our result generalizes Montel's…

We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…

Second order circularity, also called properness, for complex random variables is a well known and studied concept. In the case of quaternion random variables, some extensions have been proposed, leading to applications in quaternion signal…

Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…

We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order $2$, showing that the latter characterize the…

We offer a natural and extensible measure-theoretic treatment of missingness at random. Within the standard missing data framework, we give a novel characterisation of the observed data as a stopping-set sigma algebra. We demonstrate that…

We consider elliptic operators in divergence form with lower order terms of the form $Lu=-$div$\nabla u+bu)-c\nabla u-du$, in an open set $\Omega\subset \mathbb{R}^n$, $n\geq 3$, with possibly infinite Lebesgue measure. We assume that the…

We use the concept of a regular object with respect to another object in an arbitrary category, defined in \cite{dntd}, in order to obtain the transfer of regularity in the sense of Zelmanowitz between the categories $R-$mod and $S-$mod,…

A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…

We introduce a framework uniting algorithmic randomness with exchangeable credences to address foundational questions in philosophy of probability and philosophy of science. To demonstrate its power, we show how one might use the framework…

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…

This paper provides a short introduction to the notion of regular category and its use in categorical algebra. We first prove some of its basic properties, and consider some fundamental algebraic examples. We then analyse the algebraic…

Informally speaking, the categoricity of an axiom system means that its non-logical symbols have only one possible interpretation that renders the axioms true. Although non-categoricity has become ubiquitous in the second half of the 20th…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

In this paper we analyze the classical limit of the Nelson model with cut off, when both non-relativistic and relativistic particles number goes to infinity. We prove convergence of quantum observables to the solutions of classical…

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…