Related papers: Path category for free - Open morphisms from coalg…
We define a notion of Lambda-simulation for coalgebraic modal logics, parametric on the choice Lambda of predicate liftings for a functor T. We show this notion is adequate in several ways: i) it preserves truth of positive formulas, ii)…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
We define the notion of a relative matrad and realize the free relative matrad as a free H_\infty-bimodule structure on cellular chains of bimultiplihedra JJ={JJ_{n,m} = JJ_{m,n}}. We define a morphism G:A => B of A_\infty-bialgebras as a…
This is the first part of a two paper series studying free globularily generated double categories. In this first installment we introduce the free globularily generated double category construction. The free globularily generated double…
We develop the notion of deformation of a morphism in a left-proper model category. As an application we provide a geometric/homotopic description of deformations of commutative (non-positively) graded differential algebras over a local…
We establish an explicit comparison between two constructions in homotopy theory: the left adjoint of the homotopy coherent nerve functor, also known as the rigidification functor, and the Kan loop groupoid functor. This is achieved by…
Let M be a bicomplete, closed symmetric monoidal category. Let P be an operad in M, i.e., a monoid in the category of symmetric sequences of objects in M, with its composition monoidal structure. Let R be a P-co-ring, i.e., a comonoid in…
We introduce a bisimulation learning algorithm for non-deterministic transition systems. We generalise bisimulation learning to systems with bounded branching and extend its applicability to model checking branching-time temporal logic,…
Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…
There are a least uncountably many diffeomorphism types for open manifolds. Hence the classification problem is extremely difficult. We proceed as follows: We define several uniform structures of proper metric spaces and consider their arc…
A theory of higher colimits over categories of free presentations is developed. It is shown that different homology functors such as Hoshcshild and cyclic homology of algebras over a field of characteristic zero, simplicial derived…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
We consider the problem of finding an optimal statistical model for a given binary string. Following Kolmogorov, we use structure functions. In order to get concrete results, we replace Turing machines by finite automata and Kolmogorov…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
A wide variety of bidirectional data accessors, ranging from mixed optics to functor lenses, can be formalized within a unique framework-dependent optics. Starting from two indexed categories, which encode what maps are allowed in the…
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of…
For a finite group $G$, we define an equivariant cobordism category $\mathcal{C}_d^G$. Objects of the category are $(d-1)$-dimensional closed smooth $G$-manifolds and morphisms are smooth $d$-dimensional equivariant cobordisms. We identify…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…
A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…