Related papers: Cyclic Shift in the Lambek Calculus
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
In this paper, we characterize hypercyclic generalized bilateral weighted shift operators on the standard Hilbert module over the C*-algebra of compact operators on the separable Hilbert space. Moreover, we give necessary and sufficient…
This paper introduces a refinement of the sequent calculus approach called cirquent calculus. While in Gentzen-style proof trees sibling (or cousin, etc.) sequents are disjoint sequences of formulas, in cirquent calculus they are permitted…
In this paper we study some fragments without implications of the (Hilbert) full Lambek logic $\mathbf{HFL}$ and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an…
We prove the existence of common hypercyclic entire functions for uncountable families of translation type operators. Contrary to our previous work [34], here the parameter which reflects the uncountable family lies on the unit circle. On…
The syntactic calculus of Lambek is a deductive system for the multiplicative fragment of intuitionistic non-commutative linear logic. As a fine-grained calculus of resources, it has many applications, mostly in formal computational…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…
In this survey, we consider Banach spaces of analytic functions in one and several complex variables for which: (i) polynomials are dense, (ii) point-evaluations on the domain are bounded linear functionals, and (iii) the shift operator…
We consider tensor grammars, which are an example of \commutative" grammars, based on the classical (rather than intuitionistic) linear logic. They can be seen as a surface representation of abstract categorial grammars ACG in the sense…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
We describe a closed operator functional calculus in Banach modules over the group algebra $L^1(\mathbb R)$ and illustrate its usefulness with a few applications. In particular, we deduce a spectral mapping theorem for operators in the…
We prove in the vector-valued spaces $L^2(\mathbb{R}_+, X)$ (where $X$ is a finite dimensional Hilbert space) the cyclicity for the semi-group of left translations of some particular functions with support included in a lacunary system of…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
A wardian calculus of sequences started almost seventy years ago constitutes the general scheme for extensions of the classical umbral operator calculus considered by many afterwards . At the same time this calculus is an example of the…
We introduce a substitute for the concept of slice for the case of non-linear Lipschitz functionals and transfer to the non-linear case some results about the Daugavet and the alternative Daugavet equations previously known only for linear…
We review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified. We extend the Lambek Calculus with a…
In this paper we develop the functional calculus for elliptic operators on compact Lie groups without the assumption that the operator is a classical pseudo-differential operator. Consequently, we provide a symbolic descriptions of complex…