English
Related papers

Related papers: Constructing Initial Algebras Using Inflationary I…

200 papers

Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…

Formal Languages and Automata Theory · Computer Science 2025-06-09 Anton Chernev , Corina Cîrstea , Helle Hvid Hansen , Clemens Kupke

We define a new notion of an algebraic model structure, in which the cofibrations and fibrations are retracts of coalgebras for comonads and algebras for monads, and prove "algebraic" analogs of classical results. Using a modified version…

Category Theory · Mathematics 2011-03-14 Emily Riehl

We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

Category Theory · Mathematics 2023-07-21 Paige Randall North , Maximilien Péroux

To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…

Logic in Computer Science · Computer Science 2026-05-01 Bastiaan Laarakker , Daniël Otten , Benno van den Berg

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…

Logic in Computer Science · Computer Science 2023-06-22 Marcelo P. Fiore , Andrew M. Pitts , S. C. Steenkamp

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

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 give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

Functional Analysis · Mathematics 2014-01-03 M. El Azhari

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

Operator Algebras · Mathematics 2007-05-23 Jack Spielberg

We study certain special tilting and cotilting modules for an algebra with positive dominant dimension, each of which is generated or cogenerated (and usually both) by projective-injectives. These modules have various interesting…

Representation Theory · Mathematics 2023-06-22 Matthew Pressland , Julia Sauter

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

Combinatorics · Mathematics 2025-12-23 David Bevan , Julien Condé

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

We present a construction of W-types in the setoid model of extensional Martin-L\"of type theory using dependent W-types in the underlying intensional theory. More precisely, we prove that the internal category of setoids has initial…

Logic · Mathematics 2023-06-22 Jacopo Emmenegger

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

Logic · Mathematics 2021-09-14 Ur Ya'ar

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

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…

Commutative Algebra · Mathematics 2019-05-08 Henri Lombardi , Claude Quitté

The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert…

Algebraic Topology · Mathematics 2007-05-23 Julio Rubio , Francis Sergeraert

Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…

Representation Theory · Mathematics 2008-09-06 Bruce Allison , Stephen Berman , Arturo Pianzola

Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps…

Logic in Computer Science · Computer Science 2024-08-07 Sam van Gool , Adrien Guatto , George Metcalfe , Simon Santschi