Related papers: Combinatorial principles equivalent to weak induct…

We establish a framework for weak and strong convergence of matrix models to operator-valued semicircular systems parametrized by operator-valued covariance matrices $\eta = (\eta_{i,j})_{i,j \in I}$. Non-commutative polynomials are…

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…

We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…

We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ and over $RCA_0 + B\Sigma^0_n$ for all $n \geq 2$ by recursion-theoretic means. We first characterize COH over $RCA_0 + B\Sigma^0_2$ as a…

In this paper, we give characterizations of Towsner's relative leftmost path principles in terms of omega-model reflections of transfinite inductions. In particular, we show that the omega-model reflection of $\Pi^1_{n+1}$ transfinite…

We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…

We study cyclic proof systems for $\mu\mathsf{PA}$, an extension of Peano arithmetic by positive inductive definitions that is arithmetically equivalent to the (impredicative) subsystem of second-order arithmetic $\Pi^1_2$-$\mathsf{CA}_0$…

We construct an $\ll^2$-solution (also known as a weakly low solution) to ${\mathrm{D}^2}$ within ${\mathrm{B}\Sigma^0_{3}}$ and prove the $\ll^2$-basis theorem for $\mathrm{RT}^2$ over ${\mathrm{B}\Sigma^0_{3}}$. The $\ll^2$-basis theorem…

Scalar and vector interactions, with the scalar interaction coupled to a composite spin-1/2 system so as to cause a shift of its mass, are shown to obey a low-energy theorem which guarantees that the second order interaction due to z-graphs…

We present a theoretical framework and implementation details for self-energy embedding theory (SEET) with the GW approximation for the treatment of weakly correlated degrees of freedom and configuration interactions solver for handing the…

We propose a new framework combining weak measurement and second-order correlated technique. The theoretical analysis shows that WVA experiment can also be implemented by a second-order correlated system. We then build two-dimensional…

We study the order theoretic properties of relative weak injectivity, w.r.i., in short, in the category of C*-algebras. We prove that Arveson's extension theorem, with additional order assumption on the morphisms, is tightly connected with…

We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $\Pi^1_1$-${\sf CA}_0$, a strong theory of second-order arithmetic, while natural…

In this paper we prove that given a weakly almost periodic measure $\mu$ supported inside some model set $\Lambda(W)$ with closed window $W$, then the strongly almost periodic component $\mu_S$ and the null weakly almost periodic component…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…

Confounding is a significant obstacle to unbiased estimation of causal effects from observational data. For settings with high-dimensional covariates -- such as text data, genomics, or the behavioral social sciences -- researchers have…

We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

We study consequences of stationary and semi-stationary set reflection. We show that the semi stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal…