Related papers: Compatibility between modal operators in distribut…
This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…
Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…
We investigate properties of the formula $p \to \Box p$ in the basic modal logic K. We show that K satisfies an infinitary weaker variant of the rule of margins $\phi \to \Box\phi / \phi, \neg\phi$, and as a consequence, we obtain various…
While there is general consensus on the definition of incompatible POVMs, moving up to the level of instruments one finds a much less clear situation, with mathematically different and logically independent definitions of incompatibility.…
In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…
We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations…
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…
Earlier, Lunts and Rosenberg studied a notion of compatibility of endofunctors with localization functors, with an application to the study of differential operators on noncommutative rings and schemes. Another compatibility -- of Ore…
Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/worlds -- maximal consistent sets of propositions -- with…
A necessary condition and a sufficient condition for one weight norm inequalities on Morrey spaces to hold are given for the fractional maximal operator and the fractional integral operator. We clarify the difference between the behavior of…
On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…
We display a family of Stone-type dualities linking categories of frames carrying pairs of modal operators to categories of spaces carrying a binary relation. Different notions of morphism used on the relational side lead to significant…
In an earlier paper, a new theory of measurefree "conditional" objects was presented. In this paper, emphasis is placed upon the motivation of the theory. The central part of this motivation is established through an example involving a…
We introduce the notion of bi-monoid in general monoidal category generalizing by this the notion of bialgebra. In the case of bimodules over a noncommutative algebra, we obtain a compatibility condition between ring and coring whenever…
One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one for the lax semantics. Both problems turn out to be…
In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi \emph{constructive}, we show that any…
Let $V\subseteq A$ be a conformal inclusion of vertex operator algebras and let $\mathcal{C}$ be a category of grading-restricted generalized $V$-modules that admits the vertex algebraic braided tensor category structure of…
Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…