Related papers: Width and size of regular resolution proofs
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…
In this paper we prove that for any definable subset $X\subset \mathbb{R}^{n}$ in a polynomially bounded o-minimal structure, with $dim(X)<n$, there is a finite set of regular projections (in the sense of Mostowski ). We give also a weak…
This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…
A brief overview of dimensional reductions for diffeomorphism invariant theories is given. The distinction between the physical idea of compactification and the mathematical problem of a consistent truncation is discussed, and the typical…
The fixed length Levenshtein (FLL) distance between two words $\mathbf{x,y} \in \mathbb{Z}_m^n$ is the smallest integer $t$ such that $\mathbf{x}$ can be transformed to $\mathbf{y}$ by $t$ insertions and $t$ deletions. The size of a ball in…
This paper is a companion to our prior paper arXiv:0705.4619 on the `Small Ball Inequality in All Dimensions.' In it, we address a more restrictive inequality, and obtain a non-trivial, explicit bound, using a single essential estimate from…
Typically, in order to obtain finite-size scaling laws for quantities in the microcanonical ensemble, an assumption is taken as a starting point. In this paper, consistency of such a Microcanonical Finite-Size Scaling Assumption with its…
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…
Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence, but most of all they are the counterparts of consistent knowledge bases in belief calculus. The use of consistent transformations cs[.]…
The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern recognition, and image processing. These applications have…
We review the status of low-scale string theories and large extra-dimensions. After an overview on different string realizations, we discuss some of the main important problems and we summarize present bounds on the size of possible…
By studying the volume of a generalized difference body, this paper presents the first nontrivial lower bound for the lattice covering density by $n$-dimensional simplices.
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
We introduce a continuous analog of the Fourier ratio for compactly supported Borel measures. For a measure \(\mu\) on \(\mathbb{R}^d\) and \(f\in L^2(\mu)\), the Fourier ratio compares \(L^1\) and \(L^2\) norms of a regularized Fourier…
A new large-cardinal property is introduced which enables one to give a relative consistency proof of restricted versions of the reflection principles discussed by Tait in his essay "Constructing Cardinals from Below".
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
This work studies the complexity of refuting the existence of a perfect matching in spectral expanders with an odd number of vertices, in the Polynomial Calculus (PC) and Sum of Squares (SoS) proof system. Austrin and Risse [SODA, 2021]…
This contribution to the debate on confidence limits focuses mostly on the case of measurements with `open likelihood', in the sense that it is defined in the text. I will show that, though a prior-free assessment of {\it confidence} is, in…
In this text, we wish to provide the reader with a short guide to recent works on the theory of dilatations in Commutative Algebra and Algebraic Geometry. These works fall naturally into two categories: one emphasises foundational and…