The paper presents a formal lexicalized dependency grammar based on Meaning-Text theory. This grammar associates semantic graphs with sentences. We propose a fragment of a grammar for French, including the description of extractions. The main particularity of our grammar is it that it builds bubble trees as syntactic representations, that is, trees whose nodes can be filled by bubbles, which ca...

let $k$ be a field of characteristic$p>0$, $k[[x]]$, the ring of formal power series over $ k$,$k((x))$, the quotient field of $ k[[x]]$, and $ k(x)$ the fieldof rational functions over $k$. we shall give somecharacterizations of an algebraic function $fin k((x))$ over $k$.let $l$ be a field of characteristic zero. the power series $finl[[x]]$ is called differentially algebraic, if it satisfies...

In this paper, we prove that there is at most one correspondence between parahoric-spherical representations and semisimple local Langlands parameters which satisfies certain natural properties. Our proof of uniqueness statement very formal. particular, the constructed by Fargues Scholze yield unique candidate for such representations. As a corollary, conjecture posits compatibility with paraho...

The paper delineates a new approach to truth that falls under the category of "Pluralism within the bounds of correspondence", and illustrates it with respect to mathematical truth. Mathematical truth, like all other truths, is based on correspondence, but the route of mathematical correspondence differs from other routes of correspondence in (i) connecting mathematical truths to a special aspe...

Translation is an interlingual and intercultural communication, in which correspondence at the level of formal and meaningful structures does not necessarily lead to a successful communication: a secondary communication or even a communication breakdown may occur due to distinct historical-cultural contexts. Such recognition led Nida to put forward Dynamic Equivalence, which brings the receptor...

This is an expository paper discussing some parallels between the Khovanov and knot Floer homologies. We describe the formal similarities between the theories, and give some examples which illustrate a somewhat mysterious correspondence between them.

Several concise formulations of mathematical induction are presented and proven equivalent. The formulations are expressed in variable-free relation algebra and thus are in terms of relations only, without mentioning the related objects. It is shown that the induction principle in this form, when combined with the explicit use of Galois connections, lends itself very well for use in calculation...

We introduce a new connection between formal language theory and proof theory. One of the most fundamental proof transformations in a class of formal proofs is shown to correspond exactly to the computation of the language of a certain class of tree grammars. Translations in both directions, from proofs to grammars and from grammars to proofs, are provided. This correspondence allows theoretica...

We specify authentication protocols as formal objects with precise syntax and semantics, and deene a semantic model that characterizes protocol executions. We have identiied two basic types of correctness properties, namely, correspondence and secrecy, that underlie the correct-ness concerns of authentication protocols. We deene assertions for specifying these properties, and a formal semantics...