相关论文: A Type-Directed Negation Elimination

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Using a regularization by putting the system in finite volume, we develop a novel approach to form factor perturbation theory for nonintegrable models described as perturbations of integrable ones. This permits to go beyond first order in…

We discuss and compare complexity measures for the modal $\mu$-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by…

If an irreducible fraction $\frac mn>0$ can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than $\frac mn$ in fractional ideal $\frac 1n\mathbb Z$ can not be…

Let $z=(z_1, z_2, ..., z_n)$ be noncommutative free variables and $t$ a formal parameter which commutes with $z$. Let $k$ be any unital integral domain of any characteristic and $F_t(z)=z-H_t(z)$ with $H_t(z)\in {k[[t]]< < z >>}^{\times n}$…

We present a formulation to give renormalon-free predictions consistently with fixed order perturbative results. The formulation has a similarity to Lee's method in that the renormalon-free part consists of two parts: one is given by a…

Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the…

Nominal Logic is a version of first-order logic with equality, name-binding, renaming via name-swapping and freshness of names. Contrarily to higher-order logic, bindable names, called atoms, and instantiable variables are considered as…

The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…

A $n$-dimensional Lie algebra $g=(V,\mu)$ is called $2$-compatible if it is isomorphic to a quadratic deformation of a Lie algebra $g_0=(V,\mu_0)$. By quadratic deformation we means a formal deformation $\mu_t=\mu_0+t\varphi_1+t^2\varphi_2$…

Let $V$ be a Weyl module either for a reductive algebraic group $G$ or for the corresponding quantum group $U_q$. If $G$ is defined over a field of positive characteristic $p$, respectively if $q$ is a primitive $l$'th root of unity (in an…

In this paper, the curvature perturbation generated by the modulated curvaton decay is studied by a direct application of $\delta N$-formalism. Our method has a sharp contrast with the {\it non-linear formalism} which may be regarded as an…

Suppose that $\ell \geq 5$ is prime. For a positive integer $N$ with $4 \mid N$, previous works studied properties of half-integral weight modular forms on $\Gamma_0(N)$ which are supported on finitely many square classes modulo $\ell$, in…

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…

Let $F$ be a quadratic form in four variables, let $m\in\mathbb{N}$ and let $\mathbf{k}\in \mathbb{Z}^4$. We count integer solutions to $F(\mathbf{x})=0$ with $\mathbf{x}\equiv \mathbf{k}\:\mathrm{mod}(m)$. One can compare this to the…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

Autoformalization is the process of automatically translating from natural language mathematics to formal specifications and proofs. A successful autoformalization system could advance the fields of formal verification, program synthesis,…

The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…

A unified construction of canonical $H^m$-nonconforming finite elements is developed for $n$-dimensional simplices for any $m, n \geq 1$. Consistency with the Morley-Wang-Xu elements [Math. Comp. 82 (2013), pp. 25-43] is maintained when $m…

We present the general framework of \'Ecalle's moulds in the case of linearization of a formal vector field without and within resonances. We enlighten the power of moulds by their universality, and calculability. We modify then \'Ecalle's…