English
Related papers

Related papers: A Type-Directed Negation Elimination

200 papers

We contextualize the improved gauge-unfixing (GU) formalism within a rather general prototypical second-class system, obtaining a corresponding first-class equivalent description enjoying gauge invariance which can be applied to several…

High Energy Physics - Theory · Physics 2023-01-18 Jorge Ananias Neto , Widervan de Deus Morais , Ronaldo Thibes

Using the general notions of Batalin, Fradkin, Fradkina and Tyutin to convert second class systems into first class ones, we present a gauge invariant formulation of the massive Yang-Mills theory by embedding it in an extended phase space.…

High Energy Physics - Theory · Physics 2009-10-30 R. Banerjee , J. Barcelos-Neto

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

Logic in Computer Science · Computer Science 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…

Logic in Computer Science · Computer Science 2010-12-23 Christian Urban

We find modular transformations of normalized characters for the following $W$-algebras: (a) $W^{min}_k(\frak{g})$, where $\frak{g}=D_n \, (n \geq 4)$, or $E_6$, $E_7$, $E_8$, and $k$ is a negative integer $\geq -2$, or $\geq…

Representation Theory · Mathematics 2025-01-22 Victor G. Kac , Minoru Wakimoto

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

The denominator formula for the Monster Lie algebra is the product expansion for the modular function $j(z)-j(\tau)$ given in terms of the Hecke system of $\operatorname{SL}_2(\mathbb Z)$-modular functions $j_n(\tau)$. It is prominent in…

Number Theory · Mathematics 2017-03-27 Kathrin Bringmann , Ben Kane , Steffen Löbrich , Ken Ono , Larry Rolen

Let $\mf{g}$ be any finite-dimensional Lie algebra with Killling form $B$. Let $\mf{h}$ be a subalgebra of $\mf{g}$ on which the Killing form is non degenerate. Then $\mf{h}$ is reductive.

Rings and Algebras · Mathematics 2007-12-03 Stuart Armstrong

Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…

Numerical Analysis · Mathematics 2023-07-13 Richard Mikael Slevinsky

Within the framework of a manifestly gauge invariant exact renormalization group for SU(N) Yang-Mills, we derive a simple expression for the expectation value of an arbitrary gauge invariant operator. We illustrate the use of this formula…

High Energy Physics - Theory · Physics 2008-11-26 Oliver J. Rosten

Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…

Programming Languages · Computer Science 2016-08-16 Paul Tarau

Term-resolution provides an elegant mechanism to prove that a quantified Boolean formula (QBF) is true. It is a dual to Q-resolution (also referred to as clause-resolution) and is practically highly important as it enables certifying…

Logic in Computer Science · Computer Science 2017-04-05 Mikoláš Janota

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Logic in Computer Science · Computer Science 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…

Logic in Computer Science · Computer Science 2012-03-29 Pablo Buiras , Alejandro Díaz-Caro , Mauro Jaskelioff

We say that a normalized modular form is of CM type modulo $\ell$ by an imaginary quadratic field $K$ if its Fourier coefficients $a_p$ are congruent to $0$ modulo a prime $\mathcal L\mid \ell$ for every prime $p$ that is inert in $K$. In…

Number Theory · Mathematics 2026-05-13 Luís Dieulefait , Josep González , Joan-C. Lario

The classification of graded non-alternating Hamiltonian Lie algebras over perfect field of characteristic 2 is obtained. It is shown that the filtered deformations of such algebras correspond to non-alternating Hamiltonian forms with…

Rings and Algebras · Mathematics 2019-01-01 A. V. Kondrateva , M. I. Kuznetsov , N. G. Chebochko

Many language technology applications would benefit from the ability to represent negation and its scope on top of widely-used linguistic resources. In this paper, we investigate the possibility of obtaining a first-order logic…

Computation and Language · Computer Science 2017-02-14 Federico Fancellu , Siva Reddy , Adam Lopez , Bonnie Webber

Some years ago Mosh\'e Flato pointed up that it could be interesting to develop the Nambu's idea to generalize Hamiltonian mechanic. An interesting new formalism in that direction was proposed by T. Takhtajan. His theory gave new…

Differential Geometry · Mathematics 2016-09-07 Jean-Paul Dufour , Mikhail Zhitomirskii

We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations…

Logic · Mathematics 2023-02-07 Jim de Groot

We study the fixed point for a non-linear transformation in the set of Hausdorff moment sequences, defined by the formula: $T((a_n))_n=1/(a_0+... +a_n)$. We determine the corresponding measure $\mu$, which has an increasing and convex…

Classical Analysis and ODEs · Mathematics 2016-08-14 Christian Berg , Antonio J. Durán