Related papers: Constructive validity of a generalized Kreisel-Put…
Since the Connes--Kreimer Hopf algebra was proposed, revisiting present quantum field theory has become meaningful and important from algebraic points. In this paper, the Hopf algebra in the cutting rules is constructed. Its coproduct…
A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive…
A basic postulate of modern compositional approaches to generalised physical theories is the generalised Born rule, in which probabilities are postulated to be computable from the composition of states and effects. In this paper we consider…
Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus. More recently, a…
Modifying the standard approaches to nonperturbative QCD based on Borel-transformed dispersive sum rules by allowing the effective continuum thresholds required for the implementation of quark-hadron duality to depend on the Borel…
The Drell-Hearn-Gerasimov and Bjorken sum rules are special examples of dispersive sum rules for the spin-dependent structure function G_1(\nu, Q^2) at Q^2=0 and \infty. We generalize these sum rules through studying the virtual-photon…
A generalized Hitchin equation was proposed as the BPS equation for a large class of four dimensional N=1 theories engineered using M5 branes. In this paper, we show how to write down the spectral curve for the moduli space of generalized…
We introduce Probabilistic Dependent Type Systems (PDTS) via a functional language based on a subsystem of intuitionistic type theory including dependent sums and products, which is expanded to include stochastic functions. We provide a…
Recently, Lloyd and Montangero have made a brief research proposal on universal quantum computation in integrable systems. The main idea is to encode qubits into quantum action variables and build up quantum gates by the method of resonant…
Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…
Clustering serves as a vital tool for uncovering latent data structures, and achieving both high accuracy and interpretability is essential. To this end, existing methods typically construct binary decision trees by solving mixed-integer…
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of…
CHR is a declarative, concurrent and committed choice rule-based constraint programming language. We extend CHR with multiset comprehension patterns, providing the programmer with the ability to write multiset rewriting rules that can match…
In this paper we examine the natural interpretation of a ramified type hierarchy into Martin-L\"of type theory with an infinite sequence of universes. It is shown that under this predicative interpretation some useful special cases of…
Starting from the ELSV formula, we derive a number of new equations on the generating functions for Hodge integrals over the moduli space of complex curves. This gives a new simple and uniform treatment of certain known results on Hodge…
In this paper we continue to study so called ``inverse Born's rule problem'': to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born's rule. The corresponding algorithm --…
In this short note we record the fact that the set of multiplicative HKR natural equivalences defined simultaneously for all derived schemes, functorialy splitting the HKR-filtration and rendering the circle action compatible with the de…
Borel transformed QCD sum rules conventionally use a real valued parameter (the Borel mass) for specifying the exponential weight over which hadronic spectral functions are averaged. In this paper, it is shown that the Borel mass can be…
Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical…
We propose a probabilistic Hoare logic aHL based on the union bound, a tool from basic probability theory. While the union bound is simple, it is an extremely common tool for analyzing randomized algorithms. In formal verification terms,…