Related papers: A new coinductive confluence proof for infinitary …
In this paper we prove a recent conjecture [Robnik M and Salasnich L 1997 J. Phys. A: Math. Gen. 30 1719] about the convergence of the WKB series for the angular momentum operator. We demonstrate that the WKB algorithm for the angular…
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…
We provide a self-contained formulation of the BPHZ theorem in the Euclidean context, which yields a systematic procedure to "renormalise" otherwise divergent integrals appearing in generalised convolutions of functions with a singularity…
Let $\Lambda$ be a quasi-tilted algebra. If $\Lambda$ is representation-finite, it was shown by Happel, Reiten, and Smal{\o} that $\Lambda$ is tilted. We provide a new, short proof of this result.
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilarities are simple, easy-to-use behavioral equivalences which…
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…
The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…
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.
This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also…
Recently a new proof was given for Beurling's Ingham type theorem on one-dimensional nonharmonic Fourier series, providing explicit constants. We improve this result by applying a short elementary method instead of the previous complex…
We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…
Infinitesimal contraction analysis, wherein global asymptotic convergence results are obtained from local dynamical properties, has proven to be a powerful tool for applications in biological, mechanical, and transportation systems. Thus…
We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry--Howard correspondence to obtain typed concurrent $\lambda$-calculi; each of them features a specific communication mechanism, including…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without…
In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…
We introduce the structural resource lambda-calculus, a new formalism in which strongly normalizing terms of the lambda-calculus can naturally be represented, and at the same time any type derivation can be internally rewritten to its…
A notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one…
We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.