Related papers: Inclusion-exclusion by ordering-free cancellation
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually…
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…
We investigate a cancellation property satisfied by a connected Eulerian digraph $D$. Namely, unless $D$ is a single directed cycle, we have $\sum_{k\geq 1} (-1)^{k} f_k(D)=0$, where $f_k(D)$ is the number of partitions of Eulerian circuits…
In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
We reconsider the Adler-Bardeen theorem for the cancellation of gauge anomalies to all orders, when they vanish at one loop. Using the Batalin-Vilkovisky formalism and combining the dimensional-regularization technique with the…
A hypothetical exclusion principle for quantum particles is introduced that generalizes the exclusion and inclusion principles for fermions and bosons, respectively: the correlated exclusion principle. The sum-free condition for Schur…
This paper, following (Dymetman:1998), presents an approach to grammar description and processing based on the geometry of cancellation diagrams, a concept which plays a central role in combinatorial group theory (Lyndon-Schuppe:1977). The…
We give a new formula for the rotation number (or Whitney index) of a smooth closed plane curve. This formula is obtained from the winding numbers associated with the regions and the crossing points of the curve. One difference with the…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…
The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
A recent result of Alon, Ben-Eliezer and Fischer establishes an induced removal lemma for ordered graphs. That is, if $F$ is an ordered graph and $\varepsilon>0$, then there exists $\delta_{F}(\varepsilon)>0$ such that every $n$-vertex…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs,…
The main contribution of this paper is the development of a new decision tree algorithm. The proposed approach allows users to guide the algorithm through the data partitioning process. We believe this feature has many applications but in…
Probabilistic inference algorithms for finding the most probable explanation, the maximum aposteriori hypothesis, and the maximum expected utility and for updating belief are reformulated as an elimination--type algorithm called bucket…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…