-completeness is seldom monadic over graphs.
Adámek, Jiří, Kelly, G.M. (2000)
Theory and Applications of Categories [electronic only]
Similarity:
Adámek, Jiří, Kelly, G.M. (2000)
Theory and Applications of Categories [electronic only]
Similarity:
Lutz Schröder (2000)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
John MacDonald, Arthur Stone (1984)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Jaroslav Nešetřil, Aleš Pultr, Claude Tardif (2007)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We present an algebraic treatment of the correspondence of gaps and dualities in partial ordered classes induced by the morphism structures of certain categories which we call Heyting (such are for instance all cartesian closed categories, but there are other important examples). This allows to extend the results of [14] to a wide range of more general structures. Also, we introduce a notion of combined dualities and discuss the relation of their structure to that of the plain ones. ...
Kosta Došen (1998)
Zbornik Radova
Similarity:
Menni, Matías (2009)
Theory and Applications of Categories [electronic only]
Similarity:
Marco Grandis (1984)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Pisani, Claudio (2007)
Theory and Applications of Categories [electronic only]
Similarity: