Related papers: Implementing Anti-Unification Modulo Equational Th…
We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework…
We construct natural representations of the Connes-Kreimer Lie algebras on rooted trees/Feynman graphs arising from Hecke correspondences in the categories $\LRF, \LFG$ constructed by K. Kremnizer and the author. We thus obtain the…
We construct positive-genus analogues of Welschinger's invariants for many real symplectic manifolds, including the odd-dimensional projective spaces and the renowned quintic threefold. In some cases, our invariants provide lower bounds for…
We present a unified framework that fully represents electromagnetic potentials, fields, and sources in vacuum, based on a reinterpretation of the classical Hertz-potential formalism. In this construction, $\phi$, $A$, $E$, $B$, $\rho$, and…
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of…
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations…
This article addresses a number of issues associated with the problem of calculating contributions from the electromagnetic quantum induced energy and stress in a stationary material with an inhomogeneous polarizability. After briefly…
We develop a matricial version of Rieffel's Gromov-Hausdorff distance for compact quantum metric spaces within the setting of operator systems and unital C*-algebras. Our approach yields a metric space of ``isometric'' unital complete order…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
Type checking algorithms and theorem provers rely on unification algorithms. In presence of type families or higher-order logic, higher-order (pre)unification (HOU) is required. Many HOU algorithms are expressed in terms of…
This paper is part of the general project of proof mining, developed by Kohlenbach. By "proof mining" we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs.…
The Landau-Ginzburg/Conformal Field Theory correspondence predicts tensor equivalences between categories of matrix factorisations of certain polynomials and categories associated to the $N=2$ supersymmetric conformal field theories. We…
We prove a "quantified" version of the Weyl-von Neumann theorem, more precisely, we estimate the ranks of approximants to compact operators appearing in the Voiculescu's theorem applied to commutative algebras. This allows considerable…
Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…
There is considerable current interest in applications of generalised Lie algebras graded by an abelian group $\Gamma$ with a commutative factor $\omega$. This calls for a systematic development of the theory of such algebraic structures.…
We present our library for Universal Algebra in the UniMath framework dealing with multi-sorted signatures, their algebras, and the basics for equation systems. We show how to implement term algebras over a signature without resorting to…
Pretrained (language) embeddings are versatile, task-agnostic feature representations of entities, like words, that are central to many machine learning applications. These representations can be enriched through retrofitting, a class of…
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…
In this article we give new examples of models in boundary quantum field theory, i.e. local time-translation covariant nets of von Neumann algebras, using a recent construction of Longo and Witten, which uses a local conformal net A on the…
We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and…