English
Related papers

Related papers: A syntactical proof of the operational equivalence…

200 papers

We consider the following decision problem: given two simply typed $\lambda$-terms, are they $\beta$-convertible? Equivalently, do they have the same normal form? It is famously non-elementary, but the precise complexity - namely…

Logic in Computer Science · Computer Science 2024-09-11 Lê Thành Dũng Nguyên

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

In this paper, we prove an $L^2$ extension theorem with optimal estimate in a precise way, which implies optimal estimate versions of various well-known $L^2$ extension theorems. As applications, we give proofs of a conjecture of Suita on…

Complex Variables · Mathematics 2014-02-03 Qi'an Guan , Xiangyu Zhou

Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…

Logic in Computer Science · Computer Science 2018-08-13 Beniamino Accattoli

In the development of a presumed asymptotic expansion for lambda_d in previous work, a basic step involved extracting the asymptotic behavior of a sum as being dominated by the largest term in the sum. But this argument only is valid when…

Mathematical Physics · Physics 2008-06-26 Paul Federbush

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment. While the reachability problem is…

Formal Languages and Automata Theory · Computer Science 2012-03-30 Béatrice Bérard , Serge Haddad , Mathieu Sassolas

This paper treats about one of the most remarkable achievements by Riemann, that is the symmetric form of the functional equation for {\zeta}(s). We present here, after showing the first proof of Riemann, a new, simple and direct proof of…

History and Overview · Mathematics 2017-07-13 Andrea Ossicini

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

An operator $T$ on a Hilbert space $\mathcal H$ is called expansive, if $\|Tx\|\geq \|x\|$ ($x\in\mathcal H$). Expansive operators $T$ quasisimilar to the unilateral shift $S_N$ of finite multiplicity $N$ are studied. It is proved that…

Functional Analysis · Mathematics 2025-09-16 Maria F. Gamal'

In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…

Logic in Computer Science · Computer Science 2016-08-22 Satoshi Matsuoka

We give a semantics for the lambda-calculus based on a topological duality theorem in nominal sets. A novel interpretation of lambda is given in terms of adjoints, and lambda-terms are interpreted absolutely as sets (no valuation is…

Logic in Computer Science · Computer Science 2016-10-07 Murdoch J. Gabbay , Michael J. Gabbay

Let $J$ be a Jacobi operator on $\ell^2\left(\mathbb{Z}\right)$. We prove an eigenfunction expansion theorem for the singular part of $J$ using subordinate solutions to the eigenvalue equation. We exploit this theorem in order to show that…

Spectral Theory · Mathematics 2024-06-19 Netanel Levi

This article examines the interpretation of the LTL temporal operators over finite and infinite sequences. This is used as the basis for deriving a sound and complete axiomatization for Caret, a recent temporal logic for reasoning about…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella

Motivated by several conjectures posed in the paper " Completely monotonic degrees for a difference between the logarithmic and psi functions",we confirm in this work some conjectures on completely monotonic degrees of remainders of the…

Classical Analysis and ODEs · Mathematics 2022-02-07 Mohamed Bouali

The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…

Logic in Computer Science · Computer Science 2025-10-22 Alexander Bentkamp , Jasmin Blanchette , Matthias Hetzenberger , Uwe Waldmann

$J$-self-adjoint extensions of the Phillips symmetric operator $S$ are studied. The concepts of stable and unstable $C$-symmetry are introduced in the extension theory framework. The main results are the following: if ${A}$ is a…

Mathematical Physics · Physics 2012-03-06 S. Kuzhel , O. Shapovalova , L. Vavrykovych

Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…

Number Theory · Mathematics 2025-09-23 Fumichika Takamizo

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

Logic · Mathematics 2017-08-10 Christopher J. Eagle

This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…

Category Theory · Mathematics 2014-10-17 Michal R. Przybylek

We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.

Logic in Computer Science · Computer Science 2024-04-09 Anupam Das , Damiano Mazza , Lê Thành Dũng Nguyên , Noam Zeilberger
‹ Prev 1 3 4 5 6 7 10 Next ›