Related papers: Arithmetical proofs of strong normalization result…
This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular…
Lambda calculi with algebraic data types lie at the core of functional programming languages and proof assistants, but conceal at least two fundamental theoretical problems already in the presence of the simplest non-trivial data type, the…
In this article we consider the following generalized quasi-geostrophic equation \partial_t\theta + u\cdot\nabla \theta + \nu \Lambda^\beta \theta =0, \quad u= \Lambda^\alpha \mathcal{R}^\bot\theta, \quad x\in\mathbb{R}^2, where $\nu>0$,…
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
$\tau$-tilting theory can be thought of as a generalization of the classical tilting theory which allows mutations at any indecomposable summand of a support $\tau$-tilting pair. Indeed, for any algebra $\Lambda$ its tilting modules…
The quadratically divergent scalar mass is subtractively renormalized unlike other divergences which are multiplicatively renormalized. We re-examine some technical aspects of the subtractive renormalization, in particular, the mass…
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective. We show how standard…
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type…
We generalize the notion of renormalized solution to semilinear elliptic and parabolic equations involving operator associated with general (possibly nonlocal) regular Dirichlet form and smooth measure on the right-hand side. We show that…
The "Harmony Lemma", as formulated by Sangiorgi & Walker, establishes the equivalence between the labelled transition semantics and the reduction semantics in the $\pi$-calculus. Despite being a widely known and accepted result for the…
In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…
We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs are finitely branching but may be non-wellfounded. The…
It is proven by explicit construction that regularization by dimensional reduction can be formulated in a mathematically consistent way. In this formulation the quantum action principle is shown to hold. This provides an intuitive and…
We present a full formalization in Martin-L\"of's Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using first-order syntax with one sort of names for both free and bound variables and Stoughton's multiple…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
In the present work we are concerned with the existence of normalized solutions to the following Schr\"odinger-Poisson System $$ \left\{ \begin{array}{ll} -\Delta u + \lambda u + \mu (\ln|\cdot|\ast |u|^{2})u = f(u) \textrm{ \ in \ }…
We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…