Related papers: Monadic Second-Order Logic and Bisimulation Invari…
The recent construction of integrable quantum field theories on two-dimensional Minkowski space by operator-algebraic methods is extended to models with a richer particle spectrum, including finitely many massive particle species…
The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…
In the present article we discuss an approach to cohomological invariants of algebraic groups over fields of characteristic zero based on the Morava $K$-theories, which are generalized oriented cohomology theories in the sense of…
Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
We generalize the work by Soboci\'nski on relational presheaves and their connection with weak (bi)simulation for labelled transistion systems to a coalgebraic setting. We show that the coalgebraic notion of saturation studied in our…
We introduce a new stable birational invariant, which takes the form of a functor sending a degenerating variety to the homotopy type of a chain complex. Our invariant is a categorification of the motivic volume of Nicaise and Shinder. From…
We introduce a contravariant idempotent adjunction between (i) the category of ranked monads on $\mathsf{Set}$; and (ii) the category of internal categories and internal retrofunctors in the category of locales. The left adjoint takes a…
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
We characterize in terms of bicategories actions of monoidal categories to representation categories of algebras. For that purpose we introduce cocycles in any 2-category $\K$ and the category of Tambara modules over a monad $B$ in $\K$. We…
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
This paper presents equational-based logics for proving first order properties of programming languages involving effects. We propose two dual inference system patterns that can be instanciated with monads or comonads in order to be used…
Behavioural metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…
We find presentations for subalgebras of invariants of the coordinate algebras of binary symmetric models of phylogenetic trees studied by Buczynska and Wisniewski in \cite{BW}. These algebras arise as toric degenerations of rings of global…
We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…
The conventional cosmological perturbation theory has been performed under the assumption that we know the whole spatial region of the universe with infinite volume. This is, however, not the case in the actual observations because…