Related papers: Better Bounded Bisimulation Contractions (Preprint…
Let $\mathcal{T}$ be a $k$-linear triangulated category. The space of Bridgeland stability conditions on $\mathcal{T}$, denoted by $\mathrm{Stab}(\mathcal{T})$, forms a complex manifold. In this paper, we introduce an equivalence relation…
Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal…
The problem of finding a finite state symbolic model which is bisimilar to a hybrid dynamical system (HDS) and has the minimum number of states is considered. The considered class of HDS allows for discrete-valued inputs that only affect…
Hilbert bimodules are morphisms between C*-algebraic models of quantum systems, while symplectic dual pairs are morphisms between Poisson geometric models of classical systems. Both of these morphisms preserve representation-theoretic…
We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…
We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…
This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…
Bayesian inference provides a natural way of incorporating prior beliefs and assigning a probability measure to the space of hypotheses. Current solutions rely on iterative routines like Markov Chain Monte Carlo (MCMC) sampling and…
Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…
We introduce two modal natural deduction systems that are suitable to represent and reason about transformations of quantum registers in an abstract, qualitative, way. Quantum registers represent quantum systems, and can be viewed as the…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
We reconcile the two different category-theoretic semantics of regular theories in predicate logic. A 2-category of `regular fibrations' is constructed, as well as a 2-category of `regular proarrow equipments', and it is shown that the two…
Contractads are operadic-type algebraic structures well-suited for describing configuration spaces indexed by a simple connected graph $\Gamma$. Specifically, these configuration spaces are defined as…
In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…
We study completely contractive representations of product systems $X$ of correspondences over the semigroup $\mathbb{Z}_+^k$. We present a necessary and sufficient condition for such a representation to have a regular isometric dilation.…
We prove that steady state bifurcations in finite-dimensional dynamical systems that are symmetric with respect to a monoid representation generically occur along an absolutely indecomposable subrepresentation. This is stated as a…