Related papers: Combinatorial principles equivalent to weak induct…
Craig's interpolation theorem (Craig 1957) is an important theorem known for propositional logic and first-order logic. It says that if a logical formula $\beta$ logically follows from a formula $\alpha$, then there is a formula $\gamma$,…
The concept of a relatively weakly injective pair of operator systems is introduced and studied in this paper, motivated by relative weak injectivity in the C*-algebra category. E. Kirchberg \cite{Kr} proved that the C*-algebra…
We investigate the notion of relative weak injectivity and its nuclearity related properties in the category of operator systems. We obtain several characterizations of the weak expectation property. We show that (c,max)-nuclearity…
Calculations of collinear correlation functions in perturbative QCD and Soft-Collinear Effective Theory (SCET) require a prescription for subtracting soft or zero-bin contributions in order to avoid double counting the contributions from…
We define a hierarchy of circuit complexity classes LD^i, whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction and construct a bounded arithmetic theory L^i_2 whose…
We introduce an equivariant version of the weak expectation property (WEP) at the level of operator modules over completely contractive Banach algebras $A$. We prove a number of general results---for example, a characterization of the…
We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
Extremal principles can generally be divided into two rather distinct classes. There are, on the one hand side, formulations based on the Lagrangian or Hamiltonian mechanics, respectively, dealing with time dependent problems, but…
The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…
We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
We describe a Galilean test of the weak equivalence principle, to be conducted during the free fall portion of a sounding rocket flight. The test of a single pair of substances is aimed at a measurement uncertainty of sigma(eta) < 10^-16…
We consider the physical combinatorics of critical lattice models and their associated conformal field theories arising in the continuum scaling limit. As examples, we consider A-type unitary minimal models and the level-1 sl(2)…
The raising of both indices in the components of the Minkowski electromagnetic field strength 2-form to give the components of the electromagnetic excitation bivector field can be regarded as being equivalent to an electromagnetic…
By using Laplace's method for double integrals and the so-called beam condition obeyed by a partially coherent beamlike light field, we report the equivalence theory (ET) of partially coherent beams on scattering for the first time. We…
We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system $P$, we prove that the following statements are equivalent, 1.…
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…
Based upon our recent study on the intrinsic connection between the longitudinal weak-boson scatterings and probing the electroweak symmetry breaking (EWSB) mechanism, we reveal the profound physical content of the Equivalence Theorem (ET)…
We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the…