Related papers: Does weak quasi-o-minimality behave better than we…

We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

We study long chains of iterated weak* derived sets, that is sets of all weak* limits of bounded nets, of subspaces with the additional property that the penultimate weak* derived set is a proper norm dense subspace of the dual. We extend…

In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of…

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

In this paper we study a quasilinear elliptic problem whose functional satisfies a weak version of the well known Palais-Smale condition. An existence result is proved under general assumptions on the nonlinearities.

We provide general formulation of weak identification in semiparametric models and an efficiency concept. Weak identification occurs when a parameter is weakly regular, i.e., when it is locally homogeneous of degree zero. When this happens,…

We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R^{n+1},<_l), where <_l is the…

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

We consider locally o-minimal structures possessing tame topological properties shared by models of DCTC and uniformly locally o-minimal expansions of the second kind of densely linearly ordered abelian groups. We derive basic properties of…

Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…

The well-quasi-orders (WQO) play an important role in various fields such as Computer Science, Logic or Graph Theory. Since the class of WQOs lacks closure under some important operations, the proof that a certain quasi-order is WQO…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

We construct a weak KAM theory for parameterized cobordisms and their relaxation, holonomic measures. We find a weak kam solution in that context, and we show that in many cases it corresponds to an exact form that satisfies a version of…

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

We give a short discussion about a weaker form of minimality (called quasi-minimality). We call a system quasi-minimal if all dense orbits form an open set. It is hard to find examples which are not already minimal. Since elliptic behaviour…

In a recent letter [Information Processing Letters~104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some alternative and simple characterizations for the…

Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several…

We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…