Related papers: An expressive completeness theorem for coalgebraic…
Algebra and representation theory in modular tensor categories can be combined with tools from topological field theory to obtain a deeper understanding of rational conformal field theories in two dimensions: It allows us to establish the…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…
We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…
For an atomic orbital base category in the sense of Barwick-Dotto-Glasman-Nardin-Shah, we introduce the category of parametrised perfect-stable categories and use it to construct the parametrised version of noncommutative motives in which…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…
We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…
In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and…
In this paper we present a new compact expression of the elliptic genus of SL(2)/U(1)-supercoset theory by making use of the `spectral flow method' of the path-integral evaluation. This new expression is written in a form like a Poincare…
The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv$\to$ Cat for the free calculus on a category of terms and rewrites and a 2-monad…
We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…
In this paper we study the category of localizing motives $\operatorname{Mot}^{\operatorname{loc}}$ -- the target of the universal finitary localizing invariant of idempotent-complete stable categories as defined by Blumberg-Gepner-Tabuada.…
The variation of a class of Orlicz moments with respect to the Asplund sum within the class of log-concave functions is demonstrated. Such a variational formula naturally leads to a family of dual Orlicz curvature measures for log-concave…
Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…