Related papers: On Finite Bases for Weak Semantics: Failures versu…
We present a weakest-precondition-style calculus for reasoning about the expected values (pre-expectations) of \emph{mixed-sign unbounded} random variables after execution of a probabilistic program. The semantics of a while-loop is…
In this paper, we shall study existence of weak solutions to complex Hessian equations. With appropriate assumptions, it is possible to obtain weak solutions in pluripotential sense.
This paper deals with functions that defined in metric spaces and valued in complete paranormed vector spaces or valued in Banach spaces, and obtains some necessary and sufficient conditions for weak convergence of finite measures.
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…
In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…
The aim of this paper is to introduce an algebraic structure on the set of all coalgebras with the same state space over the given type which allows us to present definitions of weak and delay bisimulation for coalgebras. Additionally, we…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
We discuss the existence and non-existence of non-negative weak solutions for second order nonlocal elliptic systems subject to functional boundary conditions. Our approach is based on classical fixed point index theory combined with some…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
Weak coalgebra-Galois extensions are studied. A notion of an invertible weak entwining structure is introduced. It is proven that, within an invertible weak entwining structure, the surjectivity of the canonical map implies bijectivity…
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…
A well known result of Lozanovsky states that a Banach lattice is weakly sequentially complete if and only if it does not contain a copy of $c_{0}$. In the current paper we extend this result to the class of Banach $C(K)$ modules of finite…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
Modern processors such as ARMv8 and RISC-V allow executions in which independent instructions within a process may be reordered. To cope with such phenomena, so called promising semantics have been developed, which permit threads to read…
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…
This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
We give a necessary and sufficient condition for that the support $\tau$-tilting poset of a finite dimensional algebra is isomorphic to the poset of symmetric group with weak order. Moreover we show that there are infinitely many finite…