Related papers: Effective Disjunction and Effective Interpolation …
Document-level relation extraction (DocRE) aims to extract semantic relations among entity pairs in a document. Typical DocRE methods blindly take the full document as input, while a subset of the sentences in the document, noted as the…
We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation…
Based on the sampling theorem, interpolation should be conducted by employing the sinc functions as the kernels. Inspired by the fact that the discrete Fourier transform (DFT) is sampled from the discrete time Fourier transform, a fast…
In a series of recent publications of the author, three interpolation procedures, denoted IMPE, IMMPE, and ITEA, were proposed for vector-valued functions $F(z)$, where $F : \C \to\C^N$, and their algebraic properties were studied. The…
Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…
We show that the low-energy effective superpotential of an N=1 U(N) gauge theory with matter in the adjoint and arbitrary even tree-level superpotential has, in the classically unbroken case, the same functional form as the effective…
This article deals with the lower compactness property of a sequence of integrands and the use of this key notion in various domains: convergence theory, optimal control, non-smooth analysis. First about the interchange of the weak…
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…
We present a new on-shell method for the matching of ultraviolet models featuring massive states onto their massless effective field theory. We employ a dispersion relation in the space of complex momentum dilations to capture, in a single…
In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system $\mathbf{P}$ at least as strong as Full Lambek calculus, $\mathbf{FL}$, and polynomially simulated by the extended Frege…
Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics…
We establish strong Feller property and irreducibility for the transition semigroup associated to a class of nonlinear stochastic partial differential equations with multiplicative degenerate noise. As a by-product, we prove uniqueness of…
Discrete-event systems usually consist of discrete states and transitions between them caused by spontaneous occurrences of labelled (aka partially-observed) events. Due to the partially-observed feature, fundamental properties therein…
We show that every transformation is disjoint from almost every interval exchange transformation (IET), answering a question of Bufetov. In particular, we prove that almost every pair of IETs is disjoint. It follows that the product of…
It is nearly impossible to separate two interleaved phonebooks when held by their spines. A full understanding of this astonishing demonstration of solid friction in complex assemblies has remained elusive. In this Letter, we report on…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
Uniform interpolation property (UIP) is a strengthening of Craig interpolation property. It can be understood as the definability of propositional quantifiers. This paper develops the sequent calculi provided in Murai and Sano (2020),…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…