English
Related papers

Related papers: A syntactical proof of the operational equivalence…

200 papers

We consider two operations on the Mittag-Leffler function which cancel the exponential term in the expansion at infinity, and generate a completely monotonic function. The first one is the action of a certain differential-difference…

Classical Analysis and ODEs · Mathematics 2013-12-18 Thomas Simon

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Let $\Omega$ denote an algebra of sets and $\mu$ a $\sigma$-finite measure. We then prove that the completion of $\Omega$ under the pseudometric $d(A,B)$ = $\mu^{\ast}(A \triangle B)$ is $\sigma$-algebra isomorphic and isometric to the…

Functional Analysis · Mathematics 2008-03-13 Jun Tanaka

We present a proof of the functional equation of the Riemann zeta-function or more precisely the Dirichlet eta-function, which proof seems to be new but follows almost immediately from Malmst\`en's paper ``De integralibus quibusdam…

History and Overview · Mathematics 2013-06-19 Alexander Aycock

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal…

Logic in Computer Science · Computer Science 2023-06-22 Benedetto Intrigila , Giulio Manzonetto , Andrew Polonsky

This paper presents a new, significantly simpler proof of one of the main results of applied pi-calculus: the theorem that the concepts of observational and labeled equivalence of extended processes in applied pi-calculus coincide.

Logic in Computer Science · Computer Science 2026-04-09 Andrew M. Mironov

We have looked at the evaluation of the Riemann Zeta function at odd arguments and have provided a simple formula to approximate the value with exponential convergence. We have compared it with various other formulae present in literature.…

Number Theory · Mathematics 2015-03-19 Srinivasan Arunachalam

In this paper, we show that the trace of the operators $A\eta(t\mathcal{L})$ where $A$ and $\mathcal {L}$ are classical pseudo-differential operators on a compact manifold $M$ and $\mathcal {L}$ is elliptic and self-adjoint admits an…

Functional Analysis · Mathematics 2019-11-18 Veronique Fischer

Make an exponential transformation in the integral formulation of Riemann's zeta-function zeta(s) for Re(s) > 0. Separately, in addition make the substitution s -> 1 - s and then transform back to s again using the functional equation.…

General Mathematics · Mathematics 2013-10-15 Arne Bergstrom

We perform an asymptotic evaluation of the Hankel transform, $\int_0^{\infty}J_{\nu}(\lambda x) f(x)\mathrm{d}x$, for arbitrarily large $\lambda$ of an entire exponential type function, $f(x)$, of type $\tau$ by shifting the contour of…

Complex Variables · Mathematics 2024-09-18 Nathalie Liezel R. Rojas , Eric A. Galapon

We define $\Delta$-equivalence for operator systems and show that it is identical to stable isomorphism. We define $\Delta$-contexts and bihomomorphism contexts and show that two operator systems are $\Delta$-equivalent if and only if they…

Operator Algebras · Mathematics 2026-02-27 George K. Eleftherakis , Evgenios T. A. Kakariadis , Ivan G. Todorov

We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2023-06-22 Matthias Weber

A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…

Logic in Computer Science · Computer Science 2007-05-23 Klaus Aehlig , Helmut Schwichtenberg

For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…

Probability · Mathematics 2011-04-04 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

We substantially apply the Li criterion for the Riemann hypothesis to hold. Based upon a series representation for the sequence \{\lambda_k\}, which are certain logarithmic derivatives of the Riemann xi function evaluated at unity, we…

Mathematical Physics · Physics 2009-11-11 Mark W. Coffey

We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e., STCTL is interpreted…

Logic in Computer Science · Computer Science 2023-10-20 Jaime Arias , Wojciech Jamroga , Wojciech Penczek , Laure Petrucci , Teofil Sidoruk

We present the type system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2024-12-17 Matthias Weber

Revisiting a classic result from M. Hofmann's dissertation, we give a direct proof of Morita equivalence, in the sense of V. Isaev, between extensional type theory and intensional type theory extended by the principles of functional…

Logic · Mathematics 2025-12-23 Chris Kapulkin , Yufeng Li

Let $\lambda =\left( \lambda_{1},\lambda_{2},...,\lambda_{r}\right) $ be an integer partition, and $\left[p_{\lambda }\right] $ the $q$-analog of the symmetric power function $%p_{\lambda }$. This $q$-analogue has been defined as a special…

Combinatorics · Mathematics 2024-09-16 Vincent Brugidou

One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and…

Logic in Computer Science · Computer Science 2014-06-18 Thomas Brihaye , Morgane Estiévenart , Gilles Geeraerts