Limits in categories and limit-preserving functors
Limits in double categories
Limits in generalized algebraic categories - contravariant case
Limits of functors and realisations of categories
Linking the closure and orthogonality properties of perfect morphisms in a category
We define perfect morphisms to be those which are the pullback of their image under a given endofunctor. The interplay of these morphisms with other generalisations of perfect maps is investigated. In particular, closure operator theory is used to link closure and orthogonality properties of such morphisms. A number of detailed examples are given.
Local extension of maps.
Localization for Hausdorff uniform bundles.
Locally cartesian closed categories without chosen constructions.
Logische Kategorien.
L'universalité des semi-fonctions récursives universelles
-completeness is seldom monadic over graphs.
Making factorizations compositive
The main aim of this paper is to obtain compositive cone factorizations from non-compositive ones by itereration. This is possible if and only if certain colimits of (possibly large) chains exist. In particular, we show that (strong-epi, mono) factorizations of cones exist if and only if joint coequalizers and colimits of chains of regular epimorphisms exist.
Maximal reflectivity preserving subextensions
Maximale ...-und ...1-Kategorien.
Meet-preserving free functors
Mehrfache Partialisierung von Kategorien
Metric enrichment, finite generation, and the path coreflection
We prove a number of results involving categories enriched over CMet, the category of complete metric spaces with possibly infinite distances. The category CPMet of path complete metric spaces is locally -presentable, closed monoidal, and coreflective in CMet. We also prove that the category CCMet of convex complete metric spaces is not closed monoidal and characterize the isometry--generated objects in CMet, CPMet and CCMet, answering questions by Di Liberti and Rosický. Other results include...
Model theoretic approach to topological functors
Models of sketches
Modular dynamical systems on networks
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations give rise to maps between dynamical systems on networks. This allows us to produce conjugacy between dynamical systems out of combinatorial data. In particular we show that surjective graph fibrations lead to synchrony subspaces in networks. The injective graph fibrations,...