Related papers: Abstract Congruence Criteria for Weak Bisimilarity
We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…
We formalize the observation that the same summability methods converge in a Banach space $X$ and its dual $X^*$. At the same time we determine conditions under which these methods converge in the weak and weak*-topologies on $X$ and $X^*$…
The theory of finite and infinitary term rewriting is extensively developed for orthogonal rewrite systems, but to a lesser degree for weakly orthogonal rewrite systems. In this note we present some contributions to the latter case of weak…
This paper investigates weak convergence of U-statistics via approximation in probability. The classical condition that the second moment of the kernel of the underlying U-statistic exists is relaxed to having 4/3 moments only (modulo a…
The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string…
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss…
We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic…
The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if…
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.
Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta / nt\mu x\theta$ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and…
We study the representation of non-weakly compact operators between $AL$-spaces. In this setting, we show that every operator admits a best approximant in the ideal of weakly compact operators. Using duality arguments, we extend this result…
Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…
In recent developments, a novel set of necessary optimality conditions for mixed constrained optimal control problems, termed the asymptotic weak maximum principle, has been formulated. These novel conditions deviate from the classical ones…
A note on the property of weak contraction, which implies that all bounded solutions of a nonlinear system converge to a (possibly non-unique) equilibrium. We provide some simple results about interconnections of such systems, and a brief…
We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…
We extend the duality principle for the $\Gamma$-convergence of convex lower semicontinuous functions, which was previously established only in separable reflexive Banach spaces, to the broader class of weakly compactly generated (WCG)…
Conditioning, the central operation in Bayesian statistics, is formalised by the notion of disintegration of measures. However, due to the implicit nature of their definition, constructing disintegrations is often difficult. A folklore…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
Using the theory of Stienstra and Beukers, we prove various elementary congruences for the numbers \sum \binom{2i_1}{i_1}^2\binom{2i_2}{i_2}^2...\binom{2i_k}{i_k}^2, where k,n \in N, and the summation is over the integers i_1, i_2, ...i_k…
Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear to) execute instructions in an order different to that specified by the program text. The consequences of instruction reordering can be…