Results 41 to 50 of about 1,862,843 (333)
One loop mass renormalization of massive states using pure spinor formalism
As a check of the first massive integrated vertex operator in the pure spinor formalism constructed in arXiv:1802.04486 , we compute the one loop 2-point function of the stable non BPS massive states in SO(32) heterotic string theory.
Sitender Pratap Kashyap, Mritunjay Verma
doaj +1 more source
Redundancy Elimination and Loop Checks for Logic Programs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FERRUCCI, Filomena +2 more
openaire +3 more sources
Two loop detection mechanisms: a comparison [PDF]
In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
D. Sahlin, J.-Y. Girard, R. Dyckhoff
core +4 more sources
Method of marks for propositional linear temporal logic
It is known that traditional techniques used to ensure termination of a decision procedure in non-classical logics are based on loop-checking, in general.
Regimantas Pliuškevičius
doaj +1 more source
Evidence for the Strongest Version of the 4d a-Theorem, via a-Maximization Along RG Flows [PDF]
In earlier work, we (KI and BW) gave a two line "almost proof" (for supersymmetric RG flows) of the weakest form of the conjectured 4d a-theorem, that a_{IR}
Anselmi +38 more
core +3 more sources
Cut, invariant rule, and loop-check free sequent calculus for PLTL
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional linear temporal logic (PLTL) with temporal operators “next” and “always”.
Romas Alonderis +1 more
doaj +1 more source
We present a two-loop calculation of the supersymmetric circular Wilson loop in the N $$ \mathcal{N} $$ = 2* super Yang-Mills theory on the four-sphere. We develop an efficient framework for computing contributing Feynman graphs that relies on using the ...
A. V. Belitsky, G. P. Korchemsky
doaj +1 more source
Restrictions for loop-check in sequent calculus for temporal logic with until operator
In this paper, we present sequent calculus for branching-time temporal logic with until operator. This sequent calculus uses efficient loop-checktechinque.
Adomas Birštunas
doaj +1 more source
Restrictions for loop-check in sequent calculus for temporal logic
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses efficient loop-check techinque. We prove that we can use not all but only several special sequents from the derivation tree for the loop-check.
Adomas Birštunas
doaj +1 more source
Loop checks for logic programs with functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shen, Yi-Dong +2 more
openaire +2 more sources

