English
Related papers

Related papers: Terminal Coalgebras in Countably Many Steps

200 papers

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…

Logic in Computer Science · Computer Science 2020-02-18 Jiří Adámek , Stefan Milius , Lawrence S. Moss

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

This paper introduces an endofunctor $\VT$ on the category of frames, parametrized by an endofunctor $\T$ on the category $\Set$ that satisfies certain constraints. This generalizes Johnstone's construction of the Vietoris powerlocale, in…

Logic in Computer Science · Computer Science 2012-02-16 Yde Venema , Steve Vickers , Jacob Vosmaer

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

Logic · Mathematics 2007-05-23 Benno van den Berg , Federico De Marchi

We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras. In the first part of the paper we construct an endofunctor on the category of…

Logic in Computer Science · Computer Science 2023-06-22 Guram Bezhanishvili , Nick Bezhanishvili , Jim de Groot

We show that both the $\infty$-category of $(\infty, \infty)$-categories with inductively defined equivalences, and with coinductively defined equivalences, satisfy universal properties with respect to weak enrichment in the sense of Gepner…

Category Theory · Mathematics 2024-09-24 Zach Goldthorpe

It is a classical result of categorical algebra, due to Lawvere and Linton, that finitary varieties of algebras (in the sense of Birkhoff) are dually equivalent to finitary monads on $Set$. Recent work of Ad\'amek, Dost\'al, and Velebil has…

Category Theory · Mathematics 2023-10-10 Jason Parker

We extend Barr's well-known characterization of the final coalgebra of a $Set$-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a $Set$-monad $\mathbf{M}$ for functors arising as liftings.…

Category Theory · Mathematics 2010-05-07 Adriana Balan , Alexander Kurz

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

The construction of the cotensor coalgebra for an "abelian monoidal" category $\M$ which is also cocomplete, complete and AB5, was performed in [A. Ardizzoni, C. Menini and D. \c{S}tefan, \emph{Cotensor Coalgebras in Monoidal Categories},…

Category Theory · Mathematics 2010-08-27 A. Ardizzoni

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

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…

K-Theory and Homology · Mathematics 2023-07-14 Aurélien Djament , Antoine Touzé

For a commutative quantale $\mathcal{V}$, the category $\mathcal{V}-cat$ can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor $T$ (formalised as an endofunctor on sets) can be…

Category Theory · Mathematics 2023-06-22 Adriana Balan , Alexander Kurz , Jiří Velebil

Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…

Category Theory · Mathematics 2020-01-15 Thorsten Wißmann , Stefan Milius , Shin-ya Katsumata , Jérémy Dubut

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

We prove that the stable endomorphism rings of rigid objects in a suitable Frobenius category have only finitely many basic algebras in their derived equivalence class and that these are precisely the stable endomorphism rings of objects…

Representation Theory · Mathematics 2020-02-11 Jenny August

We construct a category $\mathrm{HomCob}$ whose objects are {\it homotopically 1-finitely generated} topological spaces, and whose morphisms are {\it cofibrant cospans}. Given a manifold submanifold pair $(M,A)$, we prove that there exists…

Mathematical Physics · Physics 2022-09-01 Fiona Torzewska

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

Logic in Computer Science · Computer Science 2022-02-15 Jiří Adámek , Stefan Milius , Lawrence S. Moss

In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…

Logic in Computer Science · Computer Science 2016-07-12 Marco Peressotti

Two types of finite element spaces on a tetrahedron are constructed for divdiv conforming symmetric tensors in three dimensions. The key tools of the construction are the decomposition of polynomial tensor spaces and the characterization of…

Numerical Analysis · Mathematics 2021-03-05 Long Chen , Xuehai Huang