Related papers: Moss' logic for ordered coalgebras

The representation theory of rational Cherednik algebras of type A at t=0 gives rise, by considering supports, to a natural family of smooth Lagrangian subvarieties of the Calogero-Moser space. The goal of this article is to make precise…

Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…

Holliday recently introduced a non-classical logic called Fundamental Logic, which intends to capture exactly those properties of the connectives "and", "or" and "not" that hold in virtue of their introduction and elimination rules in…

Given a monad T on a suitable enriched category B equipped with a proper factorization system (E,M), we define notions of T-completion, T-closure, and T-density. We show that not only the familiar notions of completion, closure, and density…

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these…

We give sufficient conditions which ensure that a functor of finite length from an additive category to finite-dimensional vector spaces has a projective resolution whose terms are finitely generated. For polynomial functors, we study also…

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…

The category of Hilbert modules may be interpreted as a naive quantum field theory over a base space. Open subsets of the base space are recovered as idempotent subunits, which form a meet-semilattice in any firm braided monoidal category.…

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…

We study the homotopy theory of a certain type of diagram categories whose vertices are in variable categories with a functorial path, leading to a good calculation of the homotopy category in terms of cofibrant objects. The theory is…

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

We present a survey of the two-dimensional and tensorial structure of the lifting doctrine in constructive domain theory, i.e. in the theory of directed-complete partial orders (dcpos) over an arbitrary elementary topos. We establish the…

In this paper, we introduce a new variety of Heyting algebras with two unary modal operators that are not interdefinable but satisfy the weakest condition necessary to define modal operators on Nelson lattices. To achieve this, we utilize…

We demonstrate that any full and faithful $*$-functor between approximable categories of locally finite coarse spaces induces a coarse embedding between the underlying spaces. Furthermore, we establish a general characterisation of such…

Motivated by the need to reason about hybrid systems, we study limits in categories of coalgebras whose underlying functor is a Vietoris polynomial one - intuitively, the topological analogue of a Kripke polynomial functor. Among other…

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

We prove several combinatorial results on path algebras over discrete structures related to directed graphs. These results are motivated by Morse theory on a manifold with boundary and, more generally, by Floer theory on a configuration…

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…