Related papers: Contraction Elimination in Sequent Based Ground Eq…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…
It is argued that once we consider the underpinning of a Non Commutative geometry, itself symptomatic of extended particles, for example in Quantum Superstring theory, then a reconciliation between gravitation and electromagnetism is…
Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…
Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar…
We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…
We present a sequent calculus system for a modal reformulation of a system of nonmonotonic logic due to McCain and Turner: we prove cut elimination for our system. The proof system is in general infinitary: because we can prove cut…
Curvature squared terms are added to a consistent formulation of supergravity on manifolds with boundary which is meant to represent the low energy limit of the strongly coupled heterotic string. These terms are necessary for the…
We define base-extension semantics (Bes) using atomic systems based on sequent calculus rather than natural deduction. While traditional Bes aligns naturally with intuitionistic logic due to its constructive foundations, we show that…
In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This…
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…
We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
In this work we introduce notions in Auslander-Buchweitz theory and cotorsion theory in extriangulated categories which extend the given ones for abelian categories. Although these notions have been already developed for extriangulated…
The recent "breakdown criterion" result of S. Klainerman and I. Rodnianski stated roughly that an Einstein-vacuum spacetime, given as a CMC foliation, can be further extended in time if the second fundamental form and the derivative of the…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
The Lambek calculus provides a foundation for categorial grammar in the form of a logic of concatenation. But natural language is characterized by dependencies which may also be discontinuous. In this paper we introduce the displacement…
We identify the correct power counting of all the variables in the low-$q^2$ window of the inclusive decay $\bar B \to X_s \ell^+\ell^-$ within the effective theory SCET if a hadronic mass cut is imposed. Furthermore we analyse the resolved…
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…