English
Related papers

Related papers: Logical Construction of Final Coalgebras

200 papers

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

Category Theory · Mathematics 2009-06-01 Panagis Karazeris , Apostolos Matzaris , Jiri Velebil

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…

Logic in Computer Science · Computer Science 2021-05-21 Jiri Adamek

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…

Category Theory · Mathematics 2023-06-22 Jiří Adámek

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…

Logic in Computer Science · Computer Science 2007-05-23 J. Adamek , S. Milius , J. Velebil

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modeled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Category Theory · Mathematics 2017-10-23 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Logic in Computer Science · Computer Science 2019-09-09 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

We present a collection of results that imply that an endofunctor on a category has a terminal object obtainable as a countable limit of its terminal-coalgebra chain. This holds for finitary endofunctors preserving nonempty binary…

Logic in Computer Science · Computer Science 2025-09-03 Jiří Adámek , Stefan Milius , Lawrence S. Moss

Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…

Category Theory · Mathematics 2024-02-06 Jirí Adámek , Lurdes Sousa

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

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…

Logic in Computer Science · Computer Science 2019-03-14 Dirk Hofmann , Renato Neves , Pedro Nora

We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…

Category Theory · Mathematics 2023-03-06 Ezra Schoen , Jade Master , Clemens Kupke

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

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 prove that every locally Cartesian closed $\infty$-category with subobject classifier has a strict initial object and disjoint and universal binary coproducts.

Category Theory · Mathematics 2022-02-15 Jonas Frey , Nima Rasekh

We show that the category of coalgebras for the compact Vietoris endofunctor $\mathbb{V}$ on the category Top of topological spaces and continuous mappings is isomorphic to the category of all modally saturated Kripke structures. Extending…

Category Theory · Mathematics 2022-02-17 Heinz-Peter Gumm , Mona Taheri

We introduce the concept of cotensor coalgebra for a given bicomodule over a coalgebra in an abelian monoidal category. Under some further conditions we show that such a cotensor coalgebra exists and satisfies a meaningful universal…

Quantum Algebra · Mathematics 2010-08-27 A. Ardizzoni , C. Menini , D. Stefan

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

Algebraic Geometry · Mathematics 2022-03-15 Ivan Arzhantsev , Kirill Shakhmatov

We study generalized comatrix coalgebras and upper triangular comatrix coalgebras, which are not only a dualization but also an extension of classical generalized matrix algebras. We use these to answer several questions on Noetherian and…

Rings and Algebras · Mathematics 2017-04-25 M. C. Iovanov

For an endofunctor $H$ on a hyper-extensive category preserving countable coproducts we describe the free corecursive algebra on $Y$ as the coproduct of the final coalgebra for $H$ and the free $H$-algebra on $Y$. As a consequence, we…

Logic in Computer Science · Computer Science 2017-05-25 Jiří Adámek , Stefan Milius

Kurz et al. have recently shown that infinite $\lambda$-trees with finitely many free variables modulo $\alpha$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of…

Category Theory · Mathematics 2015-06-01 Stefan Milius , Thorsten Wißmann
‹ Prev 1 2 3 10 Next ›