Related papers: Fixpoint constructions in focused orthogonality mo…

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases,…

Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the…

We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…

This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…

We investigate the triangulated structure of stable monomorphism categories (filtered chain categories) over a Frobenius category. The high degree of symmetry of linear quivers leads to a plethora of semiorthogonal decompositions into…

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

Fixpoints are ubiquitous in computer science as they play a central role in providing a meaning to recursive and cyclic definitions. Bisimilarity, behavioural metrics, termination probabilities for Markov chains and stochastic games are…

Given a locally presentable category together with a suitable functorial cylinder object, we construct model structures which are sensitive to the `direction' of the cylinder. We show that the Covariant and Contravariant model structures on…

We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular…

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Optics and lenses are abstract categorical gadgets that model systems with bidirectional data flow. In this paper we observe that the denotational definition of optics - identifying two optics as equivalent by observing their behaviour from…

This paper contributes to the Alpay Algebra by demonstrating that the stable outcome of a self referential process, obtained by iterating a transformation through all ordinal stages, is identical to the unique equilibrium of an unbounded…

Termination of logic programs depends critically on the selection rule, i.e. the rule that determines which atom is selected in each resolution step. In this article, we classify programs (and queries) according to the selection rules for…

The bicategorical point of view provides a natural setting for many concepts in the representation theory of monoidal categories. We show that centers of twisted bimodule categories correspond to categories of 2-dimensional natural…

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Interactions between derivatives and fixpoints have many important applications in both computer science and mathematics. In this paper, we provide a categorical framework to combine fixpoints with derivatives by studying Cartesian…

We extend Makkai duality between coherent toposes and ultracategories to a duality between toposes with enough points and ultraconvergence spaces. Our proof generalizes and simplifies Makkai's original proof. Our main result can also be…

We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…