Related papers: A Note on Switching Conditions for the Generalized…
We prove here that in the Theorem on Local Ergodicity for Semi-Dispersive Billiards (proved by N. I. Chernov and Ya. G. Sinai in 1987) the recently added condition (by P. B\'alint, N. Chernov, D. Sz\'asz, and I. P. T\'oth, in order to save…
The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…
Distinguishability takes a crucial rule in studying observability of hybrid system such as switched system. Recently, for two linear systems, Lou and Si gave a condition not only necessary but also sufficient to the distinguishability of…
Rely/guarantee reasoning provides a compositional way of reasoning about concurrency. The ABA problem occurs in many non-blocking concurrent data structures, where a change made by a concurrent process may be undetected by other processes.…
This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to moving jumps (attachments) of par units…
We study theoretical guarantees for solving linear systems in-context using a linear transformer architecture. For in-domain generalization, we provide neural scaling laws that bound the generalization error in terms of the number of tasks…
Diverse selection statements -- if-then-else, switch and try-catch -- are commonly used in modern programming languages. To make things simple, we propose a unifying statement for selection. This statement is of the form seqor(G_1,...,G_n)…
Recently, Gavazzo has developed a relational theory of symbolic manipulation, that allows to study syntax-based rewriting systems without relying on specific notions of syntax. This theory was obtained by extending the algebra of relations…
We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-based parsing and…
We extend classical Propositional Logic (PL) by adding a new primitive binary connective $\varphi|\psi$, intended to represent the "superposition" of sentences $\varphi$ and $\psi$, an operation motivated by the corresponding notion of…
In this paper, we introduce a new connector which generalizes the connector found by the third author and Yamamoto. The new connector gives a direct proof of the double Ohno relation recently proved by the first author, the second author,…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…
We generalize the classical study of (generalized) Lax pairs and the related $O$-operators and the (modified) classical Yang-Baxter equation by introducing the concepts of nonabelian generalized Lax pairs, extended $\calo$-operators and the…
Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…
The rely-guarantee technique allows one to reason compositionally about concurrent programs. To handle interference the technique makes use of rely and guarantee conditions, both of which are binary relations on states. A rely condition is…
We revisit here a famous result by Sparre Andersen on persistence probabilities $\mathbf{P}(S_k>0 \;\forall\, 0\leq k\leq n)$ for symmetric random walks $(S_n)_{n\geq 0}$. We give a short proof of this result when considering sums of random…
In CSL'99 Roversi pointed out that the Turing machine encoding of Girard's seminal paper "Light Linear Logic" has a flaw. Moreover he presented a working version of the encoding in Light Affine Logic, but not in Light Linear Logic. In this…
Given a p-form defined on the smooth locus of a normal variety, and a resolution of singularities, we study the problem of extending the pull-back of the p-form over the exceptional set of the desingularization. For log canonical pairs and…
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major…
Kipnis and Varadhan showed that for an additive functional, $S_n$ say, of a reversible Markov chain the condition $E(S_n^{2})/n \to \kappa \in (0,\infty)$ implies the convergence of the conditional distribution of $S_n/\sqrt{E(S_n^{2}})$,…