相关论文: Cut-elimination for the mu-calculus with one varia…

In this paper we calibrate the strength of the soundness of a Kripke-Platek set theory with the axioms of Infinity and \Pi_{1}-Collection with the assumption that`there exists an uncountable regular ordinal' in terms of the existence of…

Unitarity cuts are widely used in analytic computation of loop amplitudes in gauge theories such as QCD. We expand upon the technique introduced in hep-ph/0503132 to carry out any finite unitarity cut integral. This technique naturally…

We consider a robust formulation, introduced by Krause et al. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness…

We construct a manifestly gauge invariant Exact Renormalisation Group (ERG) whose form is suitable for computation in SU(N) Yang-Mills theory, beyond one-loop. An effective cutoff is implemented by embedding the physical SU(N) theory in a…

For systems with first class constraints the reduction scheme to the gauge invariant variables is considered. The method is based on the analysis of restricted 1-forms in gauge invariant variables. This scheme is applied to the models of…

In "Cut Elimination for Gentzen's Sequent Calculus with Equality and Logic of Partial Terms" LNCS 7750,161-172(2013), we have shown that the cut rule is eliminable in two ground equational sequent calculi, to be denoted by EQ_M and EQ'. In…

The $\epsilon$-substitution method is a technique for giving consistency proofs for theories of arithmetic. We use this technique to give a proof of the consistency of the impredicative theory $ID_1$ using a variant of the cut-elimination…

The {\em tetravalent modal logic} ($\cal TML$) is one of the two logics defined by Font and Rius (\cite{FR2}) (the other is the {\em normal tetravalent modal logic} ${\cal TML}^N$) in connection with Monteiro's tetravalent modal algebras.…

We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…

In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…

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 present a method for the computation of hepta-cuts of two loop scattering amplitudes. Four dimensional unitarity cuts are used to factorise the integrand onto the product of six tree-level amplitudes evaluated at complex momentum values.…

We characterize the expressive power of the modal mu-calculus on monotone neighborhood structures, in the style of the Janin-Walukiewicz theorem for the standard modal mu-calculus. For this purpose we consider a monadic second-order logic…

We construct a manifestly gauge invariant Exact Renormalization Group for SU(N) Yang-Mills theory, in a form suitable for calculations without gauge fixing at any order of perturbation theory. The effective cutoff is incorporated via a…

Operator cutoff regularization based on the original Schwinger's proper-time formalism is examined. By constructing a regulating smearing function for the proper-time integration, we show how this regularization scheme simulates the usual…

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

We introduce the countdown $\mu$-calculus, an extension of the modal $\mu$-calculus with ordinal approximations of fixpoint operators. In addition to properties definable in the classical calculus, it can express (un)boundedness properties…

A high order cut finite element method is formulated for solving the elastic wave equation. Both a single domain problem and an interface problem are treated. The boundary or interface are allowed to cut through the background mesh. To…

In this paper we introduce a cut-free sequent calculus for the alternation-free fragment of the modal $\mu$-calculus. This system allows for cyclic proofs and uses a simple focus mechanism to control the unravelling of fixpoints along…