Related papers: Uniformization and Internal Absoluteness

An a priori semimeasure (also known as "algorithmic probability" or "the Solomonoff prior" in the context of inductive inference) is defined as the transformation, by a given universal monotone Turing machine, of the uniform measure on the…

We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…

We give a survey of the known connections between regularity conditions and amenability conditions in the setting of uniform algebras. For a uniform algebra $A$ we consider the set, $A_{lc}$, of functions in $A$ which are locally constant…

In this article we introduce a dual of the uniform boundedness principle which does not require completeness and gives an indirect means for testing the boundedness of a set. The dual principle, although known to the analyst and despite its…

The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous…

Let $E$ be a Moran set on $\mathbb{R}^1$ associated with a closed interval $J$ and two sequences $(n_k)_{k=1}^\infty$ and $(\mathcal{C}_k=(c_{k,j})_{j=1}^{n_k})_{k\geq1}$. Let $\mu$ be the infinite product measure (Moran measure) on $E$…

There has been much discussion recently about how fairness should be measured or enforced in classification. Individual Fairness [Dwork, Hardt, Pitassi, Reingold, Zemel, 2012], which requires that similar individuals be treated similarly,…

We study the connectedness property of the spectrum of forcing algebras over a noetherian ring. In particular we present for an integral base ring a geometric criterion for connectedness in terms of horizontal and vertical components of the…

While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…

We show that, on any given finite Borel measure space with the ambient space being a Polish metric space, every Borel real-valued function is almost a bounded, uniformly continuous function in the sense that for every $\varepsilon > 0$…

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…

We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…

This paper makes the following original contributions. First, we develop a unifying framework for testing shape restrictions based on the Wald principle. The test has asymptotic uniform size control and is uniformly consistent. Second, we…

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

One fundamental goal in any learning algorithm is to mitigate its risk for overfitting. Mathematically, this requires that the learning algorithm enjoys a small generalization risk, which is defined either in expectation or in probability.…

Using a countable support product of creature forcing posets, we show that consistently, for uncountably many different functions the associated Yorioka ideals' uniformity numbers can be pairwise different. In addition we show that, in the…

In this paper we establish a Besicovitch-Federer type projection theorem for general measures. Specifically, let $\mu$ be a finite Borel measure on $\mathbb{R}^n$ and let $0 < m < n$ be an integer. We show that, under the sole assumption…