In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.

We give a purely local proof, in the depth 0 case, of the result by HarrisTaylor which asserts that the local Langlands correspondence for GLn is realized in the vanishing cycle cohomology of the deformation spaces of one-dimensional formal modules of height n. Our proof is given by establishing the direct geometric link with the Deligne-Lusztig theory for GLn(Fq).

There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalence. We are interested in the relationship between these two presentations. Using our characterisation of the behaviour preorders by means of simulations up-to we were able to generate the canonical preorders correspondi...

The binomial coefficient of two words u and v is the number of times v occurs as a subsequence of u. Based on this classical notion, we introduce the mbinomial equivalence of two words refining the abelian equivalence. Two words x and y are m-binomially equivalent, if, for all words v of length at most m, the binomial coefficients of x and v and respectively, y and v are equal. The m-binomial c...

Light linear logic 1] is a reenement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of bred phase spaces. Strong completeness is established, with a purely semantic proof of cut elimination as a consequence. A number of mathematical examples of bred phase spaces are presented that illustrate ...

We calculate the rate for the decay Bu → lνγ using the light cone QCD sume rules. We find Br(Bu → lνγ) ≃ 2 · 10. The results are used to test the applicability of the constituent quark model approximation to the same process.The latter estimate is proportional to 1/mu, where mu ≃ Λ̄u is the ”constituent quark mass”, indicating that the process is of long distance type. We find that the two appro...

Editor’s Note: Shortly after Communications pub, ished James Fetzer’s “Program Verifica !ion: The Very Idea” [September 1988, p. 10481, a large volume of negative mail began to arrive from researchers engaged in program verification. The uniters raised questions about the responsibilities of the author, editors, and reviewers, and about the publications policies of ACM. The issue of accurate re...

In this paper we (1) provide a natural deduction system for full first-order linear logic, (2) introduce Curry-Howard-style terms for this version of linear logic, (3) prove strong normalization for the system, and (4). prove that given a proof of V~‘x3y a(.~, y) and any individual term t we can compute a term u such that a(t,u) is provable.

This paper constitutes a first step towards an extension of correspondence analysis with fuzzy data (FCA). At this stage, our main objective is to lay down the algebraic foundations for this fuzzy extension of the usual correspondence analysis. A two-step method is introduced to convert the fuzzy eigenvalue problem to an ordinary one. We consider a fuzzy matrix as the set of its cuts. Each such...

I will discuss the two problems of how to define identity between logics and how to define identity between proofs. For the identity of logics, I propose to simply use the notion of preorder equivalence. This might be considered to be folklore, but is exactly what is needed from the viewpoint of the problem of the identity of proofs: If the proofs are considered to be part of the logic, then pr...