English
Related papers

Related papers: Beyond Initial Algebras and Final Coalgebras

200 papers

We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…

Category Theory · Mathematics 2025-09-03 Ezra Schoen , Jade Master , Clemens Kupke

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

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

For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper…

Logic in Computer Science · Computer Science 2015-07-01 Jiří Adámek , Stefan Milius , Lawrence S Moss , Lurdes Sousa

We consider two endofunctors of the form $~F:X\longrightarrow M\otimes X~$, where $~M~$ is a non degenerate module, related to the unit interval and the Sierpinski gasket, and their final co-algebras. The functors are defined on the…

Category Theory · Mathematics 2017-10-23 Annanthakrishna Manokaran , Romaine Jayewardene , Jayampathy Ratnayake

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…

Logic in Computer Science · Computer Science 2021-09-10 Stefan Milius , Jiří Adámek , Henning Urbat

The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e. a…

Logic in Computer Science · Computer Science 2023-06-22 Stefan Milius

Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…

Logic in Computer Science · Computer Science 2016-07-27 Stefan Milius , Lutz Schröder , Thorsten Wißmann

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

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

Category Theory · Mathematics 2007-05-23 Luigi Santocanale

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson

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

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

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

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

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

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

Algebraic Geometry · Mathematics 2008-08-20 E. Daniyarova , A. Myasnikov , V. Remeslennikov

The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science. In this paper, we identify a general fibrational condition for the IA-FC…

Logic in Computer Science · Computer Science 2021-08-25 Mayuko Kori , Ichiro Hasuo , Shin-ya Katsumata

Fixed point subalgebras of finite dimensional factor algebras of algebras of polynomials in n indeterminates over the finite field $\mathbb F_2$ (with respect to all $\mathbb F_2$-algebra automorphisms) are fully described.

Rings and Algebras · Mathematics 2012-09-04 Miroslav Kureš
‹ Prev 1 2 3 10 Next ›