Related papers: On Finite Bases for Weak Semantics: Failures versu…

We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are…

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…

We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on $\mathbb{R}$: one uniform and one non-uniform. We show that these notions are…

We show weak convergence of quantile and expectile processes to Gaussian limit processes in the space of bounded functions endowed with an appropriate semimetric which is based on the concepts of epi- and hypo convergence as introduced in…

In this paper, we classify all finite irreducible conformal modules over a class of Lie conformal algebras $\mathcal{W}(b)$ with $b\in\mathbb{C}$ related to the Virasoro conformal algebra. Explicitly, any finite irreducible conformal module…

We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.

In this paper we study the almost sure conditional central limit theorem in its functional form for a class of random variables satisfying a projective criterion. Applications to strongly mixing processes and non irreducible Markov chains…

We verify a finiteness conjecture of Feit on sources of simple modules over group algebras for various classes of finite groups related to the symmetric groups.

We classify integrable bounded simple weight modules over classical Lie superalgebras at infinity. We also study the categories of such modules, and we prove that for most of the classical Lie superalgebras at infinity the respective…

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…

We consider the finite W-superalgebras for a basic classical Lie superalgebra g associated with an even nilpotent element in g both over the field of complex numbers field and and over a filed of positive characteristic. We present the PBW…

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

These lectures contain an introduction to the theory and practice of weak-scale supersymmetry. They begin with a discussion of the hierarchy problem and the motivation for weak-scale supersymmetry. They continue by developing the coset…

Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems,…

This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…

We investigate weight modules for finite and infinite Weyl algebras, classifying all such simple modules. We also study the representation type of the blocks of locally-finite weight module categories and describe indecomposable modules in…

In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…