Related papers: Symmetric Iterations with Countable and $<\kappa$-…

We propose a sequential topology on the space of sub-$\sigma$-algebras of a separable probability space $(\Omega,\mathcal{F},\mathbb{P})$ by linking conditional expectations on $L^{2}$ along sequences of sub-$\sigma$-algebras. The varying…

For an inaccessible cardinal $\kappa$, the super tree property (ITP) at $\kappa$ holds if and only if $\kappa$ is supercomact. However, just like the tree property, it can hold at successor cardinals. We show that ITP holds at the successor…

We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].

In this paper we prove that if $\kappa$ is a singular cardinal with uncountable cofinality, then every power of a given topological space with precaliber $\kappa$ has precaliber $\kappa$ as well. Furthermore, if $\{X_\alpha :…

Reliable uncertainty quantification is crucial for the trustworthiness of machine learning applications. Inductive Conformal Prediction (ICP) offers a distribution-free framework for generating prediction sets or intervals with…

Assuming the existence of a strong cardinal $\kappa$, a weakly compact cardinal $\lambda$ above it and $\gamma > \lambda,$ we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any given cofinality $\delta$,…

We propose $\omega$MSO$\Join$BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that…

We consider parametric families of partial differential equations--PDEs where the parameter $\kappa$ modifies only the (1,1) block of a saddle point matrix product of a discretization below. The main goal is to develop an algorithm that…

We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

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…

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

We propose improved fixed-design confidence bounds for the linear logistic model. Our bounds significantly improve upon the state-of-the-art bound by Li et al. (2017) via recent developments of the self-concordant analysis of the logistic…

In its customary formulation for one-component fluids, the Hierarchical Reference Theory yields a quasilinear partial differential equation for an auxiliary quantity f that can be solved even arbitrarily close to the critical point,…

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,…

The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, we study a class of toposes with enough points, the $\kappa$-separable toposes. These are equivalent to sheaf toposes over a site with $\kappa$-small limits that has at…

Nonuniform families of polynomial-size finite automata and pushdown automata respectively have strong connections to nonuniform-NL and nonuniform-LOGCFL. We examine the behaviors of unambiguous and co-nondeterministic computations produced…

In this paper we introduce an iterative Jacobi algorithm for solving distributed model predictive control (DMPC) problems, with linear coupled dynamics and convex coupled constraints. The algorithm guarantees stability and persistent…