English
Related papers

Related papers: Algebraic cocompleteness and finitary functors

200 papers

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

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

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

Logic in Computer Science · Computer Science 2019-06-28 Jiri Adamek

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

We call a finitely complete category algebraically coherent when the change-of-base functors of its fibration of points are coherent, which means that they preserve finite limits and jointly strongly epimorphic pairs of arrows. We give…

Category Theory · Mathematics 2015-12-10 Alan S. Cigoli , James R. A. Gray , Tim Van der Linden

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

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

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 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

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

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

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

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

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

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…

Rings and Algebras · Mathematics 2022-03-18 Erhard Aichinger , Nebojša Mudrinski

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

On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…

Rings and Algebras · Mathematics 2014-11-25 Martha Lee Hollist Kilpack

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

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
‹ Prev 1 2 3 10 Next ›