Distributive Residuated Frames and Generalized Bunched Implication Algebras

We show that all extensions of the (non-associative) Gentzen system for distributive full Lambek calculus by simple structural rules have the cut elimination property. Also, extensions by such rules that do not increase complexity have the finite model property, hence many subvarieties of the variety of distributive residuated lattices have decidable equational theories. For some other extensions, we prove the finite embeddability property, which implies the decidability of the universal theory, and we show that our results also apply to generalized bunched implication algebras. Our analysis is conducted in the general setting of residuated frames

Admissibility in Finitely Generated Quasivarieties

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable. However, since free algebras may be large even for small sets of small algebras and very few generators, this naive method for checking admissibility in \Q is not computationally feasible. In this paper, algorithms are introduced that generate a minimal (with respect to a multiset well-ordering on their cardinalities) finite set of algebras such that the validity of a quasiequation in this set corresponds to admissibility of the quasiequation in Q. In particular, structural completeness (validity and admissibility coincide) and almost structural completeness (validity and admissibility coincide for quasiequations with unifiable premises) can be checked. The algorithms are illustrated with a selection of well-known finitely generated quasivarieties, and adapted to handle also admissibility of rules in finite-valued logics

Random Models of Idempotent Linear Maltsev Conditions. I. Idemprimality

We extend a well-known theorem of Murski\v{\i} to the probability space of finite models of a system $\mathcal{M}$ of identities of a strong idempotent linear Maltsev condition. We characterize the models of $\mathcal{M}$ in a way that can be easily turned into an algorithm for producing random finite models of $\mathcal{M}$, and we prove that under mild restrictions on $\mathcal{M}$, a random finite model of $\mathcal{M}$ is almost surely idemprimal. This implies that even if such an $\mathcal{M}$ is distinguishable from another idempotent linear Maltsev condition by a finite model $\mathbf{A}$ of $\mathcal{M}$, a random search for a finite model $\mathbf{A}$ of $\mathcal{M}$ with this property will almost surely fail

Dynamics of complex-valued modified KdV solitons with applications to the stability of breathers

We study the long-time dynamics of complex-valued modified Korteweg-de Vries (mKdV) solitons, which are recognized because they blow-up in finite time. We establish stability properties at the H^1 level of regularity, uniformly away from each blow-up point. These new properties are used to prove that mKdV breathers are H^1 stable, improving our previous result, where we only proved H^2 stability. The main new ingredient of the proof is the use of a B\"acklund transformation which links the behavior of breathers, complex-valued solitons and small real-valued solutions of the mKdV equation. We also prove that negative energy breathers are asymptotically stable. Since we do not use any method relying on the Inverse Scattering Transformation, our proof works even under rough perturbations, provided a corresponding local well-posedness theory is available.Comment: 45 pages, we thank Yvan Martel for pointing us a gap in the previous version of this pape