Related papers: Strong Typed B\"ohm Theorem and Functional Complet…
We prove a bicategorical analogue of Quillen's Theorem A. As an application, we deduce the well-known result that a pseudofunctor is a biequivalence if and only if it is essentially surjective on objects, essentially full on 1-cells, and…
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
We prove a local $Tb$ theorem under close to minimal (up to certain `buffering') integrability assumptions, conjectured by S. Hofmann (El Escorial, 2008): Every cube is assumed to support two non-degenerate functions $b^1_Q\in L^p$ and…
Let $A=U|A|$ and $B=V|B|$ be the polar decompositions of $A\in \mathbb{B}(\mathscr{H}_1)$ and $B\in \mathbb{B}(\mathscr{H}_2)$ and let $Com(A,B)$ stand for the set of operators $X\in\mathbb{B}(\mathscr{H}_2,\mathscr{H}_1)$ such that…
In this short note, we extend a local $Tb$ theorem that was proved in \cite{GHO} to a full multilinear local $Tb$ theorem.
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…
It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended polynomials. This is indeed the case when one interprets integers over the type (p->p)->p->p where p is a base type…
We give an adequate, concrete, categorical-based model for Lambda-S, which is a typed version of a linear-algebraic lambda calculus, extended with measurements. Lambda-S is an extension to first-order lambda calculus unifying two approaches…
Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
We give a direct proof of the local $Tb$ Theorem, in the Euclidean setting, and under the assumption of dual exponents. This Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator, supposing the…
We give a proof of a so-called "local $Tb$" Theorem for singular integrals whose kernels satisfy the standard Calder\'on-Zygmund conditions. The present theorem, which extends an earlier result of M. Christ \cite{Ch}, was proved in…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
A closed expression of the Euclidean Wilson-loop functionals is derived for pure Yang-Mills continuum theories with gauge groups $SU(N)$ and $U(1)$ and space-time topologies $\Rl^1\times\Rl^1$ and $\Rl^1\times S^1$. (For the $U(1)$ theory,…
In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial…
The aim of this paper is to give a precise proof of the completeness of Lamb modes and associated modes. This proof is relatively simple and short but relies on two powerful mathematical theorems. The first one is a theorem on elliptic…