Absolutely closed spaces and categories of algebras
Abstract clones and operads.
Abstract homotopy theory in procategories
Abstract initiality
We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preserving functors; morphisms that are initial w.r.t. all faithful monomorphism-preserving functors are monomorphisms, but need not be extremal; and (under weak...
Abstract physical traces.
Abstract pro arrows I
Abstract tangent functors
Accessible embeddings and the solution-set condition
Accessible set functors are universal
It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.
Actes des journées E.L.I.T. (Univ. Paris 7. 27 juin-2 juillet 1988 ). Corrigenda
Action groupoid in protomodular categories.
Actions and automorphisms of crossed modules
Actions, functors and the bar construction
Actions of some infinite Lie groups.
Acyclicity versus total acyclicity for complexes over noetherian rings.
Addendum to completion and closure
Addition Formulae for Field-Valued Continuous Functions on Topological Groups.
Additive Duality at Cosmall Injectives
Adhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Adhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.