Related papers: A syntactical proof of the operational equivalence…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and by the Boolean negation. We establish fascinating…
We provide conditional and unconditional asymptotic formulae for the exponential sums $\sum_\gamma\,\gamma^{-i\tau}$, where the summation is over the ordinates of the nontrivial zeros $\rho=\beta+i\gamma$ of the Riemann zeta-function. In…
We discuss moments of the Riemann zeta-function in this paper. The purpose of this paper is to give an upper bound of exponential moments of the logarithm of the Riemann zeta-function twisted by arguments. Our results contain an improvement…
In this paper it is proved that each densely defined $J$-skew-symmetric operator (or each $J$-isometric operator with $\overline{D(A)}=\overline{R(A)}=H$) in a Hilbert space $H$ has a $J$-skew-self-adjoint (respectively $J$-unitary)…
We give an elementary and constructive proof for a theorem of de Smit et Lenstra. Note: In version 1, was missing the proof that "completely secant" implies "1-secant"
Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove…
Recently data trees and data words have received considerable amount of attention in connection with XML reasoning and system verification. These are trees or words that, in addition to labels from a finite alphabet, carry data values from…
We consider differences between $\log \Gamma(x)$ and truncations of certain classical asymptotic expansions in inverse powers of $x-\lambda$ whose coefficients are expressed in terms of Bernoulli polynomials $B_n(\lambda)$, and we obtain…
By treating the multiple argument identity of the logarithm of the Gamma function as a functional equation, we obtain a curious infinite product representation of the $sinc$ function in terms of the cotangent function. This result is…
We show that the normal form of the Taylor expansion of a $\lambda$-term is isomorphic to its B\"ohm tree, improving Ehrhard and Regnier's original proof along three independent directions. First, we simplify the final step of the proof by…
In this paper we study extensions of commuting tuples of symmetric and isometric operators to commuting tuples of self-adjoint and unitary operators. Some conditions which ensure the existence of such extensions are presented. A…
Twenty years after its introduction by Ehrhard and Regnier, differentiation in $\lambda$-calculus and in linear logic is now a celebrated tool. In particular, it allows to establish a Taylor expansion formula for various $\lambda$-calculi,…
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…
In a previous paper an asymptotic expansion for lambda_d in powers of 1/d was developed. The results of computer computations for some terms in the expansion, as well as various quantities associated to the expansion, are herein presented.…
We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…
We provide a combinatorial interpretation of the symmetric function $\left.\Theta_{e_k}\Theta_{e_l}\nabla e_{n-k-l}\right|_{t=0}$ in terms of segmented Smirnov words. The motivation for this work is the study of a diagonal coinvariant ring…
Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…
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…
We determine the exact Borel class of the points whose iterates under $\exp(z)+a$ tend to infinity. We also prove that the sets of non-escaping Julia points for many of these functions are topologically equivalent.